{"diffoscope-json-version": 1, "source1": "/srv/reproducible-results/rbuild-debian/r-b-build.L0MwzBhL/b1/liblemon_1.3.1+dfsg-6_armhf.changes", "source2": "/srv/reproducible-results/rbuild-debian/r-b-build.L0MwzBhL/b2/liblemon_1.3.1+dfsg-6_armhf.changes", "unified_diff": null, "details": [{"source1": "Files", "source2": "Files", "unified_diff": "@@ -1,7 +1,7 @@\n \n f6a813914388c0f9544b4e1f1d0d1409 322252 libdevel optional liblemon-dev_1.3.1+dfsg-6_armhf.deb\n- fce775d1f731ed47920c87604d20aac0 3476976 doc optional liblemon-doc_1.3.1+dfsg-6_all.deb\n+ 2b3be72465e075c495c39d2bb41f324a 3477388 doc optional liblemon-doc_1.3.1+dfsg-6_all.deb\n e1c8e9e30f07b1d73854ef9fd6e80e23 2680236 debug optional liblemon-utils-dbgsym_1.3.1+dfsg-6_armhf.deb\n ab053ab59d47550584f5d12f8b4830e6 163884 science optional liblemon-utils_1.3.1+dfsg-6_armhf.deb\n a4bf1acc4d8049238b7c44658a8f3a07 519204 debug optional liblemon1.3.1-dbgsym_1.3.1+dfsg-6_armhf.deb\n 32d97a3a70264a571bcc3d1784b33d06 47976 libs optional liblemon1.3.1_1.3.1+dfsg-6_armhf.deb\n"}, {"source1": "liblemon-doc_1.3.1+dfsg-6_all.deb", "source2": "liblemon-doc_1.3.1+dfsg-6_all.deb", "unified_diff": null, "details": [{"source1": "file list", "source2": "file list", "unified_diff": "@@ -1,3 +1,3 @@\n -rw-r--r-- 0 0 0 4 2022-07-25 18:36:57.000000 debian-binary\n--rw-r--r-- 0 0 0 40096 2022-07-25 18:36:57.000000 control.tar.xz\n--rw-r--r-- 0 0 0 3436688 2022-07-25 18:36:57.000000 data.tar.xz\n+-rw-r--r-- 0 0 0 40272 2022-07-25 18:36:57.000000 control.tar.xz\n+-rw-r--r-- 0 0 0 3436924 2022-07-25 18:36:57.000000 data.tar.xz\n"}, {"source1": "control.tar.xz", "source2": "control.tar.xz", "unified_diff": null, "details": [{"source1": "control.tar", "source2": "control.tar", "unified_diff": null, "details": [{"source1": "./md5sums", "source2": "./md5sums", "unified_diff": null, "details": [{"source1": "./md5sums", "source2": "./md5sums", "comments": ["Files differ"], "unified_diff": null}, {"source1": "line order", "source2": "line order", "unified_diff": "@@ -1,13 +1,14 @@\n usr/share/doc/lemon/html/_formulas.tex.gz\n usr/share/doc/lemon/html/_formulas_dark.tex.gz\n-usr/share/doc/lemon/html/a00005.html\n+usr/share/doc/lemon/html/a00002.html\n usr/share/doc/lemon/html/a00008.html\n usr/share/doc/lemon/html/a00014.html\n usr/share/doc/lemon/html/a00164.html\n+usr/share/doc/lemon/html/a00167.html\n usr/share/doc/lemon/html/a00170.html\n usr/share/doc/lemon/html/a00173.html\n usr/share/doc/lemon/html/a00176.html\n usr/share/doc/lemon/html/a00179.html\n usr/share/doc/lemon/html/a00182.html\n usr/share/doc/lemon/html/a00185.html\n usr/share/doc/lemon/html/a00188.html\n@@ -64,15 +65,14 @@\n usr/share/doc/lemon/html/a00341.html\n usr/share/doc/lemon/html/a00344.html\n usr/share/doc/lemon/html/a00347.html\n usr/share/doc/lemon/html/a00350.html\n usr/share/doc/lemon/html/a00353.html\n usr/share/doc/lemon/html/a00356.html\n usr/share/doc/lemon/html/a00359.html\n-usr/share/doc/lemon/html/a00365.html\n usr/share/doc/lemon/html/a00368.html\n usr/share/doc/lemon/html/a00371.html\n usr/share/doc/lemon/html/a00374.html\n usr/share/doc/lemon/html/a00377.html\n usr/share/doc/lemon/html/a00380.html\n usr/share/doc/lemon/html/a00383.html\n usr/share/doc/lemon/html/a00386.html\n@@ -86,15 +86,15 @@\n usr/share/doc/lemon/html/a00410.html\n usr/share/doc/lemon/html/a00413.html\n usr/share/doc/lemon/html/a00416.html\n usr/share/doc/lemon/html/a00419.html\n usr/share/doc/lemon/html/a00422.html\n usr/share/doc/lemon/html/a00425.html\n usr/share/doc/lemon/html/a00428.html\n-usr/share/doc/lemon/html/a00479.html\n+usr/share/doc/lemon/html/a00461.html\n usr/share/doc/lemon/html/a00482.html\n usr/share/doc/lemon/html/a00485.html\n usr/share/doc/lemon/html/a00488.html\n usr/share/doc/lemon/html/a00491.html\n usr/share/doc/lemon/html/a00494.html\n usr/share/doc/lemon/html/a00497.html\n usr/share/doc/lemon/html/a00500.html\n"}]}]}]}, {"source1": "data.tar.xz", "source2": "data.tar.xz", "unified_diff": null, "details": [{"source1": "data.tar", "source2": "data.tar", "unified_diff": null, "details": [{"source1": "file list", "source2": "file list", "unified_diff": "@@ -2,110 +2,110 @@\n drwxr-xr-x 0 root (0) root (0) 0 2022-07-25 18:36:57.000000 ./usr/\n drwxr-xr-x 0 root (0) root (0) 0 2022-07-25 18:36:57.000000 ./usr/share/\n drwxr-xr-x 0 root (0) root (0) 0 2022-07-25 18:36:57.000000 ./usr/share/doc/\n drwxr-xr-x 0 root (0) root (0) 0 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/\n drwxr-xr-x 0 root (0) root (0) 0 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/\n -rw-r--r-- 0 root (0) root (0) 1335 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/_formulas.tex.gz\n -rw-r--r-- 0 root (0) root (0) 1349 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/_formulas_dark.tex.gz\n--rw-r--r-- 0 root (0) root (0) 21942 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00005.html\n+-rw-r--r-- 0 root (0) root (0) 13055 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00002.html\n -rw-r--r-- 0 root (0) root (0) 15571 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00008.html\n--rw-r--r-- 0 root (0) root (0) 13055 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00014.html\n+-rw-r--r-- 0 root (0) root (0) 21942 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00014.html\n -rw-r--r-- 0 root (0) root (0) 6753 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00164.html\n--rw-r--r-- 0 root (0) root (0) 4138 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00170.html\n--rw-r--r-- 0 root (0) root (0) 12365 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00173.html\n--rw-r--r-- 0 root (0) root (0) 5479 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00176.html\n--rw-r--r-- 0 root (0) root (0) 4676 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00179.html\n--rw-r--r-- 0 root (0) root (0) 5404 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00182.html\n--rw-r--r-- 0 root (0) root (0) 7538 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00185.html\n--rw-r--r-- 0 root (0) root (0) 5029 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00188.html\n--rw-r--r-- 0 root (0) root (0) 6498 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00191.html\n--rw-r--r-- 0 root (0) root (0) 5489 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00194.html\n--rw-r--r-- 0 root (0) root (0) 7252 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00197.html\n--rw-r--r-- 0 root (0) root (0) 8558 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00200.html\n--rw-r--r-- 0 root (0) root (0) 4824 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00203.html\n--rw-r--r-- 0 root (0) root (0) 5303 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00206.html\n--rw-r--r-- 0 root (0) root (0) 9418 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00209.html\n--rw-r--r-- 0 root (0) root (0) 6907 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00212.html\n--rw-r--r-- 0 root (0) root (0) 3960 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00215.html\n--rw-r--r-- 0 root (0) root (0) 6564 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00218.html\n--rw-r--r-- 0 root (0) root (0) 5052 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00221.html\n--rw-r--r-- 0 root (0) root (0) 8889 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00224.html\n--rw-r--r-- 0 root (0) root (0) 4891 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00227.html\n--rw-r--r-- 0 root (0) root (0) 5568 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00230.html\n--rw-r--r-- 0 root (0) root (0) 7771 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00233.html\n--rw-r--r-- 0 root (0) root (0) 4688 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00236.html\n--rw-r--r-- 0 root (0) root (0) 4771 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00239.html\n--rw-r--r-- 0 root (0) root (0) 13367 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00242.html\n--rw-r--r-- 0 root (0) root (0) 11096 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00245.html\n--rw-r--r-- 0 root (0) root (0) 5159 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00248.html\n--rw-r--r-- 0 root (0) root (0) 11805 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00251.html\n--rw-r--r-- 0 root (0) root (0) 6079 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00254.html\n--rw-r--r-- 0 root (0) root (0) 6317 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00257.html\n--rw-r--r-- 0 root (0) root (0) 4047 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00260.html\n--rw-r--r-- 0 root (0) root (0) 9099 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00263.html\n--rw-r--r-- 0 root (0) root (0) 13386 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00266.html\n--rw-r--r-- 0 root (0) root (0) 5776 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00269.html\n--rw-r--r-- 0 root (0) root (0) 6194 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00272.html\n--rw-r--r-- 0 root (0) root (0) 5091 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00275.html\n--rw-r--r-- 0 root (0) root (0) 5743 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00278.html\n--rw-r--r-- 0 root (0) root (0) 8409 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00281.html\n--rw-r--r-- 0 root (0) root (0) 4807 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00284.html\n--rw-r--r-- 0 root (0) root (0) 4820 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00287.html\n--rw-r--r-- 0 root (0) root (0) 6614 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00290.html\n--rw-r--r-- 0 root (0) root (0) 7642 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00293.html\n--rw-r--r-- 0 root (0) root (0) 5244 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00296.html\n--rw-r--r-- 0 root (0) root (0) 11466 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00299.html\n--rw-r--r-- 0 root (0) root (0) 4801 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00302.html\n--rw-r--r-- 0 root (0) root (0) 25466 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00305.html\n--rw-r--r-- 0 root (0) root (0) 5128 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00308.html\n--rw-r--r-- 0 root (0) root (0) 5779 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00311.html\n--rw-r--r-- 0 root (0) root (0) 5631 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00314.html\n--rw-r--r-- 0 root (0) root (0) 7028 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00317.html\n--rw-r--r-- 0 root (0) root (0) 4039 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00320.html\n--rw-r--r-- 0 root (0) root (0) 4956 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00323.html\n--rw-r--r-- 0 root (0) root (0) 5275 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00326.html\n--rw-r--r-- 0 root (0) root (0) 24968 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00329.html\n--rw-r--r-- 0 root (0) root (0) 5024 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00332.html\n--rw-r--r-- 0 root (0) root (0) 5559 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00335.html\n--rw-r--r-- 0 root (0) root (0) 5305 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00338.html\n--rw-r--r-- 0 root (0) root (0) 3972 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00341.html\n--rw-r--r-- 0 root (0) root (0) 6870 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00344.html\n--rw-r--r-- 0 root (0) root (0) 5518 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00347.html\n--rw-r--r-- 0 root (0) root (0) 7172 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00350.html\n--rw-r--r-- 0 root (0) root (0) 13145 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00353.html\n--rw-r--r-- 0 root (0) root (0) 5920 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00356.html\n--rw-r--r-- 0 root (0) root (0) 13145 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00359.html\n--rw-r--r-- 0 root (0) root (0) 4999 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00365.html\n--rw-r--r-- 0 root (0) root (0) 4750 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00368.html\n--rw-r--r-- 0 root (0) root (0) 7457 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00371.html\n--rw-r--r-- 0 root (0) root (0) 11468 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00374.html\n--rw-r--r-- 0 root (0) root (0) 7225 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00377.html\n--rw-r--r-- 0 root (0) root (0) 6022 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00380.html\n--rw-r--r-- 0 root (0) root (0) 43970 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00383.html\n--rw-r--r-- 0 root (0) root (0) 7284 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00386.html\n--rw-r--r-- 0 root (0) root (0) 6937 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00389.html\n--rw-r--r-- 0 root (0) root (0) 6368 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00392.html\n--rw-r--r-- 0 root (0) root (0) 5408 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00395.html\n--rw-r--r-- 0 root (0) root (0) 4896 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00398.html\n--rw-r--r-- 0 root (0) root (0) 11757 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00401.html\n--rw-r--r-- 0 root (0) root (0) 7277 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00404.html\n--rw-r--r-- 0 root (0) root (0) 6466 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00407.html\n--rw-r--r-- 0 root (0) root (0) 4812 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00410.html\n--rw-r--r-- 0 root (0) root (0) 6608 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00413.html\n--rw-r--r-- 0 root (0) root (0) 5100 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00416.html\n--rw-r--r-- 0 root (0) root (0) 6852 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00419.html\n--rw-r--r-- 0 root (0) root (0) 8570 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00422.html\n--rw-r--r-- 0 root (0) root (0) 8133 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00425.html\n--rw-r--r-- 0 root (0) root (0) 5688 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00428.html\n--rw-r--r-- 0 root (0) root (0) 4297 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00479.html\n--rw-r--r-- 0 root (0) root (0) 10931 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00482.html\n--rw-r--r-- 0 root (0) root (0) 9180 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00485.html\n--rw-r--r-- 0 root (0) root (0) 22221 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00488.html\n--rw-r--r-- 0 root (0) root (0) 5330 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00491.html\n--rw-r--r-- 0 root (0) root (0) 13665 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00494.html\n+-rw-r--r-- 0 root (0) root (0) 5091 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00167.html\n+-rw-r--r-- 0 root (0) root (0) 7225 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00170.html\n+-rw-r--r-- 0 root (0) root (0) 5518 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00173.html\n+-rw-r--r-- 0 root (0) root (0) 6608 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00176.html\n+-rw-r--r-- 0 root (0) root (0) 8570 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00179.html\n+-rw-r--r-- 0 root (0) root (0) 7457 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00182.html\n+-rw-r--r-- 0 root (0) root (0) 4771 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00185.html\n+-rw-r--r-- 0 root (0) root (0) 6907 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00188.html\n+-rw-r--r-- 0 root (0) root (0) 7252 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00191.html\n+-rw-r--r-- 0 root (0) root (0) 9418 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00194.html\n+-rw-r--r-- 0 root (0) root (0) 11805 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00197.html\n+-rw-r--r-- 0 root (0) root (0) 6564 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00200.html\n+-rw-r--r-- 0 root (0) root (0) 5559 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00203.html\n+-rw-r--r-- 0 root (0) root (0) 7284 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00206.html\n+-rw-r--r-- 0 root (0) root (0) 5024 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00209.html\n+-rw-r--r-- 0 root (0) root (0) 6079 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00212.html\n+-rw-r--r-- 0 root (0) root (0) 5275 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00215.html\n+-rw-r--r-- 0 root (0) root (0) 5128 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00218.html\n+-rw-r--r-- 0 root (0) root (0) 7028 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00221.html\n+-rw-r--r-- 0 root (0) root (0) 3960 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00224.html\n+-rw-r--r-- 0 root (0) root (0) 7538 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00227.html\n+-rw-r--r-- 0 root (0) root (0) 13145 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00230.html\n+-rw-r--r-- 0 root (0) root (0) 25466 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00233.html\n+-rw-r--r-- 0 root (0) root (0) 4676 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00236.html\n+-rw-r--r-- 0 root (0) root (0) 8558 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00239.html\n+-rw-r--r-- 0 root (0) root (0) 8889 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00242.html\n+-rw-r--r-- 0 root (0) root (0) 5303 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00245.html\n+-rw-r--r-- 0 root (0) root (0) 7771 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00248.html\n+-rw-r--r-- 0 root (0) root (0) 4891 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00251.html\n+-rw-r--r-- 0 root (0) root (0) 6022 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00254.html\n+-rw-r--r-- 0 root (0) root (0) 4820 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00257.html\n+-rw-r--r-- 0 root (0) root (0) 6614 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00260.html\n+-rw-r--r-- 0 root (0) root (0) 24968 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00263.html\n+-rw-r--r-- 0 root (0) root (0) 5404 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00266.html\n+-rw-r--r-- 0 root (0) root (0) 4956 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00269.html\n+-rw-r--r-- 0 root (0) root (0) 5688 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00272.html\n+-rw-r--r-- 0 root (0) root (0) 5244 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00275.html\n+-rw-r--r-- 0 root (0) root (0) 7642 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00278.html\n+-rw-r--r-- 0 root (0) root (0) 4688 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00281.html\n+-rw-r--r-- 0 root (0) root (0) 4801 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00284.html\n+-rw-r--r-- 0 root (0) root (0) 13145 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00287.html\n+-rw-r--r-- 0 root (0) root (0) 11757 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00290.html\n+-rw-r--r-- 0 root (0) root (0) 5408 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00293.html\n+-rw-r--r-- 0 root (0) root (0) 4896 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00296.html\n+-rw-r--r-- 0 root (0) root (0) 9099 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00299.html\n+-rw-r--r-- 0 root (0) root (0) 8133 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00302.html\n+-rw-r--r-- 0 root (0) root (0) 4138 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00305.html\n+-rw-r--r-- 0 root (0) root (0) 4039 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00308.html\n+-rw-r--r-- 0 root (0) root (0) 5920 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00311.html\n+-rw-r--r-- 0 root (0) root (0) 8409 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00314.html\n+-rw-r--r-- 0 root (0) root (0) 6194 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00317.html\n+-rw-r--r-- 0 root (0) root (0) 5631 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00320.html\n+-rw-r--r-- 0 root (0) root (0) 6937 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00323.html\n+-rw-r--r-- 0 root (0) root (0) 4047 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00326.html\n+-rw-r--r-- 0 root (0) root (0) 4824 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00329.html\n+-rw-r--r-- 0 root (0) root (0) 5100 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00332.html\n+-rw-r--r-- 0 root (0) root (0) 4812 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00335.html\n+-rw-r--r-- 0 root (0) root (0) 13386 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00338.html\n+-rw-r--r-- 0 root (0) root (0) 5305 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00341.html\n+-rw-r--r-- 0 root (0) root (0) 13367 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00344.html\n+-rw-r--r-- 0 root (0) root (0) 5743 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00347.html\n+-rw-r--r-- 0 root (0) root (0) 6466 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00350.html\n+-rw-r--r-- 0 root (0) root (0) 11468 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00353.html\n+-rw-r--r-- 0 root (0) root (0) 6852 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00356.html\n+-rw-r--r-- 0 root (0) root (0) 5489 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00359.html\n+-rw-r--r-- 0 root (0) root (0) 6368 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00368.html\n+-rw-r--r-- 0 root (0) root (0) 4807 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00371.html\n+-rw-r--r-- 0 root (0) root (0) 3972 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00374.html\n+-rw-r--r-- 0 root (0) root (0) 11466 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00377.html\n+-rw-r--r-- 0 root (0) root (0) 5052 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00380.html\n+-rw-r--r-- 0 root (0) root (0) 5568 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00383.html\n+-rw-r--r-- 0 root (0) root (0) 5159 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00386.html\n+-rw-r--r-- 0 root (0) root (0) 43970 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00389.html\n+-rw-r--r-- 0 root (0) root (0) 7172 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00392.html\n+-rw-r--r-- 0 root (0) root (0) 5479 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00395.html\n+-rw-r--r-- 0 root (0) root (0) 6317 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00398.html\n+-rw-r--r-- 0 root (0) root (0) 5779 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00401.html\n+-rw-r--r-- 0 root (0) root (0) 6870 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00404.html\n+-rw-r--r-- 0 root (0) root (0) 6498 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00407.html\n+-rw-r--r-- 0 root (0) root (0) 5029 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00410.html\n+-rw-r--r-- 0 root (0) root (0) 7277 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00413.html\n+-rw-r--r-- 0 root (0) root (0) 4999 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00416.html\n+-rw-r--r-- 0 root (0) root (0) 5776 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00419.html\n+-rw-r--r-- 0 root (0) root (0) 11096 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00422.html\n+-rw-r--r-- 0 root (0) root (0) 12365 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00425.html\n+-rw-r--r-- 0 root (0) root (0) 4750 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00428.html\n+-rw-r--r-- 0 root (0) root (0) 4297 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00461.html\n+-rw-r--r-- 0 root (0) root (0) 13665 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00482.html\n+-rw-r--r-- 0 root (0) root (0) 5330 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00485.html\n+-rw-r--r-- 0 root (0) root (0) 10931 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00488.html\n+-rw-r--r-- 0 root (0) root (0) 22221 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00491.html\n+-rw-r--r-- 0 root (0) root (0) 9180 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00494.html\n -rw-r--r-- 0 root (0) root (0) 4941 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00497.html\n -rw-r--r-- 0 root (0) root (0) 4261 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00500.html\n -rw-r--r-- 0 root (0) root (0) 4698 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00503.html\n -rw-r--r-- 0 root (0) root (0) 6174 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00506.html\n -rw-r--r-- 0 root (0) root (0) 5518 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00512.html\n -rw-r--r-- 0 root (0) root (0) 16148 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00513.html\n -rw-r--r-- 0 root (0) root (0) 36037 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/a00514.html\n@@ -1739,15 +1739,15 @@\n -rw-r--r-- 0 root (0) root (0) 32 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/graph_legend.md5\n -rw-r--r-- 0 root (0) root (0) 23370 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/graph_legend.png\n -rw-r--r-- 0 root (0) root (0) 24986 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/graph_to_eps.png\n -rw-r--r-- 0 root (0) root (0) 13716 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/grid_graph.png\n -rw-r--r-- 0 root (0) root (0) 215953 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/hierarchy.html\n -rw-r--r-- 0 root (0) root (0) 4857 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/index.html\n -rw-r--r-- 0 root (0) root (0) 176630 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/jquery.js\n--rw-r--r-- 0 root (0) root (0) 143608 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/lemon.tag.gz\n+-rw-r--r-- 0 root (0) root (0) 143614 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/lemon.tag.gz\n -rw-r--r-- 0 root (0) root (0) 11348 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/matching.png\n -rw-r--r-- 0 root (0) root (0) 5925 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/menu.js\n -rw-r--r-- 0 root (0) root (0) 9074 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/menudata.js\n -rw-r--r-- 0 root (0) root (0) 582 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/minus.svg\n -rw-r--r-- 0 root (0) root (0) 582 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/minusd.svg\n -rw-r--r-- 0 root (0) root (0) 16591 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/namespacemembers.html\n -rw-r--r-- 0 root (0) root (0) 13475 2022-07-25 18:36:57.000000 ./usr/share/doc/lemon/html/namespacemembers_func.html\n"}, {"source1": "./usr/share/doc/lemon/html/a00008.html", "source2": "./usr/share/doc/lemon/html/a00008.html", "unified_diff": "@@ -93,15 +93,15 @@\n
* This software is provided "AS IS" with no warranty of any kind,
\n
* express or implied, and with no claim as to its suitability for any
\n
* purpose.
\n
*
\n
*/
\n
\n
\n-
#include <lemon/arg_parser.h>
\n+
#include <lemon/arg_parser.h>
\n
\n
using namespace lemon;
\n
int main(int argc, char **argv)
\n
{
\n
// Initialize the argument parser
\n
ArgParser ap(argc, argv);
\n
int i;
\n@@ -179,19 +179,19 @@\n
<< ap.files().size() << " file arguments were given. They are:\\n";
\n
}
\n
for(unsigned int i=0;i<ap.files().size();++i)
\n
std::cout << " '" << ap.files()[i] << "'\\n";
\n
\n
return 0;
\n
}
\n-
arg_parser.h
A tool to parse command line arguments.
\n+
arg_parser.h
A tool to parse command line arguments.
\n
lemon
The namespace of LEMON.
Definition groups.dox:19
\n
lemon::ArgParserException
Exception used by ArgParser.
Definition arg_parser.h:41
\n
lemon::ArgParser
Command line arguments parser.
Definition arg_parser.h:88
\n-
#include <lemon/arg_parser.h>
\n+
#include <lemon/arg_parser.h>
\n
\n \n
\n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
\n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00014.html", "source2": "./usr/share/doc/lemon/html/a00014.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: demo/lgf_demo.cc File Reference\n+My Project: demo/graph_to_eps_demo.cc File Reference\n \n \n \n \n \n \n \n@@ -69,49 +69,20 @@\n \n
\n \n
\n \n
\n-
lgf_demo.cc File Reference
Demo Programs
\n+
graph_to_eps_demo.cc File Reference
Demo Programs
\n
\n
\n

Detailed Description

\n-

This program gives an example of how to read and write a digraph and additional maps from/to a stream or a file using the LGF format.

\n-

The \"digraph.lgf\" file:

@nodes
\n-
label
\n-
0
\n-
1
\n-
2
\n-
3
\n-
4
\n-
5
\n-
6
\n-
7
\n-
@arcs
\n-
label capacity
\n-
0 1 0 16
\n-
0 2 1 12
\n-
0 3 2 20
\n-
1 2 3 10
\n-
1 4 4 10
\n-
1 5 5 13
\n-
2 3 6 10
\n-
2 4 7 8
\n-
2 6 8 8
\n-
5 3 9 20
\n-
3 6 10 25
\n-
4 7 11 15
\n-
5 7 12 15
\n-
6 7 13 18
\n-
@attributes
\n-
source 0
\n-
target 7
\n-

And the program which reads it and prints the digraph to the standard output:

/* -*- mode: C++; indent-tabs-mode: nil; -*-
\n+

This demo program shows examples how to use the function graphToEps(). It takes no input but simply creates seven .eps files demonstrating the capability of graphToEps(), and showing how to draw directed graphs, how to handle parallel egdes, how to change the properties (like color, shape, size, title etc.) of nodes and arcs individually using appropriate graph maps.

\n+
/* -*- mode: C++; indent-tabs-mode: nil; -*-
\n
*
\n
* This file is a part of LEMON, a generic C++ optimization library.
\n
*
\n
* Copyright (C) 2003-2009
\n
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
\n
* (Egervary Research Group on Combinatorial Optimization, EGRES).
\n
*
\n@@ -122,64 +93,202 @@\n
* This software is provided "AS IS" with no warranty of any kind,
\n
* express or implied, and with no claim as to its suitability for any
\n
* purpose.
\n
*
\n
*/
\n
\n
\n-
#include <iostream>
\n-
#include <lemon/smart_graph.h>
\n-
#include <lemon/lgf_reader.h>
\n-
#include <lemon/lgf_writer.h>
\n+
#include<lemon/list_graph.h>
\n+
#include<lemon/graph_to_eps.h>
\n+
#include<lemon/math.h>
\n
\n+
using namespace std;
\n
using namespace lemon;
\n
\n-
int main() {
\n-
SmartDigraph g;
\n-
SmartDigraph::ArcMap<int> cap(g);
\n-
SmartDigraph::Node s, t;
\n-
\n-
try {
\n-
digraphReader(g, "digraph.lgf"). // read the directed graph into g
\n-
arcMap("capacity", cap). // read the 'capacity' arc map into cap
\n-
node("source", s). // read 'source' node to s
\n-
node("target", t). // read 'target' node to t
\n-
run();
\n-
} catch (Exception& error) { // check if there was any error
\n-
std::cerr << "Error: " << error.what() << std::endl;
\n-
return -1;
\n+
int main()
\n+
{
\n+
Palette palette;
\n+
Palette paletteW(true);
\n+
\n+
// Create a small digraph
\n+
ListDigraph g;
\n+
typedef ListDigraph::Node Node;
\n+
typedef ListDigraph::NodeIt NodeIt;
\n+
typedef ListDigraph::Arc Arc;
\n+
typedef dim2::Point<int> Point;
\n+
\n+
Node n1=g.addNode();
\n+
Node n2=g.addNode();
\n+
Node n3=g.addNode();
\n+
Node n4=g.addNode();
\n+
Node n5=g.addNode();
\n+
\n+
ListDigraph::NodeMap<Point> coords(g);
\n+
ListDigraph::NodeMap<double> sizes(g);
\n+
ListDigraph::NodeMap<int> colors(g);
\n+
ListDigraph::NodeMap<int> shapes(g);
\n+
ListDigraph::ArcMap<int> acolors(g);
\n+
ListDigraph::ArcMap<int> widths(g);
\n+
\n+
coords[n1]=Point(50,50); sizes[n1]=1; colors[n1]=1; shapes[n1]=0;
\n+
coords[n2]=Point(50,70); sizes[n2]=2; colors[n2]=2; shapes[n2]=2;
\n+
coords[n3]=Point(70,70); sizes[n3]=1; colors[n3]=3; shapes[n3]=0;
\n+
coords[n4]=Point(70,50); sizes[n4]=2; colors[n4]=4; shapes[n4]=1;
\n+
coords[n5]=Point(85,60); sizes[n5]=3; colors[n5]=5; shapes[n5]=2;
\n+
\n+
Arc a;
\n+
\n+
a=g.addArc(n1,n2); acolors[a]=0; widths[a]=1;
\n+
a=g.addArc(n2,n3); acolors[a]=0; widths[a]=1;
\n+
a=g.addArc(n3,n5); acolors[a]=0; widths[a]=3;
\n+
a=g.addArc(n5,n4); acolors[a]=0; widths[a]=1;
\n+
a=g.addArc(n4,n1); acolors[a]=0; widths[a]=1;
\n+
a=g.addArc(n2,n4); acolors[a]=1; widths[a]=2;
\n+
a=g.addArc(n3,n4); acolors[a]=2; widths[a]=1;
\n+
\n+
IdMap<ListDigraph,Node> id(g);
\n+
\n+
// Create .eps files showing the digraph with different options
\n+
cout << "Create 'graph_to_eps_demo_out_1_pure.eps'" << endl;
\n+
graphToEps(g,"graph_to_eps_demo_out_1_pure.eps").
\n+
coords(coords).
\n+
title("Sample .eps figure").
\n+
copyright("(C) 2003-2009 LEMON Project").
\n+
run();
\n+
\n+
cout << "Create 'graph_to_eps_demo_out_2.eps'" << endl;
\n+
graphToEps(g,"graph_to_eps_demo_out_2.eps").
\n+
coords(coords).
\n+
title("Sample .eps figure").
\n+
copyright("(C) 2003-2009 LEMON Project").
\n+
absoluteNodeSizes().absoluteArcWidths().
\n+
nodeScale(2).nodeSizes(sizes).
\n+
nodeShapes(shapes).
\n+
nodeColors(composeMap(palette,colors)).
\n+
arcColors(composeMap(palette,acolors)).
\n+
arcWidthScale(.4).arcWidths(widths).
\n+
nodeTexts(id).nodeTextSize(3).
\n+
run();
\n+
\n+
cout << "Create 'graph_to_eps_demo_out_3_arr.eps'" << endl;
\n+
graphToEps(g,"graph_to_eps_demo_out_3_arr.eps").
\n+
title("Sample .eps figure (with arrowheads)").
\n+
copyright("(C) 2003-2009 LEMON Project").
\n+
absoluteNodeSizes().absoluteArcWidths().
\n+
nodeColors(composeMap(palette,colors)).
\n+
coords(coords).
\n+
nodeScale(2).nodeSizes(sizes).
\n+
nodeShapes(shapes).
\n+
arcColors(composeMap(palette,acolors)).
\n+
arcWidthScale(.4).arcWidths(widths).
\n+
nodeTexts(id).nodeTextSize(3).
\n+
drawArrows().arrowWidth(2).arrowLength(2).
\n+
run();
\n+
\n+
// Add more arcs to the digraph
\n+
a=g.addArc(n1,n4); acolors[a]=2; widths[a]=1;
\n+
a=g.addArc(n4,n1); acolors[a]=1; widths[a]=2;
\n+
\n+
a=g.addArc(n1,n2); acolors[a]=1; widths[a]=1;
\n+
a=g.addArc(n1,n2); acolors[a]=2; widths[a]=1;
\n+
a=g.addArc(n1,n2); acolors[a]=3; widths[a]=1;
\n+
a=g.addArc(n1,n2); acolors[a]=4; widths[a]=1;
\n+
a=g.addArc(n1,n2); acolors[a]=5; widths[a]=1;
\n+
a=g.addArc(n1,n2); acolors[a]=6; widths[a]=1;
\n+
a=g.addArc(n1,n2); acolors[a]=7; widths[a]=1;
\n+
\n+
cout << "Create 'graph_to_eps_demo_out_4_par.eps'" << endl;
\n+
graphToEps(g,"graph_to_eps_demo_out_4_par.eps").
\n+
title("Sample .eps figure (parallel arcs)").
\n+
copyright("(C) 2003-2009 LEMON Project").
\n+
absoluteNodeSizes().absoluteArcWidths().
\n+
nodeShapes(shapes).
\n+
coords(coords).
\n+
nodeScale(2).nodeSizes(sizes).
\n+
nodeColors(composeMap(palette,colors)).
\n+
arcColors(composeMap(palette,acolors)).
\n+
arcWidthScale(.4).arcWidths(widths).
\n+
nodeTexts(id).nodeTextSize(3).
\n+
enableParallel().parArcDist(1.5).
\n+
run();
\n+
\n+
cout << "Create 'graph_to_eps_demo_out_5_par_arr.eps'" << endl;
\n+
graphToEps(g,"graph_to_eps_demo_out_5_par_arr.eps").
\n+
title("Sample .eps figure (parallel arcs and arrowheads)").
\n+
copyright("(C) 2003-2009 LEMON Project").
\n+
absoluteNodeSizes().absoluteArcWidths().
\n+
nodeScale(2).nodeSizes(sizes).
\n+
coords(coords).
\n+
nodeShapes(shapes).
\n+
nodeColors(composeMap(palette,colors)).
\n+
arcColors(composeMap(palette,acolors)).
\n+
arcWidthScale(.3).arcWidths(widths).
\n+
nodeTexts(id).nodeTextSize(3).
\n+
enableParallel().parArcDist(1).
\n+
drawArrows().arrowWidth(1).arrowLength(1).
\n+
run();
\n+
\n+
cout << "Create 'graph_to_eps_demo_out_6_par_arr_a4.eps'" << endl;
\n+
graphToEps(g,"graph_to_eps_demo_out_6_par_arr_a4.eps").
\n+
title("Sample .eps figure (fits to A4)").
\n+
copyright("(C) 2003-2009 LEMON Project").
\n+
scaleToA4().
\n+
absoluteNodeSizes().absoluteArcWidths().
\n+
nodeScale(2).nodeSizes(sizes).
\n+
coords(coords).
\n+
nodeShapes(shapes).
\n+
nodeColors(composeMap(palette,colors)).
\n+
arcColors(composeMap(palette,acolors)).
\n+
arcWidthScale(.3).arcWidths(widths).
\n+
nodeTexts(id).nodeTextSize(3).
\n+
enableParallel().parArcDist(1).
\n+
drawArrows().arrowWidth(1).arrowLength(1).
\n+
run();
\n+
\n+
// Create an .eps file showing the colors of a default Palette
\n+
ListDigraph h;
\n+
ListDigraph::NodeMap<int> hcolors(h);
\n+
ListDigraph::NodeMap<Point> hcoords(h);
\n+
\n+
int cols=int(std::sqrt(double(palette.size())));
\n+
for(int i=0;i<int(paletteW.size());i++) {
\n+
Node n=h.addNode();
\n+
hcoords[n]=Point(1+i%cols,1+i/cols);
\n+
hcolors[n]=i;
\n
}
\n
\n-
std::cout << "A digraph is read from 'digraph.lgf'." << std::endl;
\n-
std::cout << "Number of nodes: " << countNodes(g) << std::endl;
\n-
std::cout << "Number of arcs: " << countArcs(g) << std::endl;
\n-
\n-
std::cout << "We can write it to the standard output:" << std::endl;
\n-
\n-
digraphWriter(g). // write g to the standard output
\n-
arcMap("capacity", cap). // write cap into 'capacity'
\n-
node("source", s). // write s to 'source'
\n-
node("target", t). // write t to 'target'
\n+
cout << "Create 'graph_to_eps_demo_out_7_colors.eps'" << endl;
\n+
graphToEps(h,"graph_to_eps_demo_out_7_colors.eps").
\n+
scale(60).
\n+
title("Sample .eps figure (Palette demo)").
\n+
copyright("(C) 2003-2009 LEMON Project").
\n+
coords(hcoords).
\n+
absoluteNodeSizes().absoluteArcWidths().
\n+
nodeScale(.45).
\n+
distantColorNodeTexts().
\n+
nodeTexts(hcolors).nodeTextSize(.6).
\n+
nodeColors(composeMap(paletteW,hcolors)).
\n
run();
\n
\n
return 0;
\n
}
\n-
lgf_writer.h
LEMON Graph Format writer.
\n-
smart_graph.h
SmartDigraph and SmartGraph classes.
\n-
lgf_reader.h
LEMON Graph Format reader.
\n-
lemon::countNodes
int countNodes(const Graph &g)
Function to count the nodes in the graph.
Definition core.h:252
\n-
lemon::countArcs
int countArcs(const Graph &g)
Function to count the arcs in the graph.
Definition core.h:356
\n+
list_graph.h
ListDigraph and ListGraph classes.
\n+
graph_to_eps.h
A well configurable tool for visualizing graphs.
\n+
math.h
Some extensions to the standard cmath library.
\n+
lemon::graphToEps
GraphToEps< DefaultGraphToEpsTraits< GR > > graphToEps(GR &g, std::ostream &os=std::cout)
Generates an EPS file from a graph.
Definition graph_to_eps.h:1136
\n
lemon
The namespace of LEMON.
Definition groups.dox:19
\n-
lemon::Exception
Generic exception class.
Definition error.h:42
\n-
lemon::Exception::what
virtual const char * what() const
A short description of the exception.
Definition error.h:49
\n-
lemon::SmartDigraph
A smart directed graph class.
Definition smart_graph.h:201
\n-
#include <iostream>
\n-#include <lemon/smart_graph.h>
\n-#include <lemon/lgf_reader.h>
\n-#include <lemon/lgf_writer.h>
\n+
lemon::Palette
Map ints to different Colors.
Definition color.h:106
\n+
lemon::Palette::size
int size() const
Returns the number of the existing colors.
Definition color.h:182
\n+
lemon::dim2::Point
Two dimensional vector (plain vector)
Definition dim2.h:45
\n+
lemon::ListDigraph
A general directed graph structure.
Definition list_graph.h:331
\n+
lemon::ListDigraph::addNode
Node addNode()
Add a new node to the digraph.
Definition list_graph.h:352
\n+
lemon::IdMap
Provides an immutable and unique id for each item in a graph.
Definition maps.h:1836
\n+
#include <lemon/list_graph.h>
\n+#include <lemon/graph_to_eps.h>
\n+#include <lemon/math.h>
\n
\n \n
\n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,50 +5,22 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * demo\n-lgf_demo.cc File Reference\n+graph_to_eps_demo.cc File Reference\n Demo_Programs\n ***** Detailed Description *****\n-This program gives an example of how to read and write a digraph and additional\n-maps from/to a stream or a file using the LGF format.\n-The \"digraph.lgf\" file:\n-@nodes\n-label\n-0\n-1\n-2\n-3\n-4\n-5\n-6\n-7\n-@arcs\n-label capacity\n-0 1 0 16\n-0 2 1 12\n-0 3 2 20\n-1 2 3 10\n-1 4 4 10\n-1 5 5 13\n-2 3 6 10\n-2 4 7 8\n-2 6 8 8\n-5 3 9 20\n-3 6 10 25\n-4 7 11 15\n-5 7 12 15\n-6 7 13 18\n-@attributes\n-source 0\n-target 7\n-And the program which reads it and prints the digraph to the standard output:\n+This demo program shows examples how to use the function graphToEps(). It takes\n+no input but simply creates seven .eps files demonstrating the capability of\n+graphToEps(), and showing how to draw directed graphs, how to handle parallel\n+egdes, how to change the properties (like color, shape, size, title etc.) of\n+nodes and arcs individually using appropriate graph maps.\n /* -*- mode: C++; indent-tabs-mode: nil; -*-\n *\n * This file is a part of LEMON, a generic C++ optimization library.\n *\n * Copyright (C) 2003-2009\n * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport\n * (Egervary Research Group on Combinatorial Optimization, EGRES).\n@@ -58,72 +30,201 @@\n * precise terms see the accompanying LICENSE file.\n *\n * This software is provided \"AS IS\" with no warranty of any kind,\n * express or implied, and with no claim as to its suitability for any\n * purpose.\n *\n */\n-#include \n-#include \n-#include \n-#include \n+#include\n+#include\n+#include\n+using namespace std;\n using namespace lemon;\n-int main() {\n-SmartDigraph g;\n-SmartDigraph::ArcMap cap(g);\n-SmartDigraph::Node s, t;\n-try {\n-digraphReader(g, \"digraph.lgf\"). // read the directed graph into g\n-arcMap(\"capacity\", cap). // read the 'capacity' arc map into cap\n-node(\"source\", s). // read 'source' node to s\n-node(\"target\", t). // read 'target' node to t\n-run();\n-} catch (Exception& error) { // check if there was any error\n-std::cerr << \"Error: \" << error.what() << std::endl;\n-return -1;\n+int main()\n+{\n+Palette palette;\n+Palette paletteW(true);\n+// Create a small digraph\n+ListDigraph g;\n+typedef ListDigraph::Node Node;\n+typedef ListDigraph::NodeIt NodeIt;\n+typedef ListDigraph::Arc Arc;\n+typedef dim2::Point Point;\n+Node n1=g.addNode();\n+Node n2=g.addNode();\n+Node n3=g.addNode();\n+Node n4=g.addNode();\n+Node n5=g.addNode();\n+ListDigraph::NodeMap coords(g);\n+ListDigraph::NodeMap sizes(g);\n+ListDigraph::NodeMap colors(g);\n+ListDigraph::NodeMap shapes(g);\n+ListDigraph::ArcMap acolors(g);\n+ListDigraph::ArcMap widths(g);\n+coords[n1]=Point(50,50); sizes[n1]=1; colors[n1]=1; shapes[n1]=0;\n+coords[n2]=Point(50,70); sizes[n2]=2; colors[n2]=2; shapes[n2]=2;\n+coords[n3]=Point(70,70); sizes[n3]=1; colors[n3]=3; shapes[n3]=0;\n+coords[n4]=Point(70,50); sizes[n4]=2; colors[n4]=4; shapes[n4]=1;\n+coords[n5]=Point(85,60); sizes[n5]=3; colors[n5]=5; shapes[n5]=2;\n+Arc a;\n+a=g.addArc(n1,n2); acolors[a]=0; widths[a]=1;\n+a=g.addArc(n2,n3); acolors[a]=0; widths[a]=1;\n+a=g.addArc(n3,n5); acolors[a]=0; widths[a]=3;\n+a=g.addArc(n5,n4); acolors[a]=0; widths[a]=1;\n+a=g.addArc(n4,n1); acolors[a]=0; widths[a]=1;\n+a=g.addArc(n2,n4); acolors[a]=1; widths[a]=2;\n+a=g.addArc(n3,n4); acolors[a]=2; widths[a]=1;\n+IdMap id(g);\n+// Create .eps files showing the digraph with different options\n+cout << \"Create 'graph_to_eps_demo_out_1_pure.eps'\" << endl;\n+graphToEps(g,\"graph_to_eps_demo_out_1_pure.eps\").\n+coords(coords).\n+title(\"Sample .eps figure\").\n+copyright(\"(C) 2003-2009 LEMON Project\").\n+run();\n+cout << \"Create 'graph_to_eps_demo_out_2.eps'\" << endl;\n+graphToEps(g,\"graph_to_eps_demo_out_2.eps\").\n+coords(coords).\n+title(\"Sample .eps figure\").\n+copyright(\"(C) 2003-2009 LEMON Project\").\n+absoluteNodeSizes().absoluteArcWidths().\n+nodeScale(2).nodeSizes(sizes).\n+nodeShapes(shapes).\n+nodeColors(composeMap(palette,colors)).\n+arcColors(composeMap(palette,acolors)).\n+arcWidthScale(.4).arcWidths(widths).\n+nodeTexts(id).nodeTextSize(3).\n+run();\n+cout << \"Create 'graph_to_eps_demo_out_3_arr.eps'\" << endl;\n+graphToEps(g,\"graph_to_eps_demo_out_3_arr.eps\").\n+title(\"Sample .eps figure (with arrowheads)\").\n+copyright(\"(C) 2003-2009 LEMON Project\").\n+absoluteNodeSizes().absoluteArcWidths().\n+nodeColors(composeMap(palette,colors)).\n+coords(coords).\n+nodeScale(2).nodeSizes(sizes).\n+nodeShapes(shapes).\n+arcColors(composeMap(palette,acolors)).\n+arcWidthScale(.4).arcWidths(widths).\n+nodeTexts(id).nodeTextSize(3).\n+drawArrows().arrowWidth(2).arrowLength(2).\n+run();\n+// Add more arcs to the digraph\n+a=g.addArc(n1,n4); acolors[a]=2; widths[a]=1;\n+a=g.addArc(n4,n1); acolors[a]=1; widths[a]=2;\n+a=g.addArc(n1,n2); acolors[a]=1; widths[a]=1;\n+a=g.addArc(n1,n2); acolors[a]=2; widths[a]=1;\n+a=g.addArc(n1,n2); acolors[a]=3; widths[a]=1;\n+a=g.addArc(n1,n2); acolors[a]=4; widths[a]=1;\n+a=g.addArc(n1,n2); acolors[a]=5; widths[a]=1;\n+a=g.addArc(n1,n2); acolors[a]=6; widths[a]=1;\n+a=g.addArc(n1,n2); acolors[a]=7; widths[a]=1;\n+cout << \"Create 'graph_to_eps_demo_out_4_par.eps'\" << endl;\n+graphToEps(g,\"graph_to_eps_demo_out_4_par.eps\").\n+title(\"Sample .eps figure (parallel arcs)\").\n+copyright(\"(C) 2003-2009 LEMON Project\").\n+absoluteNodeSizes().absoluteArcWidths().\n+nodeShapes(shapes).\n+coords(coords).\n+nodeScale(2).nodeSizes(sizes).\n+nodeColors(composeMap(palette,colors)).\n+arcColors(composeMap(palette,acolors)).\n+arcWidthScale(.4).arcWidths(widths).\n+nodeTexts(id).nodeTextSize(3).\n+enableParallel().parArcDist(1.5).\n+run();\n+cout << \"Create 'graph_to_eps_demo_out_5_par_arr.eps'\" << endl;\n+graphToEps(g,\"graph_to_eps_demo_out_5_par_arr.eps\").\n+title(\"Sample .eps figure (parallel arcs and arrowheads)\").\n+copyright(\"(C) 2003-2009 LEMON Project\").\n+absoluteNodeSizes().absoluteArcWidths().\n+nodeScale(2).nodeSizes(sizes).\n+coords(coords).\n+nodeShapes(shapes).\n+nodeColors(composeMap(palette,colors)).\n+arcColors(composeMap(palette,acolors)).\n+arcWidthScale(.3).arcWidths(widths).\n+nodeTexts(id).nodeTextSize(3).\n+enableParallel().parArcDist(1).\n+drawArrows().arrowWidth(1).arrowLength(1).\n+run();\n+cout << \"Create 'graph_to_eps_demo_out_6_par_arr_a4.eps'\" << endl;\n+graphToEps(g,\"graph_to_eps_demo_out_6_par_arr_a4.eps\").\n+title(\"Sample .eps figure (fits to A4)\").\n+copyright(\"(C) 2003-2009 LEMON Project\").\n+scaleToA4().\n+absoluteNodeSizes().absoluteArcWidths().\n+nodeScale(2).nodeSizes(sizes).\n+coords(coords).\n+nodeShapes(shapes).\n+nodeColors(composeMap(palette,colors)).\n+arcColors(composeMap(palette,acolors)).\n+arcWidthScale(.3).arcWidths(widths).\n+nodeTexts(id).nodeTextSize(3).\n+enableParallel().parArcDist(1).\n+drawArrows().arrowWidth(1).arrowLength(1).\n+run();\n+// Create an .eps file showing the colors of a default Palette\n+ListDigraph h;\n+ListDigraph::NodeMap hcolors(h);\n+ListDigraph::NodeMap hcoords(h);\n+int cols=int(std::sqrt(double(palette.size())));\n+for(int i=0;i > graphToEps(GR &g, std::ostream\n+&os=std::cout)\n+Generates an EPS file from a graph.\n+Definition graph_to_eps.h:1136\n lemon\n The namespace of LEMON.\n Definition groups.dox:19\n-lemon::Exception\n-Generic exception class.\n-Definition error.h:42\n-lemon::Exception::what\n-virtual const char * what() const\n-A short description of the exception.\n-Definition error.h:49\n-lemon::SmartDigraph\n-A smart directed graph class.\n-Definition smart_graph.h:201\n-#include \n-#include \n-#include \n-#include \n+lemon::Palette\n+Map ints to different Colors.\n+Definition color.h:106\n+lemon::Palette::size\n+int size() const\n+Returns the number of the existing colors.\n+Definition color.h:182\n+lemon::dim2::Point\n+Two dimensional vector (plain vector)\n+Definition dim2.h:45\n+lemon::ListDigraph\n+A general directed graph structure.\n+Definition list_graph.h:331\n+lemon::ListDigraph::addNode\n+Node addNode()\n+Add a new node to the digraph.\n+Definition list_graph.h:352\n+lemon::IdMap\n+Provides an immutable and unique id for each item in a graph.\n+Definition maps.h:1836\n+#include \n+#include \n+#include \n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00164.html", "source2": "./usr/share/doc/lemon/html/a00164.html", "unified_diff": "@@ -81,17 +81,17 @@\n
\n
#include <iostream>
\n #include <fstream>
\n #include <sstream>
\n #include <algorithm>
\n #include <vector>
\n #include <functional>
\n-#include <lemon/core.h>
\n-#include <lemon/maps.h>
\n-#include <lemon/concept_check.h>
\n+#include <lemon/core.h>
\n+#include <lemon/maps.h>
\n+#include <lemon/concept_check.h>
\n #include <lemon/concepts/maps.h>
\n
\n \n \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00170.html", "source2": "./usr/share/doc/lemon/html/a00170.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/cplex.cc File Reference\n+My Project: lemon/matching.h File Reference\n \n \n \n \n \n \n \n@@ -70,24 +70,47 @@\n
\n \n
\n \n
\n
\n+Classes |\n Namespaces
\n-
cplex.cc File Reference
\n+
matching.h File Reference
Algorithms » Matching Algorithms
\n
\n
\n-
#include <iostream>
\n-#include <vector>
\n-#include <cstring>
\n-#include <lemon/cplex.h>
\n-#include <ilcplex/cplex.h>
\n+
#include <vector>
\n+#include <queue>
\n+#include <set>
\n+#include <limits>
\n+#include <lemon/core.h>
\n+#include <lemon/unionfind.h>
\n+#include <lemon/bin_heap.h>
\n+#include <lemon/maps.h>
\n+#include <lemon/fractional_matching.h>
\n

\n Classes

class  DigraphWriter< DGR >
 LGF writer for directed graphs More...
 
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+

\n+Classes

class  MaxMatching< GR >
 Maximum cardinality matching in general graphs. More...
 
class  MaxWeightedMatching< GR, WM >
 Weighted matching in general graphs. More...
 
class  MaxWeightedMatching< GR, WM >::BlossomIt
 Iterator for obtaining the nodes of a blossom. More...
 
class  MaxWeightedPerfectMatching< GR, WM >
 Weighted perfect matching in general graphs. More...
 
class  MaxWeightedPerfectMatching< GR, WM >::BlossomIt
 Iterator for obtaining the nodes of a blossom. More...
 
\n \n \n \n \n

\n Namespaces

namespace  lemon
 The namespace of LEMON.
 
\n
\n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,21 +5,42 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Namespaces\n-cplex.cc File Reference\n-#include \n+Classes | Namespaces\n+matching.h File Reference\n+Algorithms \u00bb Matching_Algorithms\n #include \n-#include \n-#include \n-#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+ Classes\n+class \u00a0MaxMatching<_GR_>\n+\u00a0 Maximum cardinality matching in general graphs. More...\n+\u00a0\n+class \u00a0MaxWeightedMatching<_GR,_WM_>\n+\u00a0 Weighted matching in general graphs. More...\n+\u00a0\n+class \u00a0MaxWeightedMatching<_GR,_WM_>::BlossomIt\n+\u00a0 Iterator for obtaining the nodes of a blossom. More...\n+\u00a0\n+class \u00a0MaxWeightedPerfectMatching<_GR,_WM_>\n+\u00a0 Weighted perfect matching in general graphs. More...\n+\u00a0\n+class \u00a0MaxWeightedPerfectMatching<_GR,_WM_>::BlossomIt\n+\u00a0 Iterator for obtaining the nodes of a blossom. More...\n+\u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00173.html", "source2": "./usr/share/doc/lemon/html/a00173.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/color.cc File Reference\n+My Project: lemon/concept_check.h File Reference\n \n \n \n \n \n \n \n@@ -71,88 +71,37 @@\n \n
\n \n
\n
\n Namespaces |\n-Variables
\n-
color.cc File Reference
\n+Functions
\n+
concept_check.h File Reference
\n \n
\n-
#include <lemon/color.h>
\n-
\n+
\n \n \n \n \n

\n Namespaces

namespace  lemon
 The namespace of LEMON.
 
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n

\n-Variables

\n-const Color WHITE (1, 1, 1)
 White color constant.
 
\n-const Color BLACK (0, 0, 0)
 Black color constant.
 
\n-const Color RED (1, 0, 0)
 Red color constant.
 
\n-const Color GREEN (0, 1, 0)
 Green color constant.
 
\n-const Color BLUE (0, 0, 1)
 Blue color constant.
 
\n-const Color YELLOW (1, 1, 0)
 Yellow color constant.
 
\n-const Color MAGENTA (1, 0, 1)
 Magenta color constant.
 
\n-const Color CYAN (0, 1, 1)
 Cyan color constant.
 
\n-const Color GREY (0, 0, 0)
 Grey color constant.
 
\n-const Color DARK_RED (.5, 0, 0)
 Dark red color constant.
 
\n-const Color DARK_GREEN (0,.5, 0)
 Dark green color constant.
 
\n-const Color DARK_BLUE (0, 0,.5)
 Drak blue color constant.
 
\n-const Color DARK_YELLOW (.5,.5, 0)
 Dark yellow color constant.
 
\n-const Color DARK_MAGENTA (.5, 0,.5)
 Dark magenta color constant.
 
\n-const Color DARK_CYAN (0,.5,.5)
 Dark cyan color constant.
 

\n+Functions

\n+template<class Concept >
void function_requires ()
 
 
\n+template<typename Concept , typename Type >
void checkConcept ()
 
 
\n
\n \n
\n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
\n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,64 +5,26 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Namespaces | Variables\n-color.cc File Reference\n-#include \n+Namespaces | Functions\n+concept_check.h File Reference\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n- Variables\n-const Color\u00a0WHITE (1, 1, 1)\n-\u00a0 White color constant.\n+ Functions\n+ template\n+void\u00a0function_requires ()\n \u00a0\n-const Color\u00a0BLACK (0, 0, 0)\n-\u00a0 Black color constant.\n \u00a0\n-const Color\u00a0RED (1, 0, 0)\n-\u00a0 Red color constant.\n+ template\n+void\u00a0checkConcept ()\n \u00a0\n-const Color\u00a0GREEN (0, 1, 0)\n-\u00a0 Green color constant.\n-\u00a0\n-const Color\u00a0BLUE (0, 0, 1)\n-\u00a0 Blue color constant.\n-\u00a0\n-const Color\u00a0YELLOW (1, 1, 0)\n-\u00a0 Yellow color constant.\n-\u00a0\n-const Color\u00a0MAGENTA (1, 0, 1)\n-\u00a0 Magenta color constant.\n-\u00a0\n-const Color\u00a0CYAN (0, 1, 1)\n-\u00a0 Cyan color constant.\n-\u00a0\n-const Color\u00a0GREY (0, 0, 0)\n-\u00a0 Grey color constant.\n-\u00a0\n-const Color\u00a0DARK_RED (.5, 0, 0)\n-\u00a0 Dark red color constant.\n-\u00a0\n-const Color\u00a0DARK_GREEN (0,.5, 0)\n-\u00a0 Dark green color constant.\n-\u00a0\n-const Color\u00a0DARK_BLUE (0, 0,.5)\n-\u00a0 Drak blue color constant.\n-\u00a0\n-const Color\u00a0DARK_YELLOW (.5,.5, 0)\n-\u00a0 Dark yellow color constant.\n-\u00a0\n-const Color\u00a0DARK_MAGENTA (.5, 0,.5)\n-\u00a0 Dark magenta color constant.\n-\u00a0\n-const Color\u00a0DARK_CYAN (0,.5,.5)\n-\u00a0 Dark cyan color constant.\n \u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00176.html", "source2": "./usr/share/doc/lemon/html/a00176.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/kruskal.h File Reference\n+My Project: lemon/euler.h File Reference\n \n \n \n \n \n \n \n@@ -70,38 +70,48 @@\n
\n \n
\n \n
\n
\n+Classes |\n Namespaces |\n Functions
\n-
kruskal.h File Reference
Algorithms » Minimum Spanning Tree Algorithms
\n+
euler.h File Reference
Algorithms » Connectivity and Other Graph Properties
\n
\n
\n-
#include <algorithm>
\n-#include <vector>
\n-#include <lemon/unionfind.h>
\n-#include <lemon/maps.h>
\n-#include <lemon/core.h>
\n-#include <lemon/bits/traits.h>
\n+

Detailed Description

\n+

This file provides Euler tour iterators and a function to check if a (di)graph is Eulerian.

\n+
#include <lemon/core.h>
\n+#include <lemon/adaptors.h>
\n+#include <lemon/connectivity.h>
\n+#include <list>
\n
\n+\n+\n+\n+\n+\n+\n+\n+

\n+Classes

class  DiEulerIt< GR >
 Euler tour iterator for digraphs. More...
 
class  EulerIt< GR >
 Euler tour iterator for graphs. More...
 
\n \n \n \n \n

\n Namespaces

namespace  lemon
 The namespace of LEMON.
 
\n \n-\n-\n-\n-\n+\n+\n+\n+\n

\n Functions

template<typename Graph , typename In , typename Out >
Value kruskal (const Graph &g, const In &in, Out &out)
 Kruskal's algorithm for finding a minimum cost spanning tree of a graph.
 
template<typename GR >
bool eulerian (const GR &g)
 Check if the given graph is Eulerian.
 
\n
\n \n
\n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
\n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,30 +5,37 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Namespaces | Functions\n-kruskal.h File Reference\n-Algorithms \u00bb Minimum_Spanning_Tree_Algorithms\n-#include \n-#include \n-#include \n-#include \n+Classes | Namespaces | Functions\n+euler.h File Reference\n+Algorithms \u00bb Connectivity_and_Other_Graph_Properties\n+***** Detailed Description *****\n+This file provides Euler tour iterators and a function to check if a (di)graph\n+is Eulerian.\n #include \n-#include \n+#include \n+#include \n+#include \n+ Classes\n+class \u00a0DiEulerIt<_GR_>\n+\u00a0 Euler tour iterator for digraphs. More...\n+\u00a0\n+class \u00a0EulerIt<_GR_>\n+\u00a0 Euler tour iterator for graphs. More...\n+\u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n Functions\n-template\n-Value\u00a0kruskal (const Graph &g, const In &in, Out &out)\n-\u00a0 Kruskal's algorithm for finding a minimum cost spanning tree of a graph.\n-\n+template\n+bool\u00a0eulerian (const GR &g)\n+\u00a0 Check if the given graph is Eulerian.\n \u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00179.html", "source2": "./usr/share/doc/lemon/html/a00179.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/clp.h File Reference\n+My Project: lemon/max_cardinality_search.h File Reference\n \n \n \n \n \n \n \n@@ -72,25 +72,45 @@\n
  • lemon
    • \n
    \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    clp.h File Reference
    \n+
    max_cardinality_search.h File Reference
    Algorithms » Graph Search
    \n
    \n
    \n-
    #include <vector>
    \n-#include <string>
    \n-#include <lemon/lp_base.h>
    \n+
    #include <lemon/bin_heap.h>
    \n+#include <lemon/bucket_heap.h>
    \n+#include <lemon/error.h>
    \n+#include <lemon/maps.h>
    \n+#include <functional>
    \n
    \n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  ClpLp
     Interface for the CLP solver. More...
    struct  MaxCardinalitySearchDefaultTraits< GR, CAP >
     Default traits class of MaxCardinalitySearch class. More...
     
    class  MaxCardinalitySearch< GR, CAP, TR >
     Maximum Cardinality Search algorithm class. More...
     
    struct  MaxCardinalitySearch< GR, CAP, TR >::SetCapacityMap< T >
     Named parameter for setting CapacityMap type More...
     
    struct  MaxCardinalitySearch< GR, CAP, TR >::SetCardinalityMap< T >
     Named parameter for setting CardinalityMap type More...
     
    struct  MaxCardinalitySearch< GR, CAP, TR >::SetProcessedMap< T >
     Named parameter for setting ProcessedMap type More...
     
    struct  MaxCardinalitySearch< GR, CAP, TR >::SetHeap< H, CR >
     Named parameter for setting heap and cross reference type More...
     
    struct  MaxCardinalitySearch< GR, CAP, TR >::SetStandardHeap< H, CR >
     Named parameter for setting heap and cross reference type with automatic allocation More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,21 +6,43 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-clp.h File Reference\n-#include \n-#include \n-#include \n+max_cardinality_search.h File Reference\n+Algorithms \u00bb Graph_Search\n+#include \n+#include \n+#include \n+#include \n+#include \n Classes\n-class \u00a0ClpLp\n-\u00a0 Interface for the CLP solver. More...\n+struct \u00a0MaxCardinalitySearchDefaultTraits<_GR,_CAP_>\n+\u00a0 Default traits class of MaxCardinalitySearch class. More...\n+\u00a0\n+ class \u00a0MaxCardinalitySearch<_GR,_CAP,_TR_>\n+\u00a0 Maximum Cardinality Search algorithm class. More...\n+\u00a0\n+struct \u00a0MaxCardinalitySearch<_GR,_CAP,_TR_>::SetCapacityMap<_T_>\n+\u00a0 Named_parameter for setting CapacityMap type More...\n+\u00a0\n+struct \u00a0MaxCardinalitySearch<_GR,_CAP,_TR_>::SetCardinalityMap<_T_>\n+\u00a0 Named_parameter for setting CardinalityMap type More...\n+\u00a0\n+struct \u00a0MaxCardinalitySearch<_GR,_CAP,_TR_>::SetProcessedMap<_T_>\n+\u00a0 Named_parameter for setting ProcessedMap type More...\n+\u00a0\n+struct \u00a0MaxCardinalitySearch<_GR,_CAP,_TR_>::SetHeap<_H,_CR_>\n+\u00a0 Named_parameter for setting heap and cross reference type More...\n+\u00a0\n+struct \u00a0MaxCardinalitySearch<_GR,_CAP,_TR_>::SetStandardHeap<_H,_CR_>\n+\u00a0 Named_parameter for setting heap and cross reference type with\n+ automatic allocation More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00182.html", "source2": "./usr/share/doc/lemon/html/a00182.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/hypercube_graph.h File Reference\n+My Project: lemon/circulation.h File Reference\n \n \n \n \n \n \n \n@@ -72,29 +72,37 @@\n
  • lemon
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    hypercube_graph.h File Reference
    Data Structures » Graph Structures
    \n+
    circulation.h File Reference
    Algorithms » Maximum Flow Algorithms
    \n
    \n
    \n-
    #include <vector>
    \n-#include <lemon/core.h>
    \n-#include <lemon/assert.h>
    \n-#include <lemon/bits/graph_extender.h>
    \n+
    #include <lemon/tolerance.h>
    \n+#include <lemon/elevator.h>
    \n+#include <limits>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  HypercubeGraph
     Hypercube graph class. More...
    struct  CirculationDefaultTraits< GR, LM, UM, SM >
     Default traits class of Circulation class. More...
     
    class  HypercubeGraph::HyperMap< T, BF >
     Linear combination map. More...
    class  Circulation< GR, LM, UM, SM, TR >
     Push-relabel algorithm for the network circulation problem. More...
     
    struct  Circulation< GR, LM, UM, SM, TR >::SetFlowMap< T >
     Named parameter for setting FlowMap type More...
     
    struct  Circulation< GR, LM, UM, SM, TR >::SetElevator< T >
     Named parameter for setting Elevator type More...
     
    struct  Circulation< GR, LM, UM, SM, TR >::SetStandardElevator< T >
     Named parameter for setting Elevator type with automatic allocation More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,26 +6,35 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-hypercube_graph.h File Reference\n-Data_Structures \u00bb Graph_Structures\n-#include \n-#include \n-#include \n-#include \n+circulation.h File Reference\n+Algorithms \u00bb Maximum_Flow_Algorithms\n+#include \n+#include \n+#include \n Classes\n-class \u00a0HypercubeGraph\n-\u00a0 Hypercube graph class. More...\n+struct \u00a0CirculationDefaultTraits<_GR,_LM,_UM,_SM_>\n+\u00a0 Default traits class of Circulation class. More...\n \u00a0\n-class \u00a0HypercubeGraph::HyperMap<_T,_BF_>\n-\u00a0 Linear combination map. More...\n+ class \u00a0Circulation<_GR,_LM,_UM,_SM,_TR_>\n+\u00a0 Push-relabel algorithm for the network circulation problem. More...\n+\u00a0\n+struct \u00a0Circulation<_GR,_LM,_UM,_SM,_TR_>::SetFlowMap<_T_>\n+\u00a0 Named_parameter for setting FlowMap type More...\n+\u00a0\n+struct \u00a0Circulation<_GR,_LM,_UM,_SM,_TR_>::SetElevator<_T_>\n+\u00a0 Named_parameter for setting Elevator type More...\n+\u00a0\n+struct \u00a0Circulation<_GR,_LM,_UM,_SM,_TR_>::SetStandardElevator<_T_>\n+\u00a0 Named_parameter for setting Elevator type with automatic allocation\n+ More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00185.html", "source2": "./usr/share/doc/lemon/html/a00185.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/planarity.h File Reference\n+My Project: lemon/random.cc File Reference\n \n \n \n \n \n \n \n@@ -70,57 +70,32 @@\n
    \n \n
    \n \n
    \n
    \n-Classes |\n Namespaces |\n-Functions
    \n-
    planarity.h File Reference
    Algorithms » Planar Embedding and Drawing
    \n+Variables
    \n+
    random.cc File Reference
    \n \n
    \n-
    #include <vector>
    \n-#include <list>
    \n-#include <lemon/dfs.h>
    \n-#include <lemon/bfs.h>
    \n-#include <lemon/radix_sort.h>
    \n-#include <lemon/maps.h>
    \n-#include <lemon/path.h>
    \n-#include <lemon/bucket_heap.h>
    \n-#include <lemon/adaptors.h>
    \n-#include <lemon/edge_set.h>
    \n-#include <lemon/color.h>
    \n-#include <lemon/dim2.h>
    \n+
    #include <lemon/random.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-

    \n-Classes

    class  PlanarEmbedding< Graph >
     Planar embedding of an undirected simple graph. More...
     
    class  PlanarDrawing< Graph >
     Schnyder's planar drawing algorithm. More...
     
    class  PlanarColoring< Graph >
     Coloring planar graphs. More...
     
    \n \n \n \n \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n+\n+\n+\n+\n

    \n-Functions

    template<typename GR >
    bool checkPlanarity (const GR &graph)
     Planarity checking of an undirected simple graph.
     

    \n+Variables

    Random rnd
     Global random number generator instance.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,45 +5,22 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces | Functions\n-planarity.h File Reference\n-Algorithms \u00bb Planar_Embedding_and_Drawing\n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n- Classes\n-class \u00a0PlanarEmbedding<_Graph_>\n-\u00a0 Planar embedding of an undirected simple graph. More...\n-\u00a0\n-class \u00a0PlanarDrawing<_Graph_>\n-\u00a0 Schnyder's planar drawing algorithm. More...\n-\u00a0\n-class \u00a0PlanarColoring<_Graph_>\n-\u00a0 Coloring planar graphs. More...\n-\u00a0\n+Namespaces | Variables\n+random.cc File Reference\n+#include \n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n- Functions\n-template\n-bool\u00a0checkPlanarity (const GR &graph)\n-\u00a0 Planarity checking of an undirected simple graph.\n+ Variables\n+Random\u00a0rnd\n+\u00a0 Global random number generator instance.\n \u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00188.html", "source2": "./usr/share/doc/lemon/html/a00188.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/nearest_neighbor_tsp.h File Reference\n+My Project: lemon/lp.h File Reference\n \n \n \n \n \n \n \n@@ -70,36 +70,45 @@\n
    \n \n
    \n
    \n
    \n
    \n-Classes |\n-Namespaces
    \n-
    nearest_neighbor_tsp.h File Reference
    Algorithms » Traveling Salesman Problem
    \n+Namespaces |\n+Macros |\n+Typedefs
    \n+
    lp.h File Reference
    General Optimization Tools » LP and MIP Solvers
    \n \n
    \n-
    #include <deque>
    \n-#include <vector>
    \n-#include <limits>
    \n-#include <lemon/full_graph.h>
    \n-#include <lemon/maps.h>
    \n+
    #include <lemon/config.h>
    \n
    \n-\n-\n-\n-\n-

    \n-Classes

    class  NearestNeighborTsp< CM >
     Nearest neighbor algorithm for symmetric TSP. More...
     
    \n \n \n \n \n+

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n+\n+\n+\n+\n+\n+\n+\n+

    \n+Macros

    #define LEMON_DEFAULT_LP   SOLVER
     The default LP solver identifier.
     
    #define LEMON_DEFAULT_MIP   SOLVER
     The default MIP solver identifier.
     
    \n+\n+\n+\n+\n+\n+\n+\n

    \n+Typedefs

    typedef GlpkLp Lp
     The default LP solver.
     
    typedef GlpkMip Mip
     The default MIP solver.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,27 +5,33 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces\n-nearest_neighbor_tsp.h File Reference\n-Algorithms \u00bb Traveling_Salesman_Problem\n-#include \n-#include \n-#include \n-#include \n-#include \n- Classes\n-class \u00a0NearestNeighborTsp<_CM_>\n-\u00a0 Nearest neighbor algorithm for symmetric TSP. More...\n-\u00a0\n+Namespaces | Macros | Typedefs\n+lp.h File Reference\n+General_Optimization_Tools \u00bb LP_and_MIP_Solvers\n+#include \n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n+ Macros\n+#define\u00a0LEMON_DEFAULT_LP\u00a0\u00a0\u00a0SOLVER\n+\u00a0 The default LP solver identifier.\n+\u00a0\n+#define\u00a0LEMON_DEFAULT_MIP\u00a0\u00a0\u00a0SOLVER\n+\u00a0 The default MIP solver identifier.\n+\u00a0\n+ Typedefs\n+ typedef GlpkLp\u00a0Lp\n+\u00a0 The default LP solver.\n+\u00a0\n+typedef GlpkMip\u00a0Mip\n+\u00a0 The default MIP solver.\n+\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00191.html", "source2": "./usr/share/doc/lemon/html/a00191.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/edge_set.h File Reference\n+My Project: lemon/smart_graph.h File Reference\n \n \n \n \n \n \n \n@@ -72,35 +72,41 @@\n
  • lemon
    • \n
    \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    edge_set.h File Reference
    Data Structures » Graph Structures
    \n+
    smart_graph.h File Reference
    Data Structures » Graph Structures
    \n
    \n
    \n-

    Detailed Description

    \n-

    Graphs which use another graph's node-set as own.

    \n-
    #include <lemon/core.h>
    \n-#include <lemon/bits/edge_set_extender.h>
    \n+
    #include <vector>
    \n+#include <lemon/core.h>
    \n+#include <lemon/error.h>
    \n+#include <lemon/bits/graph_extender.h>
    \n
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  ListArcSet< GR >
     Digraph using a node set of another digraph or graph and an own arc set. More...
    class  SmartDigraph
     A smart directed graph class. More...
     
    class  ListEdgeSet< GR >
     Graph using a node set of another digraph or graph and an own edge set. More...
    class  SmartDigraph::Snapshot
     Class to make a snapshot of the digraph and to restore it later. More...
     
    class  SmartArcSet< GR >
     Digraph using a node set of another digraph or graph and an own arc set. More...
    class  SmartGraph
     A smart undirected graph class. More...
     
    class  SmartEdgeSet< GR >
     Graph using a node set of another digraph or graph and an own edge set. More...
    class  SmartGraph::Snapshot
     Class to make a snapshot of the graph and to restore it later. More...
     
    class  SmartBpGraph
     A smart undirected bipartite graph class. More...
     
    class  SmartBpGraph::Snapshot
     Class to make a snapshot of the graph and to restore it later. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,36 +6,39 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-edge_set.h File Reference\n+smart_graph.h File Reference\n Data_Structures \u00bb Graph_Structures\n-***** Detailed Description *****\n-Graphs which use another graph's node-set as own.\n+#include \n #include \n-#include \n+#include \n+#include \n Classes\n-class \u00a0ListArcSet<_GR_>\n-\u00a0 Digraph using a node set of another digraph or graph and an own arc\n- set. More...\n+class \u00a0SmartDigraph\n+\u00a0 A smart directed graph class. More...\n \u00a0\n-class \u00a0ListEdgeSet<_GR_>\n-\u00a0 Graph using a node set of another digraph or graph and an own edge set.\n+class \u00a0SmartDigraph::Snapshot\n+\u00a0 Class to make a snapshot of the digraph and to restore it later.\n More...\n \u00a0\n-class \u00a0SmartArcSet<_GR_>\n-\u00a0 Digraph using a node set of another digraph or graph and an own arc\n- set. More...\n+class \u00a0SmartGraph\n+\u00a0 A smart undirected graph class. More...\n \u00a0\n-class \u00a0SmartEdgeSet<_GR_>\n-\u00a0 Graph using a node set of another digraph or graph and an own edge set.\n- More...\n+class \u00a0SmartGraph::Snapshot\n+\u00a0 Class to make a snapshot of the graph and to restore it later. More...\n+\u00a0\n+class \u00a0SmartBpGraph\n+\u00a0 A smart undirected bipartite graph class. More...\n+\u00a0\n+class \u00a0SmartBpGraph::Snapshot\n+\u00a0 Class to make a snapshot of the graph and to restore it later. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00194.html", "source2": "./usr/share/doc/lemon/html/a00194.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/assert.h File Reference\n+My Project: lemon/unionfind.h File Reference\n \n \n \n \n \n \n \n@@ -70,35 +70,64 @@\n
    \n \n
    \n \n
    \n
    \n-Namespaces |\n-Macros
    \n-
    assert.h File Reference
    Tools and Utilities » Exceptions
    \n+Classes |\n+Namespaces
    \n+
    unionfind.h File Reference
    Data Structures » Auxiliary Data Structures
    \n \n
    \n-
    #include <lemon/error.h>
    \n+
    #include <vector>
    \n+#include <list>
    \n+#include <utility>
    \n+#include <algorithm>
    \n+#include <functional>
    \n+#include <lemon/core.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+

    \n+Classes

    class  UnionFind< IM >
     A Union-Find data structure implementation. More...
     
    class  UnionFindEnum< IM >
     A Union-Find data structure implementation which is able to enumerate the components. More...
     
    class  UnionFindEnum< IM >::ClassIt
     LEMON style iterator for the representant items. More...
     
    class  UnionFindEnum< IM >::ItemIt
     LEMON style iterator for the items of a component. More...
     
    class  ExtendFindEnum< IM >
     A Extend-Find data structure implementation which is able to enumerate the components. More...
     
    class  ExtendFindEnum< IM >::ClassIt
     LEMON style iterator for the classes. More...
     
    class  ExtendFindEnum< IM >::ItemIt
     LEMON style iterator for the items of a component. More...
     
    class  HeapUnionFind< V, IM, Comp >
     A Union-Find data structure implementation which is able to store a priority for each item and retrieve the minimum of each class. More...
     
    class  HeapUnionFind< V, IM, Comp >::ItemIt
     LEMON style iterator for the items of a class. More...
     
    class  HeapUnionFind< V, IM, Comp >::ClassIt
     Class iterator. More...
     
    \n \n \n \n \n-

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n-\n-\n

    \n-Macros

    #define LEMON_ASSERT(exp, msg)
     Macro for assertion with customizable message.
     
    #define LEMON_DEBUG(exp, msg)
     Macro for internal assertions.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,26 +5,58 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Namespaces | Macros\n-assert.h File Reference\n-Tools_and_Utilities \u00bb Exceptions\n-#include \n+Classes | Namespaces\n+unionfind.h File Reference\n+Data_Structures \u00bb Auxiliary_Data_Structures\n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+ Classes\n+class \u00a0UnionFind<_IM_>\n+\u00a0 A Union-Find data structure implementation. More...\n+\u00a0\n+class \u00a0UnionFindEnum<_IM_>\n+\u00a0 A Union-Find data structure implementation which is able to enumerate\n+ the components. More...\n+\u00a0\n+class \u00a0UnionFindEnum<_IM_>::ClassIt\n+\u00a0 LEMON style iterator for the representant items. More...\n+\u00a0\n+class \u00a0UnionFindEnum<_IM_>::ItemIt\n+\u00a0 LEMON style iterator for the items of a component. More...\n+\u00a0\n+class \u00a0ExtendFindEnum<_IM_>\n+\u00a0 A Extend-Find data structure implementation which is able to enumerate\n+ the components. More...\n+\u00a0\n+class \u00a0ExtendFindEnum<_IM_>::ClassIt\n+\u00a0 LEMON style iterator for the classes. More...\n+\u00a0\n+class \u00a0ExtendFindEnum<_IM_>::ItemIt\n+\u00a0 LEMON style iterator for the items of a component. More...\n+\u00a0\n+class \u00a0HeapUnionFind<_V,_IM,_Comp_>\n+\u00a0 A Union-Find data structure implementation which is able to store a\n+ priority for each item and retrieve the minimum of each class. More...\n+\u00a0\n+class \u00a0HeapUnionFind<_V,_IM,_Comp_>::ItemIt\n+\u00a0 LEMON style iterator for the items of a class. More...\n+\u00a0\n+class \u00a0HeapUnionFind<_V,_IM,_Comp_>::ClassIt\n+\u00a0 Class iterator. More...\n+\u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n- Macros\n-#define\u00a0LEMON_ASSERT(exp, msg)\n-\u00a0 Macro for assertion with customizable message.\n-\u00a0\n-#define\u00a0LEMON_DEBUG(exp, msg)\n-\u00a0 Macro for internal assertions.\n-\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00197.html", "source2": "./usr/share/doc/lemon/html/a00197.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/smart_graph.h File Reference\n+My Project: lemon/dimacs.h File Reference\n \n \n \n \n \n \n \n@@ -71,49 +71,66 @@\n \n
    \n \n
    \n
    \n Classes |\n-Namespaces
    \n-
    smart_graph.h File Reference
    Data Structures » Graph Structures
    \n+Namespaces |\n+Functions
    \n+
    dimacs.h File Reference
    Input-Output » DIMACS Format
    \n \n
    \n-
    #include <vector>
    \n-#include <lemon/core.h>
    \n-#include <lemon/error.h>
    \n-#include <lemon/bits/graph_extender.h>
    \n+
    #include <iostream>
    \n+#include <string>
    \n+#include <vector>
    \n+#include <limits>
    \n+#include <lemon/maps.h>
    \n+#include <lemon/error.h>
    \n
    \n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    class  SmartDigraph
     A smart directed graph class. More...
     
    class  SmartDigraph::Snapshot
     Class to make a snapshot of the digraph and to restore it later. More...
     
    class  SmartGraph
     A smart undirected graph class. More...
     
    class  SmartGraph::Snapshot
     Class to make a snapshot of the graph and to restore it later. More...
     
    class  SmartBpGraph
     A smart undirected bipartite graph class. More...
     
    class  SmartBpGraph::Snapshot
     Class to make a snapshot of the graph and to restore it later. More...
    struct  DimacsDescriptor
     DIMACS file type descriptor. More...
     
    \n \n \n \n \n+

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n

    \n+Functions

    DimacsDescriptor dimacsType (std::istream &is)
     Discover the type of a DIMACS file.
     
    template<typename Digraph , typename LowerMap , typename CapacityMap , typename CostMap , typename SupplyMap >
    void readDimacsMin (std::istream &is, Digraph &g, LowerMap &lower, CapacityMap &capacity, CostMap &cost, SupplyMap &supply, typename CapacityMap::Value infty=0, DimacsDescriptor desc=DimacsDescriptor())
     DIMACS minimum cost flow reader function.
     
    template<typename Digraph , typename CapacityMap >
    void readDimacsMax (std::istream &is, Digraph &g, CapacityMap &capacity, typename Digraph::Node &s, typename Digraph::Node &t, typename CapacityMap::Value infty=0, DimacsDescriptor desc=DimacsDescriptor())
     DIMACS maximum flow reader function.
     
    template<typename Digraph , typename LengthMap >
    void readDimacsSp (std::istream &is, Digraph &g, LengthMap &length, typename Digraph::Node &s, DimacsDescriptor desc=DimacsDescriptor())
     DIMACS shortest path reader function.
     
    template<typename Digraph , typename CapacityMap >
    void readDimacsCap (std::istream &is, Digraph &g, CapacityMap &capacity, typename CapacityMap::Value infty=0, DimacsDescriptor desc=DimacsDescriptor())
     DIMACS capacitated digraph reader function.
     
    template<typename Graph >
    void readDimacsMat (std::istream &is, Graph &g, DimacsDescriptor desc=DimacsDescriptor())
     DIMACS plain (di)graph reader function.
     
    template<typename Digraph >
    void writeDimacsMat (std::ostream &os, const Digraph &g, std::string comment="")
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,42 +5,68 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces\n-smart_graph.h File Reference\n-Data_Structures \u00bb Graph_Structures\n+Classes | Namespaces | Functions\n+dimacs.h File Reference\n+Input-Output \u00bb DIMACS_Format\n+#include \n+#include \n #include \n-#include \n+#include \n+#include \n #include \n-#include \n Classes\n-class \u00a0SmartDigraph\n-\u00a0 A smart directed graph class. More...\n-\u00a0\n-class \u00a0SmartDigraph::Snapshot\n-\u00a0 Class to make a snapshot of the digraph and to restore it later.\n- More...\n-\u00a0\n-class \u00a0SmartGraph\n-\u00a0 A smart undirected graph class. More...\n-\u00a0\n-class \u00a0SmartGraph::Snapshot\n-\u00a0 Class to make a snapshot of the graph and to restore it later. More...\n-\u00a0\n-class \u00a0SmartBpGraph\n-\u00a0 A smart undirected bipartite graph class. More...\n-\u00a0\n-class \u00a0SmartBpGraph::Snapshot\n-\u00a0 Class to make a snapshot of the graph and to restore it later. More...\n+struct \u00a0DimacsDescriptor\n+\u00a0 DIMACS file type descriptor. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n+ Functions\n+DimacsDescriptor\u00a0dimacsType (std::istream &is)\n+\u00a0 Discover the type of a DIMACS file.\n+\u00a0\n+template\n+ void\u00a0readDimacsMin (std::istream &is, Digraph &g, LowerMap &lower,\n+ CapacityMap &capacity, CostMap &cost, SupplyMap &supply,\n+ typename CapacityMap::Value infty=0, DimacsDescriptor\n+ desc=DimacsDescriptor())\n+\u00a0 DIMACS minimum cost flow reader function.\n+\u00a0\n+template\n+ void\u00a0readDimacsMax (std::istream &is, Digraph &g, CapacityMap\n+ &capacity, typename Digraph::Node &s, typename Digraph::Node\n+ &t, typename CapacityMap::Value infty=0, DimacsDescriptor\n+ desc=DimacsDescriptor())\n+\u00a0 DIMACS maximum flow reader function.\n+\u00a0\n+template\n+ void\u00a0readDimacsSp (std::istream &is, Digraph &g, LengthMap\n+ &length, typename Digraph::Node &s, DimacsDescriptor\n+ desc=DimacsDescriptor())\n+\u00a0 DIMACS shortest path reader function.\n+\u00a0\n+template\n+ void\u00a0readDimacsCap (std::istream &is, Digraph &g, CapacityMap\n+ &capacity, typename CapacityMap::Value infty=0,\n+ DimacsDescriptor desc=DimacsDescriptor())\n+\u00a0 DIMACS capacitated digraph reader function.\n+\u00a0\n+template\n+ void\u00a0readDimacsMat (std::istream &is, Graph &g, DimacsDescriptor\n+ desc=DimacsDescriptor())\n+\u00a0 DIMACS plain (di)graph reader function.\n+\u00a0\n+template\n+ void\u00a0writeDimacsMat (std::ostream &os, const Digraph &g, std::\n+ string comment=\"\")\n+\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00200.html", "source2": "./usr/share/doc/lemon/html/a00200.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/min_cost_arborescence.h File Reference\n+My Project: lemon/tolerance.h File Reference\n \n \n \n \n \n \n \n@@ -71,54 +71,39 @@\n \n
    \n \n
    \n
    \n Classes |\n-Namespaces |\n-Functions
    \n-
    min_cost_arborescence.h File Reference
    Algorithms » Minimum Spanning Tree Algorithms
    \n+Namespaces
    \n+
    tolerance.h File Reference
    Tools and Utilities » Miscellaneous Tools
    \n \n
    \n-
    #include <vector>
    \n-#include <lemon/list_graph.h>
    \n-#include <lemon/bin_heap.h>
    \n-#include <lemon/assert.h>
    \n-
    \n+
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    struct  MinCostArborescenceDefaultTraits< GR, CM >
     Default traits class for MinCostArborescence class. More...
    class  Tolerance< T >
     A class to provide a basic way to handle the comparison of numbers that are obtained as a result of a probably inexact computation. More...
     
    class  MinCostArborescence< GR, CM, TR >
     Minimum Cost Arborescence algorithm class. More...
    class  Tolerance< float >
     Float specialization of Tolerance. More...
     
    struct  MinCostArborescence< GR, CM, TR >::SetArborescenceMap< T >
     Named parameter for setting ArborescenceMap type More...
    class  Tolerance< double >
     Double specialization of Tolerance. More...
     
    struct  MinCostArborescence< GR, CM, TR >::SetPredMap< T >
     Named parameter for setting PredMap type More...
     
    class  MinCostArborescence< GR, CM, TR >::DualIt
     LEMON iterator for getting a dual variable. More...
    class  Tolerance< long double >
     Long double specialization of Tolerance. More...
     
    \n \n \n \n \n-

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n

    \n-Functions

    template<typename Digraph , typename CostMap , typename ArborescenceMap >
    CostMap::Value minCostArborescence (const Digraph &digraph, const CostMap &cost, typename Digraph::Node source, ArborescenceMap &arborescence)
     Function type interface for MinCostArborescence algorithm.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,45 +5,32 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces | Functions\n-min_cost_arborescence.h File Reference\n-Algorithms \u00bb Minimum_Spanning_Tree_Algorithms\n-#include \n-#include \n-#include \n-#include \n+Classes | Namespaces\n+tolerance.h File Reference\n+Tools_and_Utilities \u00bb Miscellaneous_Tools\n Classes\n-struct \u00a0MinCostArborescenceDefaultTraits<_GR,_CM_>\n-\u00a0 Default traits class for MinCostArborescence class. More...\n+class \u00a0Tolerance<_T_>\n+\u00a0 A class to provide a basic way to handle the comparison of numbers that\n+ are obtained as a result of a probably inexact computation. More...\n \u00a0\n- class \u00a0MinCostArborescence<_GR,_CM,_TR_>\n-\u00a0 Minimum Cost Arborescence algorithm class. More...\n+class \u00a0Tolerance<_float_>\n+\u00a0 Float specialization of Tolerance. More...\n \u00a0\n-struct \u00a0MinCostArborescence<_GR,_CM,_TR_>::SetArborescenceMap<_T_>\n-\u00a0 Named_parameter for setting ArborescenceMap type More...\n+class \u00a0Tolerance<_double_>\n+\u00a0 Double specialization of Tolerance. More...\n \u00a0\n-struct \u00a0MinCostArborescence<_GR,_CM,_TR_>::SetPredMap<_T_>\n-\u00a0 Named_parameter for setting PredMap type More...\n-\u00a0\n- class \u00a0MinCostArborescence<_GR,_CM,_TR_>::DualIt\n-\u00a0 LEMON iterator for getting a dual variable. More...\n+class \u00a0Tolerance<_long_double_>\n+\u00a0 Long double specialization of Tolerance. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n- Functions\n-template\n-CostMap::Value\u00a0minCostArborescence (const Digraph &digraph, const CostMap\n- &cost, typename Digraph::Node source, ArborescenceMap\n- &arborescence)\n-\u00a0 Function type interface for MinCostArborescence algorithm.\n-\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00203.html", "source2": "./usr/share/doc/lemon/html/a00203.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/quad_heap.h File Reference\n+My Project: lemon/grosso_locatelli_pullan_mc.h File Reference\n \n \n \n \n \n \n \n@@ -72,25 +72,29 @@\n
  • lemon
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    quad_heap.h File Reference
    Data Structures » Heap Structures
    \n+
    grosso_locatelli_pullan_mc.h File Reference
    Algorithms » Approximation Algorithms
    \n
    \n
    \n
    #include <vector>
    \n-#include <utility>
    \n-#include <functional>
    \n+#include <limits>
    \n+#include <lemon/core.h>
    \n+#include <lemon/random.h>
    \n
    \n \n-\n-\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  QuadHeap< PR, IM, CMP >
     Fourary (quaternary) heap data structure. More...
    class  GrossoLocatelliPullanMc< GR >
     Implementation of the iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem. More...
     
    class  GrossoLocatelliPullanMc< GR >::CliqueNodeIt
     Iterator to list the nodes of the found clique. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,22 +6,27 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-quad_heap.h File Reference\n-Data_Structures \u00bb Heap_Structures\n+grosso_locatelli_pullan_mc.h File Reference\n+Algorithms \u00bb Approximation_Algorithms\n #include \n-#include \n-#include \n+#include \n+#include \n+#include \n Classes\n-class \u00a0QuadHeap<_PR,_IM,_CMP_>\n-\u00a0 Fourary (quaternary) heap data structure. More...\n+class \u00a0GrossoLocatelliPullanMc<_GR_>\n+\u00a0 Implementation of the iterated local search algorithm of Grosso,\n+ Locatelli, and Pullan for the maximum clique problem. More...\n+\u00a0\n+class \u00a0GrossoLocatelliPullanMc<_GR_>::CliqueNodeIt\n+\u00a0 Iterator to list the nodes of the found clique. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00206.html", "source2": "./usr/share/doc/lemon/html/a00206.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/counter.h File Reference\n+My Project: lemon/list_graph.h File Reference\n \n \n \n \n \n \n \n@@ -72,27 +72,42 @@\n
  • lemon
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    counter.h File Reference
    Tools and Utilities » Miscellaneous Tools » Time Measuring and Counting
    \n+
    list_graph.h File Reference
    Data Structures » Graph Structures
    \n
    \n
    \n-
    #include <string>
    \n-#include <iostream>
    \n+
    #include <lemon/core.h>
    \n+#include <lemon/error.h>
    \n+#include <lemon/bits/graph_extender.h>
    \n+#include <vector>
    \n+#include <list>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  Counter
     A counter class. More...
    class  ListDigraph
     A general directed graph structure. More...
     
    class  NoCounter
     'Do nothing' version of Counter. More...
    class  ListDigraph::Snapshot
     Class to make a snapshot of the digraph and restore it later. More...
     
    class  ListGraph
     A general undirected graph structure. More...
     
    class  ListGraph::Snapshot
     Class to make a snapshot of the graph and restore it later. More...
     
    class  ListBpGraph
     A general undirected graph structure. More...
     
    class  ListBpGraph::Snapshot
     Class to make a snapshot of the graph and restore it later. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,24 +6,39 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-counter.h File Reference\n-Tools_and_Utilities \u00bb Miscellaneous_Tools \u00bb Time_Measuring_and_Counting\n-#include \n-#include \n+list_graph.h File Reference\n+Data_Structures \u00bb Graph_Structures\n+#include \n+#include \n+#include \n+#include \n+#include \n Classes\n-class \u00a0Counter\n-\u00a0 A counter class. More...\n+class \u00a0ListDigraph\n+\u00a0 A general directed graph structure. More...\n \u00a0\n-class \u00a0NoCounter\n-\u00a0 'Do nothing' version of Counter. More...\n+class \u00a0ListDigraph::Snapshot\n+\u00a0 Class to make a snapshot of the digraph and restore it later. More...\n+\u00a0\n+class \u00a0ListGraph\n+\u00a0 A general undirected graph structure. More...\n+\u00a0\n+class \u00a0ListGraph::Snapshot\n+\u00a0 Class to make a snapshot of the graph and restore it later. More...\n+\u00a0\n+class \u00a0ListBpGraph\n+\u00a0 A general undirected graph structure. More...\n+\u00a0\n+class \u00a0ListBpGraph::Snapshot\n+\u00a0 Class to make a snapshot of the graph and restore it later. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00209.html", "source2": "./usr/share/doc/lemon/html/a00209.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/unionfind.h File Reference\n+My Project: lemon/cbc.cc File Reference\n \n \n \n \n \n \n \n@@ -70,59 +70,37 @@\n
    \n \n
    \n \n
    \n
    \n-Classes |\n Namespaces
    \n-
    unionfind.h File Reference
    Data Structures » Auxiliary Data Structures
    \n+
    cbc.cc File Reference
    \n
    \n
    \n-
    #include <vector>
    \n-#include <list>
    \n-#include <utility>
    \n-#include <algorithm>
    \n-#include <functional>
    \n-#include <lemon/core.h>
    \n+
    #include "cbc.h"
    \n+#include <coin/CoinModel.hpp>
    \n+#include <coin/CbcModel.hpp>
    \n+#include <coin/OsiSolverInterface.hpp>
    \n+#include "coin/OsiClpSolverInterface.hpp"
    \n+#include "coin/CbcCutGenerator.hpp"
    \n+#include "coin/CbcHeuristicLocal.hpp"
    \n+#include "coin/CbcHeuristicGreedy.hpp"
    \n+#include "coin/CbcHeuristicFPump.hpp"
    \n+#include "coin/CbcHeuristicRINS.hpp"
    \n+#include "coin/CglGomory.hpp"
    \n+#include "coin/CglProbing.hpp"
    \n+#include "coin/CglKnapsackCover.hpp"
    \n+#include "coin/CglOddHole.hpp"
    \n+#include "coin/CglClique.hpp"
    \n+#include "coin/CglFlowCover.hpp"
    \n+#include "coin/CglMixedIntegerRounding.hpp"
    \n+#include "coin/CbcHeuristic.hpp"
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-

    \n-Classes

    class  UnionFind< IM >
     A Union-Find data structure implementation. More...
     
    class  UnionFindEnum< IM >
     A Union-Find data structure implementation which is able to enumerate the components. More...
     
    class  UnionFindEnum< IM >::ClassIt
     LEMON style iterator for the representant items. More...
     
    class  UnionFindEnum< IM >::ItemIt
     LEMON style iterator for the items of a component. More...
     
    class  ExtendFindEnum< IM >
     A Extend-Find data structure implementation which is able to enumerate the components. More...
     
    class  ExtendFindEnum< IM >::ClassIt
     LEMON style iterator for the classes. More...
     
    class  ExtendFindEnum< IM >::ItemIt
     LEMON style iterator for the items of a component. More...
     
    class  HeapUnionFind< V, IM, Comp >
     A Union-Find data structure implementation which is able to store a priority for each item and retrieve the minimum of each class. More...
     
    class  HeapUnionFind< V, IM, Comp >::ItemIt
     LEMON style iterator for the items of a class. More...
     
    class  HeapUnionFind< V, IM, Comp >::ClassIt
     Class iterator. More...
     
    \n \n \n \n \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n
    \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,57 +5,34 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces\n-unionfind.h File Reference\n-Data_Structures \u00bb Auxiliary_Data_Structures\n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n- Classes\n-class \u00a0UnionFind<_IM_>\n-\u00a0 A Union-Find data structure implementation. More...\n-\u00a0\n-class \u00a0UnionFindEnum<_IM_>\n-\u00a0 A Union-Find data structure implementation which is able to enumerate\n- the components. More...\n-\u00a0\n-class \u00a0UnionFindEnum<_IM_>::ClassIt\n-\u00a0 LEMON style iterator for the representant items. More...\n-\u00a0\n-class \u00a0UnionFindEnum<_IM_>::ItemIt\n-\u00a0 LEMON style iterator for the items of a component. More...\n-\u00a0\n-class \u00a0ExtendFindEnum<_IM_>\n-\u00a0 A Extend-Find data structure implementation which is able to enumerate\n- the components. More...\n-\u00a0\n-class \u00a0ExtendFindEnum<_IM_>::ClassIt\n-\u00a0 LEMON style iterator for the classes. More...\n-\u00a0\n-class \u00a0ExtendFindEnum<_IM_>::ItemIt\n-\u00a0 LEMON style iterator for the items of a component. More...\n-\u00a0\n-class \u00a0HeapUnionFind<_V,_IM,_Comp_>\n-\u00a0 A Union-Find data structure implementation which is able to store a\n- priority for each item and retrieve the minimum of each class. More...\n-\u00a0\n-class \u00a0HeapUnionFind<_V,_IM,_Comp_>::ItemIt\n-\u00a0 LEMON style iterator for the items of a class. More...\n-\u00a0\n-class \u00a0HeapUnionFind<_V,_IM,_Comp_>::ClassIt\n-\u00a0 Class iterator. More...\n-\u00a0\n+Namespaces\n+cbc.cc File Reference\n+#include \"cbc.h\"\n+#include \n+#include \n+#include \n+#include \"coin/OsiClpSolverInterface.hpp\"\n+#include \"coin/CbcCutGenerator.hpp\"\n+#include \"coin/CbcHeuristicLocal.hpp\"\n+#include \"coin/CbcHeuristicGreedy.hpp\"\n+#include \"coin/CbcHeuristicFPump.hpp\"\n+#include \"coin/CbcHeuristicRINS.hpp\"\n+#include \"coin/CglGomory.hpp\"\n+#include \"coin/CglProbing.hpp\"\n+#include \"coin/CglKnapsackCover.hpp\"\n+#include \"coin/CglOddHole.hpp\"\n+#include \"coin/CglClique.hpp\"\n+#include \"coin/CglFlowCover.hpp\"\n+#include \"coin/CglMixedIntegerRounding.hpp\"\n+#include \"coin/CbcHeuristic.hpp\"\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00212.html", "source2": "./usr/share/doc/lemon/html/a00212.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/lp.h File Reference\n+My Project: lemon/arg_parser.h File Reference\n \n \n \n \n \n \n \n@@ -70,45 +70,45 @@\n
    \n \n
    \n \n
    \n
    \n-Namespaces |\n-Macros |\n-Typedefs
    \n-
    lp.h File Reference
    General Optimization Tools » LP and MIP Solvers
    \n+Classes |\n+Namespaces
    \n+
    arg_parser.h File Reference
    Tools and Utilities » Miscellaneous Tools
    \n \n
    \n-
    #include <lemon/config.h>
    \n+
    #include <vector>
    \n+#include <map>
    \n+#include <list>
    \n+#include <string>
    \n+#include <iostream>
    \n+#include <sstream>
    \n+#include <algorithm>
    \n+#include <lemon/assert.h>
    \n
    \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+

    \n+Classes

    class  ArgParserException
     Exception used by ArgParser. More...
     
    class  ArgParser
     Command line arguments parser. More...
     
    class  ArgParser::RefType
     Magic type for operator[]. More...
     
    \n \n \n \n \n-

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n-\n-\n-

    \n-Macros

    #define LEMON_DEFAULT_LP   SOLVER
     The default LP solver identifier.
     
    #define LEMON_DEFAULT_MIP   SOLVER
     The default MIP solver identifier.
     
    \n-\n-\n-\n-\n-\n-\n-\n

    \n-Typedefs

    typedef GlpkLp Lp
     The default LP solver.
     
    typedef GlpkMip Mip
     The default MIP solver.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,33 +5,36 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Namespaces | Macros | Typedefs\n-lp.h File Reference\n-General_Optimization_Tools \u00bb LP_and_MIP_Solvers\n-#include \n- Namespaces\n-namespace \u00a0lemon\n-\u00a0 The namespace of LEMON.\n-\u00a0\n- Macros\n-#define\u00a0LEMON_DEFAULT_LP\u00a0\u00a0\u00a0SOLVER\n-\u00a0 The default LP solver identifier.\n+Classes | Namespaces\n+arg_parser.h File Reference\n+Tools_and_Utilities \u00bb Miscellaneous_Tools\n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+ Classes\n+class \u00a0ArgParserException\n+\u00a0 Exception used by ArgParser. More...\n \u00a0\n-#define\u00a0LEMON_DEFAULT_MIP\u00a0\u00a0\u00a0SOLVER\n-\u00a0 The default MIP solver identifier.\n+class \u00a0ArgParser\n+\u00a0 Command line arguments parser. More...\n \u00a0\n- Typedefs\n- typedef GlpkLp\u00a0Lp\n-\u00a0 The default LP solver.\n+class \u00a0ArgParser::RefType\n+\u00a0 Magic type for operator[]. More...\n \u00a0\n-typedef GlpkMip\u00a0Mip\n-\u00a0 The default MIP solver.\n+ Namespaces\n+namespace \u00a0lemon\n+\u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00215.html", "source2": "./usr/share/doc/lemon/html/a00215.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/lp_base.cc File Reference\n+My Project: lemon/bucket_heap.h File Reference\n \n \n \n \n \n \n \n@@ -70,20 +70,32 @@\n
    \n \n
    \n
    \n
    \n
    \n+Classes |\n Namespaces
    \n-
    lp_base.cc File Reference
    \n+
    bucket_heap.h File Reference
    Data Structures » Heap Structures
    \n
    \n
    \n-
    #include <lemon/lp_base.h>
    \n+
    #include <vector>
    \n+#include <utility>
    \n+#include <functional>
    \n
    \n+\n+\n+\n+\n+\n+\n+\n+

    \n+Classes

    class  BucketHeap< IM, MIN >
     Bucket heap data structure. More...
     
    class  SimpleBucketHeap< IM, MIN >
     Simplified bucket heap data structure. More...
     
    \n \n \n \n \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n
    \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,17 +5,27 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Namespaces\n-lp_base.cc File Reference\n-#include \n+Classes | Namespaces\n+bucket_heap.h File Reference\n+Data_Structures \u00bb Heap_Structures\n+#include \n+#include \n+#include \n+ Classes\n+class \u00a0BucketHeap<_IM,_MIN_>\n+\u00a0 Bucket heap data structure. More...\n+\u00a0\n+class \u00a0SimpleBucketHeap<_IM,_MIN_>\n+\u00a0 Simplified bucket heap data structure. More...\n+\u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00218.html", "source2": "./usr/share/doc/lemon/html/a00218.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/tolerance.h File Reference\n+My Project: lemon/nauty_reader.h File Reference\n \n \n \n \n \n \n \n@@ -70,40 +70,35 @@\n
    \n \n
    \n
    \n
    \n
    \n-Classes |\n-Namespaces
    \n-
    tolerance.h File Reference
    Tools and Utilities » Miscellaneous Tools
    \n+Namespaces |\n+Functions
    \n+
    nauty_reader.h File Reference
    Input-Output » NAUTY Format
    \n \n
    \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-

    \n-Classes

    class  Tolerance< T >
     A class to provide a basic way to handle the comparison of numbers that are obtained as a result of a probably inexact computation. More...
     
    class  Tolerance< float >
     Float specialization of Tolerance. More...
     
    class  Tolerance< double >
     Double specialization of Tolerance. More...
     
    class  Tolerance< long double >
     Long double specialization of Tolerance. More...
     
    \n+
    #include <vector>
    \n+#include <iostream>
    \n+#include <string>
    \n+
    \n \n \n \n \n+

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n+\n+\n+\n+\n+\n

    \n+Functions

    template<typename Graph >
    std::istream & readNautyGraph (Graph &graph, std::istream &is=std::cin)
     Nauty file reader.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,32 +5,26 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces\n-tolerance.h File Reference\n-Tools_and_Utilities \u00bb Miscellaneous_Tools\n- Classes\n-class \u00a0Tolerance<_T_>\n-\u00a0 A class to provide a basic way to handle the comparison of numbers that\n- are obtained as a result of a probably inexact computation. More...\n-\u00a0\n-class \u00a0Tolerance<_float_>\n-\u00a0 Float specialization of Tolerance. More...\n-\u00a0\n-class \u00a0Tolerance<_double_>\n-\u00a0 Double specialization of Tolerance. More...\n-\u00a0\n-class \u00a0Tolerance<_long_double_>\n-\u00a0 Long double specialization of Tolerance. More...\n-\u00a0\n+Namespaces | Functions\n+nauty_reader.h File Reference\n+Input-Output \u00bb NAUTY_Format\n+#include \n+#include \n+#include \n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n+ Functions\n+template\n+std::istream &\u00a0readNautyGraph (Graph &graph, std::istream &is=std::cin)\n+\u00a0 Nauty file reader.\n+\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00221.html", "source2": "./usr/share/doc/lemon/html/a00221.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/insertion_tsp.h File Reference\n+My Project: lemon/color.h File Reference\n \n \n \n \n \n \n \n@@ -71,35 +71,46 @@\n \n \n \n
    \n
    \n Classes |\n-Namespaces
    \n-
    insertion_tsp.h File Reference
    Algorithms » Traveling Salesman Problem
    \n+Namespaces |\n+Functions
    \n+
    color.h File Reference
    Tools and Utilities » Miscellaneous Tools
    \n \n
    \n
    #include <vector>
    \n-#include <functional>
    \n-#include <lemon/full_graph.h>
    \n-#include <lemon/maps.h>
    \n-#include <lemon/random.h>
    \n+#include <lemon/math.h>
    \n+#include <lemon/maps.h>
    \n
    \n \n-\n-\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  InsertionTsp< CM >
     Insertion algorithm for symmetric TSP. More...
    class  Color
     Data structure representing RGB colors. More...
     
    class  Palette
     Map ints to different Colors. More...
     
    \n \n \n \n \n+

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n+\n+\n+\n+\n+\n+\n+\n

    \n+Functions

    Color distantColor (const Color &c)
     Returns a visibly distinct Color.
     
    Color distantBW (const Color &c)
     Returns black for light colors and white for the dark ones.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,27 +5,35 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces\n-insertion_tsp.h File Reference\n-Algorithms \u00bb Traveling_Salesman_Problem\n+Classes | Namespaces | Functions\n+color.h File Reference\n+Tools_and_Utilities \u00bb Miscellaneous_Tools\n #include \n-#include \n-#include \n+#include \n #include \n-#include \n Classes\n-class \u00a0InsertionTsp<_CM_>\n-\u00a0 Insertion algorithm for symmetric TSP. More...\n+class \u00a0Color\n+\u00a0 Data structure representing RGB colors. More...\n+\u00a0\n+class \u00a0Palette\n+\u00a0 Map ints to different Colors. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n+ Functions\n+Color\u00a0distantColor (const Color &c)\n+\u00a0 Returns a visibly distinct Color.\n+\u00a0\n+Color\u00a0distantBW (const Color &c)\n+\u00a0 Returns black for light colors and white for the dark ones.\n+\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00224.html", "source2": "./usr/share/doc/lemon/html/a00224.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/fractional_matching.h File Reference\n+My Project: lemon/lp_base.cc File Reference\n \n \n \n \n \n \n \n@@ -70,54 +70,20 @@\n
    \n \n
    \n \n
    \n
    \n-Classes |\n Namespaces
    \n-
    fractional_matching.h File Reference
    Algorithms » Matching Algorithms
    \n+
    lp_base.cc File Reference
    \n
    \n
    \n-
    #include <vector>
    \n-#include <queue>
    \n-#include <set>
    \n-#include <limits>
    \n-#include <lemon/core.h>
    \n-#include <lemon/unionfind.h>
    \n-#include <lemon/bin_heap.h>
    \n-#include <lemon/maps.h>
    \n-#include <lemon/assert.h>
    \n-#include <lemon/elevator.h>
    \n+
    #include <lemon/lp_base.h>
    \n
    \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-

    \n-Classes

    struct  MaxFractionalMatchingDefaultTraits< GR >
     Default traits class of MaxFractionalMatching class. More...
     
    class  MaxFractionalMatching< GR, TR >
     Max cardinality fractional matching. More...
     
    struct  MaxFractionalMatching< GR, TR >::SetMatchingMap< T >
     Named parameter for setting MatchingMap type More...
     
    struct  MaxFractionalMatching< GR, TR >::SetElevator< T >
     Named parameter for setting Elevator type More...
     
    struct  MaxFractionalMatching< GR, TR >::SetStandardElevator< T >
     Named parameter for setting Elevator type with automatic allocation More...
     
    class  MaxWeightedFractionalMatching< GR, WM >
     Weighted fractional matching in general graphs. More...
     
    class  MaxWeightedPerfectFractionalMatching< GR, WM >
     Weighted fractional perfect matching in general graphs. More...
     
    \n \n \n \n \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n
    \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,50 +5,17 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces\n-fractional_matching.h File Reference\n-Algorithms \u00bb Matching_Algorithms\n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n- Classes\n-struct \u00a0MaxFractionalMatchingDefaultTraits<_GR_>\n-\u00a0 Default traits class of MaxFractionalMatching class. More...\n-\u00a0\n- class \u00a0MaxFractionalMatching<_GR,_TR_>\n-\u00a0 Max cardinality fractional matching. More...\n-\u00a0\n-struct \u00a0MaxFractionalMatching<_GR,_TR_>::SetMatchingMap<_T_>\n-\u00a0 Named_parameter for setting MatchingMap type More...\n-\u00a0\n-struct \u00a0MaxFractionalMatching<_GR,_TR_>::SetElevator<_T_>\n-\u00a0 Named_parameter for setting Elevator type More...\n-\u00a0\n-struct \u00a0MaxFractionalMatching<_GR,_TR_>::SetStandardElevator<_T_>\n-\u00a0 Named_parameter for setting Elevator type with automatic allocation\n- More...\n-\u00a0\n- class \u00a0MaxWeightedFractionalMatching<_GR,_WM_>\n-\u00a0 Weighted fractional matching in general graphs. More...\n-\u00a0\n- class \u00a0MaxWeightedPerfectFractionalMatching<_GR,_WM_>\n-\u00a0 Weighted fractional perfect matching in general graphs. More...\n-\u00a0\n+Namespaces\n+lp_base.cc File Reference\n+#include \n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00227.html", "source2": "./usr/share/doc/lemon/html/a00227.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/pairing_heap.h File Reference\n+My Project: lemon/planarity.h File Reference\n \n \n \n \n \n \n \n@@ -71,34 +71,56 @@\n \n
    \n \n
    \n
    \n Classes |\n-Namespaces
    \n-
    pairing_heap.h File Reference
    Data Structures » Heap Structures
    \n+Namespaces |\n+Functions
    \n+
    planarity.h File Reference
    Algorithms » Planar Embedding and Drawing
    \n \n
    \n
    #include <vector>
    \n-#include <utility>
    \n-#include <functional>
    \n-#include <lemon/math.h>
    \n+#include <list>
    \n+#include <lemon/dfs.h>
    \n+#include <lemon/bfs.h>
    \n+#include <lemon/radix_sort.h>
    \n+#include <lemon/maps.h>
    \n+#include <lemon/path.h>
    \n+#include <lemon/bucket_heap.h>
    \n+#include <lemon/adaptors.h>
    \n+#include <lemon/edge_set.h>
    \n+#include <lemon/color.h>
    \n+#include <lemon/dim2.h>
    \n
    \n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  PairingHeap< PR, IM, CMP >
     Pairing Heap. More...
    class  PlanarEmbedding< Graph >
     Planar embedding of an undirected simple graph. More...
     
    class  PlanarDrawing< Graph >
     Schnyder's planar drawing algorithm. More...
     
    class  PlanarColoring< Graph >
     Coloring planar graphs. More...
     
    \n \n \n \n \n+

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n+\n+\n+\n+\n+\n

    \n+Functions

    template<typename GR >
    bool checkPlanarity (const GR &graph)
     Planarity checking of an undirected simple graph.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,26 +5,45 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces\n-pairing_heap.h File Reference\n-Data_Structures \u00bb Heap_Structures\n+Classes | Namespaces | Functions\n+planarity.h File Reference\n+Algorithms \u00bb Planar_Embedding_and_Drawing\n #include \n-#include \n-#include \n-#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n Classes\n-class \u00a0PairingHeap<_PR,_IM,_CMP_>\n-\u00a0 Pairing Heap. More...\n+class \u00a0PlanarEmbedding<_Graph_>\n+\u00a0 Planar embedding of an undirected simple graph. More...\n+\u00a0\n+class \u00a0PlanarDrawing<_Graph_>\n+\u00a0 Schnyder's planar drawing algorithm. More...\n+\u00a0\n+class \u00a0PlanarColoring<_Graph_>\n+\u00a0 Coloring planar graphs. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n+ Functions\n+template\n+bool\u00a0checkPlanarity (const GR &graph)\n+\u00a0 Planarity checking of an undirected simple graph.\n+\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00230.html", "source2": "./usr/share/doc/lemon/html/a00230.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/elevator.h File Reference\n+My Project: lemon/bfs.h File Reference\n \n \n \n \n \n \n \n@@ -71,37 +71,83 @@\n \n \n \n
    \n
    \n Classes |\n-Namespaces
    \n-
    elevator.h File Reference
    Data Structures » Auxiliary Data Structures
    \n+Namespaces |\n+Functions
    \n+
    bfs.h File Reference
    Algorithms » Graph Search
    \n \n
    \n-

    Detailed Description

    \n-

    Elevator class implements an efficient data structure for labeling items in push-relabel type algorithms.

    \n-
    #include <lemon/core.h>
    \n-#include <lemon/bits/traits.h>
    \n+
    #include <lemon/list_graph.h>
    \n+#include <lemon/bits/path_dump.h>
    \n+#include <lemon/core.h>
    \n+#include <lemon/error.h>
    \n+#include <lemon/maps.h>
    \n+#include <lemon/path.h>
    \n
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  Elevator< GR, Item >
     Class for handling \"labels\" in push-relabel type algorithms. More...
    struct  BfsDefaultTraits< GR >
     Default traits class of Bfs class. More...
     
    class  LinkedElevator< GR, Item >
     Class for handling \"labels\" in push-relabel type algorithms. More...
    class  Bfs< GR, TR >
     BFS algorithm class. More...
     
    struct  Bfs< GR, TR >::SetPredMap< T >
     Named parameter for setting PredMap type. More...
     
    struct  Bfs< GR, TR >::SetDistMap< T >
     Named parameter for setting DistMap type. More...
     
    struct  Bfs< GR, TR >::SetReachedMap< T >
     Named parameter for setting ReachedMap type. More...
     
    struct  Bfs< GR, TR >::SetProcessedMap< T >
     Named parameter for setting ProcessedMap type. More...
     
    struct  Bfs< GR, TR >::SetStandardProcessedMap
     Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool>. More...
     
    struct  BfsWizardDefaultTraits< GR >
     Default traits class of bfs() function. More...
     
    class  BfsWizardBase< GR >
     Default traits class used by BfsWizard. More...
     
    class  BfsWizard< TR >
     Auxiliary class for the function-type interface of BFS algorithm. More...
     
    struct  BfsVisitor< GR >
     Visitor class for BFS. More...
     
    struct  BfsVisitDefaultTraits< GR >
     Default traits class of BfsVisit class. More...
     
    class  BfsVisit< GR, VS, TR >
     BFS algorithm class with visitor interface. More...
     
    struct  BfsVisit< GR, VS, TR >::SetReachedMap< T >
     Named parameter for setting ReachedMap type. More...
     
    \n \n \n \n \n+

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n+\n+\n+\n+\n+\n

    \n+Functions

    template<class GR >
    BfsWizard< BfsWizardBase< GR > > bfs (const GR &digraph)
     Function-type interface for BFS algorithm.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,30 +5,74 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces\n-elevator.h File Reference\n-Data_Structures \u00bb Auxiliary_Data_Structures\n-***** Detailed Description *****\n-Elevator class implements an efficient data structure for labeling items in\n-push-relabel type algorithms.\n+Classes | Namespaces | Functions\n+bfs.h File Reference\n+Algorithms \u00bb Graph_Search\n+#include \n+#include \n #include \n-#include \n+#include \n+#include \n+#include \n Classes\n-class \u00a0Elevator<_GR,_Item_>\n-\u00a0 Class for handling \"labels\" in push-relabel type algorithms. More...\n+struct \u00a0BfsDefaultTraits<_GR_>\n+\u00a0 Default traits class of Bfs class. More...\n \u00a0\n-class \u00a0LinkedElevator<_GR,_Item_>\n-\u00a0 Class for handling \"labels\" in push-relabel type algorithms. More...\n+ class \u00a0Bfs<_GR,_TR_>\n+\u00a0 BFS algorithm class. More...\n+\u00a0\n+struct \u00a0Bfs<_GR,_TR_>::SetPredMap<_T_>\n+\u00a0 Named_parameter for setting PredMap type. More...\n+\u00a0\n+struct \u00a0Bfs<_GR,_TR_>::SetDistMap<_T_>\n+\u00a0 Named_parameter for setting DistMap type. More...\n+\u00a0\n+struct \u00a0Bfs<_GR,_TR_>::SetReachedMap<_T_>\n+\u00a0 Named_parameter for setting ReachedMap type. More...\n+\u00a0\n+struct \u00a0Bfs<_GR,_TR_>::SetProcessedMap<_T_>\n+\u00a0 Named_parameter for setting ProcessedMap type. More...\n+\u00a0\n+struct \u00a0Bfs<_GR,_TR_>::SetStandardProcessedMap\n+\u00a0 Named_parameter for setting ProcessedMap type to be Digraph::\n+ NodeMap. More...\n+\u00a0\n+struct \u00a0BfsWizardDefaultTraits<_GR_>\n+\u00a0 Default traits class of bfs() function. More...\n+\u00a0\n+ class \u00a0BfsWizardBase<_GR_>\n+\u00a0 Default traits class used by BfsWizard. More...\n+\u00a0\n+ class \u00a0BfsWizard<_TR_>\n+\u00a0 Auxiliary class for the function-type interface of BFS algorithm.\n+ More...\n+\u00a0\n+struct \u00a0BfsVisitor<_GR_>\n+\u00a0 Visitor class for BFS. More...\n+\u00a0\n+struct \u00a0BfsVisitDefaultTraits<_GR_>\n+\u00a0 Default traits class of BfsVisit class. More...\n+\u00a0\n+ class \u00a0BfsVisit<_GR,_VS,_TR_>\n+\u00a0 BFS algorithm class with visitor interface. More...\n+\u00a0\n+struct \u00a0BfsVisit<_GR,_VS,_TR_>::SetReachedMap<_T_>\n+\u00a0 Named_parameter for setting ReachedMap type. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n+ Functions\n+template\n+BfsWizard< BfsWizardBase< GR > >\u00a0bfs (const GR &digraph)\n+\u00a0 Function-type interface for BFS algorithm.\n+\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00233.html", "source2": "./usr/share/doc/lemon/html/a00233.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/time_measure.h File Reference\n+My Project: lemon/connectivity.h File Reference\n \n \n \n \n \n \n \n@@ -70,55 +70,140 @@\n
    \n \n
    \n
    \n
    \n
    \n-Classes |\n Namespaces |\n Functions
    \n-
    time_measure.h File Reference
    Tools and Utilities » Miscellaneous Tools » Time Measuring and Counting
    \n+
    connectivity.h File Reference
    Algorithms » Connectivity and Other Graph Properties
    \n
    \n
    \n-
    #include <unistd.h>
    \n-#include <sys/times.h>
    \n-#include <sys/time.h>
    \n-#include <string>
    \n-#include <fstream>
    \n-#include <iostream>
    \n-#include <lemon/math.h>
    \n+

    Detailed Description

    \n+

    Connectivity algorithms

    \n+
    #include <lemon/dfs.h>
    \n+#include <lemon/bfs.h>
    \n+#include <lemon/core.h>
    \n+#include <lemon/maps.h>
    \n+#include <lemon/adaptors.h>
    \n+#include <lemon/concepts/digraph.h>
    \n+#include <lemon/concepts/graph.h>
    \n+#include <lemon/concept_check.h>
    \n+#include <stack>
    \n+#include <functional>
    \n
    \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-

    \n-Classes

    class  TimeStamp
     A class to store (cpu)time instances. More...
     
    class  Timer
     Class for measuring the cpu time and real time usage of the process. More...
     
    class  TimeReport
     Same as Timer but prints a report on destruction. More...
     
    class  NoTimeReport
     'Do nothing' version of TimeReport More...
     
    \n \n \n \n \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n

    \n Functions

    template<class F >
    TimeStamp runningTimeTest (F f, double min_time=10, unsigned int *num=NULL, TimeStamp *full_time=NULL)
     Tool to measure the running time more exactly.
     
    template<typename Graph >
    bool connected (const Graph &graph)
     Check whether an undirected graph is connected.
     
    template<typename Graph >
    int countConnectedComponents (const Graph &graph)
     Count the number of connected components of an undirected graph.
     
    template<class Graph , class NodeMap >
    int connectedComponents (const Graph &graph, NodeMap &compMap)
     Find the connected components of an undirected graph.
     
    template<typename Digraph >
    bool stronglyConnected (const Digraph &digraph)
     Check whether a directed graph is strongly connected.
     
    template<typename Digraph >
    int countStronglyConnectedComponents (const Digraph &digraph)
     Count the number of strongly connected components of a directed graph.
     
    template<typename Digraph , typename NodeMap >
    int stronglyConnectedComponents (const Digraph &digraph, NodeMap &compMap)
     Find the strongly connected components of a directed graph.
     
    template<typename Digraph , typename ArcMap >
    int stronglyConnectedCutArcs (const Digraph &digraph, ArcMap &cutMap)
     Find the cut arcs of the strongly connected components.
     
    template<typename Graph >
    int countBiNodeConnectedComponents (const Graph &graph)
     Count the number of bi-node-connected components of an undirected graph.
     
    template<typename Graph >
    bool biNodeConnected (const Graph &graph)
     Check whether an undirected graph is bi-node-connected.
     
    template<typename Graph , typename EdgeMap >
    int biNodeConnectedComponents (const Graph &graph, EdgeMap &compMap)
     Find the bi-node-connected components of an undirected graph.
     
    template<typename Graph , typename NodeMap >
    int biNodeConnectedCutNodes (const Graph &graph, NodeMap &cutMap)
     Find the bi-node-connected cut nodes in an undirected graph.
     
    template<typename Graph >
    int countBiEdgeConnectedComponents (const Graph &graph)
     Count the number of bi-edge-connected components of an undirected graph.
     
    template<typename Graph >
    bool biEdgeConnected (const Graph &graph)
     Check whether an undirected graph is bi-edge-connected.
     
    template<typename Graph , typename NodeMap >
    int biEdgeConnectedComponents (const Graph &graph, NodeMap &compMap)
     Find the bi-edge-connected components of an undirected graph.
     
    template<typename Graph , typename EdgeMap >
    int biEdgeConnectedCutEdges (const Graph &graph, EdgeMap &cutMap)
     Find the bi-edge-connected cut edges in an undirected graph.
     
    template<typename Digraph >
    bool dag (const Digraph &digraph)
     Check whether a digraph is DAG.
     
    template<typename Digraph , typename NodeMap >
    void topologicalSort (const Digraph &digraph, NodeMap &order)
     Sort the nodes of a DAG into topolgical order.
     
    template<typename Digraph , typename NodeMap >
    bool checkedTopologicalSort (const Digraph &digraph, NodeMap &order)
     Sort the nodes of a DAG into topolgical order.
     
    template<typename Graph >
    bool acyclic (const Graph &graph)
     Check whether an undirected graph is acyclic.
     
    template<typename Graph >
    bool tree (const Graph &graph)
     Check whether an undirected graph is tree.
     
    template<typename Graph >
    bool bipartite (const Graph &graph)
     Check whether an undirected graph is bipartite.
     
    template<typename Graph , typename NodeMap >
    bool bipartitePartitions (const Graph &graph, NodeMap &partMap)
     Find the bipartite partitions of an undirected graph.
     
    template<typename Graph >
    bool loopFree (const Graph &graph)
     Check whether the given graph contains no loop arcs/edges.
     
    template<typename Graph >
    bool parallelFree (const Graph &graph)
     Check whether the given graph contains no parallel arcs/edges.
     
    template<typename Graph >
    bool simpleGraph (const Graph &graph)
     Check whether the given graph is simple.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,45 +5,131 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces | Functions\n-time_measure.h File Reference\n-Tools_and_Utilities \u00bb Miscellaneous_Tools \u00bb Time_Measuring_and_Counting\n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n- Classes\n-class \u00a0TimeStamp\n-\u00a0 A class to store (cpu)time instances. More...\n-\u00a0\n-class \u00a0Timer\n-\u00a0 Class for measuring the cpu time and real time usage of the process.\n- More...\n-\u00a0\n-class \u00a0TimeReport\n-\u00a0 Same as Timer but prints a report on destruction. More...\n-\u00a0\n-class \u00a0NoTimeReport\n-\u00a0 'Do nothing' version of TimeReport More...\n-\u00a0\n+Namespaces | Functions\n+connectivity.h File Reference\n+Algorithms \u00bb Connectivity_and_Other_Graph_Properties\n+***** Detailed Description *****\n+Connectivity algorithms\n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n Functions\n-template\n-TimeStamp\u00a0runningTimeTest (F f, double min_time=10, unsigned int *num=NULL,\n- TimeStamp *full_time=NULL)\n-\u00a0 Tool to measure the running time more exactly.\n+template\n+bool\u00a0connected (const Graph &graph)\n+\u00a0 Check whether an undirected graph is connected.\n+\u00a0\n+template\n+ int\u00a0countConnectedComponents (const Graph &graph)\n+\u00a0 Count the number of connected components of an undirected graph.\n+\u00a0\n+template\n+ int\u00a0connectedComponents (const Graph &graph, NodeMap &compMap)\n+\u00a0 Find the connected components of an undirected graph.\n+\u00a0\n+template\n+bool\u00a0stronglyConnected (const Digraph &digraph)\n+\u00a0 Check whether a directed graph is strongly connected.\n+\u00a0\n+template\n+ int\u00a0countStronglyConnectedComponents (const Digraph &digraph)\n+\u00a0 Count the number of strongly connected components of a directed graph.\n+\u00a0\n+template\n+ int\u00a0stronglyConnectedComponents (const Digraph &digraph, NodeMap &compMap)\n+\u00a0 Find the strongly connected components of a directed graph.\n+\u00a0\n+template\n+ int\u00a0stronglyConnectedCutArcs (const Digraph &digraph, ArcMap &cutMap)\n+\u00a0 Find the cut arcs of the strongly connected components.\n+\u00a0\n+template\n+ int\u00a0countBiNodeConnectedComponents (const Graph &graph)\n+\u00a0 Count the number of bi-node-connected components of an undirected graph.\n+\u00a0\n+template\n+bool\u00a0biNodeConnected (const Graph &graph)\n+\u00a0 Check whether an undirected graph is bi-node-connected.\n+\u00a0\n+template\n+ int\u00a0biNodeConnectedComponents (const Graph &graph, EdgeMap &compMap)\n+\u00a0 Find the bi-node-connected components of an undirected graph.\n+\u00a0\n+template\n+ int\u00a0biNodeConnectedCutNodes (const Graph &graph, NodeMap &cutMap)\n+\u00a0 Find the bi-node-connected cut nodes in an undirected graph.\n+\u00a0\n+template\n+ int\u00a0countBiEdgeConnectedComponents (const Graph &graph)\n+\u00a0 Count the number of bi-edge-connected components of an undirected graph.\n+\u00a0\n+template\n+bool\u00a0biEdgeConnected (const Graph &graph)\n+\u00a0 Check whether an undirected graph is bi-edge-connected.\n+\u00a0\n+template\n+ int\u00a0biEdgeConnectedComponents (const Graph &graph, NodeMap &compMap)\n+\u00a0 Find the bi-edge-connected components of an undirected graph.\n+\u00a0\n+template\n+ int\u00a0biEdgeConnectedCutEdges (const Graph &graph, EdgeMap &cutMap)\n+\u00a0 Find the bi-edge-connected cut edges in an undirected graph.\n+\u00a0\n+template\n+bool\u00a0dag (const Digraph &digraph)\n+\u00a0 Check whether a digraph is DAG.\n+\u00a0\n+template\n+void\u00a0topologicalSort (const Digraph &digraph, NodeMap &order)\n+\u00a0 Sort the nodes of a DAG into topolgical order.\n+\u00a0\n+template\n+bool\u00a0checkedTopologicalSort (const Digraph &digraph, NodeMap &order)\n+\u00a0 Sort the nodes of a DAG into topolgical order.\n+\u00a0\n+template\n+bool\u00a0acyclic (const Graph &graph)\n+\u00a0 Check whether an undirected graph is acyclic.\n+\u00a0\n+template\n+bool\u00a0tree (const Graph &graph)\n+\u00a0 Check whether an undirected graph is tree.\n+\u00a0\n+template\n+bool\u00a0bipartite (const Graph &graph)\n+\u00a0 Check whether an undirected graph is bipartite.\n+\u00a0\n+template\n+bool\u00a0bipartitePartitions (const Graph &graph, NodeMap &partMap)\n+\u00a0 Find the bipartite partitions of an undirected graph.\n+\u00a0\n+template\n+bool\u00a0loopFree (const Graph &graph)\n+\u00a0 Check whether the given graph contains no loop arcs/edges.\n+\u00a0\n+template\n+bool\u00a0parallelFree (const Graph &graph)\n+\u00a0 Check whether the given graph contains no parallel arcs/edges.\n+\u00a0\n+template\n+bool\u00a0simpleGraph (const Graph &graph)\n+\u00a0 Check whether the given graph is simple.\n \u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00236.html", "source2": "./usr/share/doc/lemon/html/a00236.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/soplex.h File Reference\n+My Project: lemon/clp.h File Reference\n \n \n \n \n \n \n \n@@ -72,25 +72,25 @@\n
  • lemon
    • \n
    \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    soplex.h File Reference
    \n+
    clp.h File Reference
    \n
    \n
    \n
    #include <vector>
    \n #include <string>
    \n-#include <lemon/lp_base.h>
    \n+#include <lemon/lp_base.h>
    \n
    \n \n-\n-\n+\n+\n \n

    \n Classes

    class  SoplexLp
     Interface for the SOPLEX solver. More...
    class  ClpLp
     Interface for the CLP solver. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,21 +6,21 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-soplex.h File Reference\n+clp.h File Reference\n #include \n #include \n #include \n Classes\n-class \u00a0SoplexLp\n-\u00a0 Interface for the SOPLEX solver. More...\n+class \u00a0ClpLp\n+\u00a0 Interface for the CLP solver. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00239.html", "source2": "./usr/share/doc/lemon/html/a00239.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/random.cc File Reference\n+My Project: lemon/min_cost_arborescence.h File Reference\n \n \n \n \n \n \n \n@@ -70,32 +70,55 @@\n
    \n \n
    \n \n
    \n
    \n+Classes |\n Namespaces |\n-Variables
    \n-
    random.cc File Reference
    \n+Functions
    \n+
    min_cost_arborescence.h File Reference
    Algorithms » Minimum Spanning Tree Algorithms
    \n \n
    \n-
    #include <lemon/random.h>
    \n+
    #include <vector>
    \n+#include <lemon/list_graph.h>
    \n+#include <lemon/bin_heap.h>
    \n+#include <lemon/assert.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+

    \n+Classes

    struct  MinCostArborescenceDefaultTraits< GR, CM >
     Default traits class for MinCostArborescence class. More...
     
    class  MinCostArborescence< GR, CM, TR >
     Minimum Cost Arborescence algorithm class. More...
     
    struct  MinCostArborescence< GR, CM, TR >::SetArborescenceMap< T >
     Named parameter for setting ArborescenceMap type More...
     
    struct  MinCostArborescence< GR, CM, TR >::SetPredMap< T >
     Named parameter for setting PredMap type More...
     
    class  MinCostArborescence< GR, CM, TR >::DualIt
     LEMON iterator for getting a dual variable. More...
     
    \n \n \n \n \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n+\n+\n+\n+\n+\n

    \n-Variables

    Random rnd
     Global random number generator instance.
     

    \n+Functions

    template<typename Digraph , typename CostMap , typename ArborescenceMap >
    CostMap::Value minCostArborescence (const Digraph &digraph, const CostMap &cost, typename Digraph::Node source, ArborescenceMap &arborescence)
     Function type interface for MinCostArborescence algorithm.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,22 +5,45 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Namespaces | Variables\n-random.cc File Reference\n-#include \n+Classes | Namespaces | Functions\n+min_cost_arborescence.h File Reference\n+Algorithms \u00bb Minimum_Spanning_Tree_Algorithms\n+#include \n+#include \n+#include \n+#include \n+ Classes\n+struct \u00a0MinCostArborescenceDefaultTraits<_GR,_CM_>\n+\u00a0 Default traits class for MinCostArborescence class. More...\n+\u00a0\n+ class \u00a0MinCostArborescence<_GR,_CM,_TR_>\n+\u00a0 Minimum Cost Arborescence algorithm class. More...\n+\u00a0\n+struct \u00a0MinCostArborescence<_GR,_CM,_TR_>::SetArborescenceMap<_T_>\n+\u00a0 Named_parameter for setting ArborescenceMap type More...\n+\u00a0\n+struct \u00a0MinCostArborescence<_GR,_CM,_TR_>::SetPredMap<_T_>\n+\u00a0 Named_parameter for setting PredMap type More...\n+\u00a0\n+ class \u00a0MinCostArborescence<_GR,_CM,_TR_>::DualIt\n+\u00a0 LEMON iterator for getting a dual variable. More...\n+\u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n- Variables\n-Random\u00a0rnd\n-\u00a0 Global random number generator instance.\n+ Functions\n+template\n+CostMap::Value\u00a0minCostArborescence (const Digraph &digraph, const CostMap\n+ &cost, typename Digraph::Node source, ArborescenceMap\n+ &arborescence)\n+\u00a0 Function type interface for MinCostArborescence algorithm.\n \u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00242.html", "source2": "./usr/share/doc/lemon/html/a00242.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/dijkstra.h File Reference\n+My Project: lemon/fractional_matching.h File Reference\n \n \n \n \n \n \n \n@@ -71,82 +71,58 @@\n \n \n \n
    \n
    \n Classes |\n-Namespaces |\n-Functions
    \n-
    dijkstra.h File Reference
    Algorithms » Shortest Path Algorithms
    \n+Namespaces
    \n+
    fractional_matching.h File Reference
    Algorithms » Matching Algorithms
    \n \n
    \n-
    #include <limits>
    \n-#include <lemon/list_graph.h>
    \n-#include <lemon/bin_heap.h>
    \n-#include <lemon/bits/path_dump.h>
    \n-#include <lemon/core.h>
    \n-#include <lemon/error.h>
    \n-#include <lemon/maps.h>
    \n-#include <lemon/path.h>
    \n+
    #include <vector>
    \n+#include <queue>
    \n+#include <set>
    \n+#include <limits>
    \n+#include <lemon/core.h>
    \n+#include <lemon/unionfind.h>
    \n+#include <lemon/bin_heap.h>
    \n+#include <lemon/maps.h>
    \n+#include <lemon/assert.h>
    \n+#include <lemon/elevator.h>
    \n
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    struct  DijkstraDefaultOperationTraits< V >
     Default operation traits for the Dijkstra algorithm class. More...
    struct  MaxFractionalMatchingDefaultTraits< GR >
     Default traits class of MaxFractionalMatching class. More...
     
    struct  DijkstraDefaultTraits< GR, LEN >
     Default traits class of Dijkstra class. More...
    class  MaxFractionalMatching< GR, TR >
     Max cardinality fractional matching. More...
     
    class  Dijkstra< GR, LEN, TR >
     Dijkstra algorithm class. More...
    struct  MaxFractionalMatching< GR, TR >::SetMatchingMap< T >
     Named parameter for setting MatchingMap type More...
     
    struct  Dijkstra< GR, LEN, TR >::SetPredMap< T >
     Named parameter for setting PredMap type. More...
    struct  MaxFractionalMatching< GR, TR >::SetElevator< T >
     Named parameter for setting Elevator type More...
     
    struct  Dijkstra< GR, LEN, TR >::SetDistMap< T >
     Named parameter for setting DistMap type. More...
    struct  MaxFractionalMatching< GR, TR >::SetStandardElevator< T >
     Named parameter for setting Elevator type with automatic allocation More...
     
    struct  Dijkstra< GR, LEN, TR >::SetProcessedMap< T >
     Named parameter for setting ProcessedMap type. More...
    class  MaxWeightedFractionalMatching< GR, WM >
     Weighted fractional matching in general graphs. More...
     
    struct  Dijkstra< GR, LEN, TR >::SetStandardProcessedMap
     Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool>. More...
     
    struct  Dijkstra< GR, LEN, TR >::SetHeap< H, CR >
     Named parameter for setting heap and cross reference types More...
     
    struct  Dijkstra< GR, LEN, TR >::SetStandardHeap< H, CR >
     Named parameter for setting heap and cross reference types with automatic allocation More...
     
    struct  Dijkstra< GR, LEN, TR >::SetOperationTraits< T >
     Named parameter for setting OperationTraits type More...
     
    struct  DijkstraWizardDefaultTraits< GR, LEN >
     Default traits class of dijkstra() function. More...
     
    class  DijkstraWizardBase< GR, LEN >
     Default traits class used by DijkstraWizard. More...
     
    class  DijkstraWizard< TR >
     Auxiliary class for the function-type interface of Dijkstra algorithm. More...
    class  MaxWeightedPerfectFractionalMatching< GR, WM >
     Weighted fractional perfect matching in general graphs. More...
     
    \n \n \n \n \n-

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n

    \n-Functions

    template<typename GR , typename LEN >
    DijkstraWizard< DijkstraWizardBase< GR, LEN > > dijkstra (const GR &digraph, const LEN &length)
     Function-type interface for Dijkstra algorithm.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,76 +5,51 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces | Functions\n-dijkstra.h File Reference\n-Algorithms \u00bb Shortest_Path_Algorithms\n+Classes | Namespaces\n+fractional_matching.h File Reference\n+Algorithms \u00bb Matching_Algorithms\n+#include \n+#include \n+#include \n #include \n-#include \n-#include \n-#include \n #include \n-#include \n+#include \n+#include \n #include \n-#include \n+#include \n+#include \n Classes\n-struct \u00a0DijkstraDefaultOperationTraits<_V_>\n-\u00a0 Default operation traits for the Dijkstra algorithm class. More...\n-\u00a0\n-struct \u00a0DijkstraDefaultTraits<_GR,_LEN_>\n-\u00a0 Default traits class of Dijkstra class. More...\n-\u00a0\n- class \u00a0Dijkstra<_GR,_LEN,_TR_>\n-\u00a0 Dijkstra algorithm class. More...\n-\u00a0\n-struct \u00a0Dijkstra<_GR,_LEN,_TR_>::SetPredMap<_T_>\n-\u00a0 Named_parameter for setting PredMap type. More...\n-\u00a0\n-struct \u00a0Dijkstra<_GR,_LEN,_TR_>::SetDistMap<_T_>\n-\u00a0 Named_parameter for setting DistMap type. More...\n+struct \u00a0MaxFractionalMatchingDefaultTraits<_GR_>\n+\u00a0 Default traits class of MaxFractionalMatching class. More...\n \u00a0\n-struct \u00a0Dijkstra<_GR,_LEN,_TR_>::SetProcessedMap<_T_>\n-\u00a0 Named_parameter for setting ProcessedMap type. More...\n+ class \u00a0MaxFractionalMatching<_GR,_TR_>\n+\u00a0 Max cardinality fractional matching. More...\n \u00a0\n-struct \u00a0Dijkstra<_GR,_LEN,_TR_>::SetStandardProcessedMap\n-\u00a0 Named_parameter for setting ProcessedMap type to be Digraph::\n- NodeMap. More...\n+struct \u00a0MaxFractionalMatching<_GR,_TR_>::SetMatchingMap<_T_>\n+\u00a0 Named_parameter for setting MatchingMap type More...\n \u00a0\n-struct \u00a0Dijkstra<_GR,_LEN,_TR_>::SetHeap<_H,_CR_>\n-\u00a0 Named_parameter for setting heap and cross reference types More...\n+struct \u00a0MaxFractionalMatching<_GR,_TR_>::SetElevator<_T_>\n+\u00a0 Named_parameter for setting Elevator type More...\n \u00a0\n-struct \u00a0Dijkstra<_GR,_LEN,_TR_>::SetStandardHeap<_H,_CR_>\n-\u00a0 Named_parameter for setting heap and cross reference types with\n- automatic allocation More...\n-\u00a0\n-struct \u00a0Dijkstra<_GR,_LEN,_TR_>::SetOperationTraits<_T_>\n-\u00a0 Named_parameter for setting OperationTraits type More...\n+struct \u00a0MaxFractionalMatching<_GR,_TR_>::SetStandardElevator<_T_>\n+\u00a0 Named_parameter for setting Elevator type with automatic allocation\n+ More...\n \u00a0\n-struct \u00a0DijkstraWizardDefaultTraits<_GR,_LEN_>\n-\u00a0 Default traits class of dijkstra() function. More...\n+ class \u00a0MaxWeightedFractionalMatching<_GR,_WM_>\n+\u00a0 Weighted fractional matching in general graphs. More...\n \u00a0\n- class \u00a0DijkstraWizardBase<_GR,_LEN_>\n-\u00a0 Default traits class used by DijkstraWizard. More...\n-\u00a0\n- class \u00a0DijkstraWizard<_TR_>\n-\u00a0 Auxiliary class for the function-type interface of Dijkstra algorithm.\n- More...\n+ class \u00a0MaxWeightedPerfectFractionalMatching<_GR,_WM_>\n+\u00a0 Weighted fractional perfect matching in general graphs. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n- Functions\n-template\n-DijkstraWizard< DijkstraWizardBase< GR, dijkstra (const GR &digraph, const LEN\n- LEN > >\u00a0&length)\n-\u00a0 Function-type interface for Dijkstra\n- algorithm.\n-\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00245.html", "source2": "./usr/share/doc/lemon/html/a00245.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/math.h File Reference\n+My Project: lemon/counter.h File Reference\n \n \n \n \n \n \n \n@@ -70,83 +70,36 @@\n
    \n \n
    \n
    \n
    \n
    \n-Namespaces |\n-Functions |\n-Variables
    \n-
    math.h File Reference
    Tools and Utilities » Miscellaneous Tools
    \n+Classes |\n+Namespaces
    \n+
    counter.h File Reference
    Tools and Utilities » Miscellaneous Tools » Time Measuring and Counting
    \n \n
    \n-

    Detailed Description

    \n-

    Some extensions to the standard cmath library.

    \n-

    This file includes the standard math library (cmath).

    \n-
    #include <cmath>
    \n+
    #include <string>
    \n+#include <iostream>
    \n
    \n+\n+\n+\n+\n+\n+\n+\n+

    \n+Classes

    class  Counter
     A counter class. More...
     
    class  NoCounter
     'Do nothing' version of Counter. More...
     
    \n \n \n \n \n-

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n-\n-\n-

    \n-Functions

    bool isNaN (double v)
     Check whether the parameter is NaN or not.
     
    \n-double round (double r)
     Round a value to its closest integer.
     
    \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n

    \n-Variables

    \n-const long double E = 2.7182818284590452353602874713526625L
     The Euler constant.
     
    \n-const long double LOG2E = 1.4426950408889634073599246810018921L
     log_2(e)
     
    \n-const long double LOG10E = 0.4342944819032518276511289189166051L
     log_10(e)
     
    \n-const long double LN2 = 0.6931471805599453094172321214581766L
     ln(2)
     
    \n-const long double LN10 = 2.3025850929940456840179914546843642L
     ln(10)
     
    \n-const long double PI = 3.1415926535897932384626433832795029L
     pi
     
    \n-const long double PI_2 = 1.5707963267948966192313216916397514L
     pi/2
     
    \n-const long double PI_4 = 0.7853981633974483096156608458198757L
     pi/4
     
    \n-const long double SQRT2 = 1.4142135623730950488016887242096981L
     sqrt(2)
     
    \n-const long double SQRT1_2 = 0.7071067811865475244008443621048490L
     1/sqrt(2)
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,60 +5,27 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Namespaces | Functions | Variables\n-math.h File Reference\n-Tools_and_Utilities \u00bb Miscellaneous_Tools\n-***** Detailed Description *****\n-Some extensions to the standard cmath library.\n-This file includes the standard math library (cmath).\n-#include \n+Classes | Namespaces\n+counter.h File Reference\n+Tools_and_Utilities \u00bb Miscellaneous_Tools \u00bb Time_Measuring_and_Counting\n+#include \n+#include \n+ Classes\n+class \u00a0Counter\n+\u00a0 A counter class. More...\n+\u00a0\n+class \u00a0NoCounter\n+\u00a0 'Do nothing' version of Counter. More...\n+\u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n- Functions\n- bool\u00a0isNaN (double v)\n-\u00a0 Check whether the parameter is NaN or not.\n-\u00a0\n-double\u00a0round (double r)\n-\u00a0 Round a value to its closest integer.\n-\u00a0\n- Variables\n-const long double\u00a0E = 2.7182818284590452353602874713526625L\n-\u00a0 The Euler constant.\n-\u00a0\n-const long double\u00a0LOG2E = 1.4426950408889634073599246810018921L\n-\u00a0 log_2(e)\n-\u00a0\n-const long double\u00a0LOG10E = 0.4342944819032518276511289189166051L\n-\u00a0 log_10(e)\n-\u00a0\n-const long double\u00a0LN2 = 0.6931471805599453094172321214581766L\n-\u00a0 ln(2)\n-\u00a0\n-const long double\u00a0LN10 = 2.3025850929940456840179914546843642L\n-\u00a0 ln(10)\n-\u00a0\n-const long double\u00a0PI = 3.1415926535897932384626433832795029L\n-\u00a0 pi\n-\u00a0\n-const long double\u00a0PI_2 = 1.5707963267948966192313216916397514L\n-\u00a0 pi/2\n-\u00a0\n-const long double\u00a0PI_4 = 0.7853981633974483096156608458198757L\n-\u00a0 pi/4\n-\u00a0\n-const long double\u00a0SQRT2 = 1.4142135623730950488016887242096981L\n-\u00a0 sqrt(2)\n-\u00a0\n-const long double\u00a0SQRT1_2 = 0.7071067811865475244008443621048490L\n-\u00a0 1/sqrt(2)\n-\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00248.html", "source2": "./usr/share/doc/lemon/html/a00248.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/christofides_tsp.h File Reference\n+My Project: lemon/time_measure.h File Reference\n \n \n \n \n \n \n \n@@ -71,35 +71,54 @@\n \n
    \n \n
    \n
    \n Classes |\n-Namespaces
    \n-
    christofides_tsp.h File Reference
    Algorithms » Traveling Salesman Problem
    \n+Namespaces |\n+Functions
    \n+
    time_measure.h File Reference
    Tools and Utilities » Miscellaneous Tools » Time Measuring and Counting
    \n \n
    \n-
    #include <lemon/full_graph.h>
    \n-#include <lemon/smart_graph.h>
    \n-#include <lemon/kruskal.h>
    \n-#include <lemon/matching.h>
    \n-#include <lemon/euler.h>
    \n+
    #include <unistd.h>
    \n+#include <sys/times.h>
    \n+#include <sys/time.h>
    \n+#include <string>
    \n+#include <fstream>
    \n+#include <iostream>
    \n+#include <lemon/math.h>
    \n
    \n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  ChristofidesTsp< CM >
     Christofides algorithm for symmetric TSP. More...
    class  TimeStamp
     A class to store (cpu)time instances. More...
     
    class  Timer
     Class for measuring the cpu time and real time usage of the process. More...
     
    class  TimeReport
     Same as Timer but prints a report on destruction. More...
     
    class  NoTimeReport
     'Do nothing' version of TimeReport More...
     
    \n \n \n \n \n+

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n+\n+\n+\n+\n+\n

    \n+Functions

    template<class F >
    TimeStamp runningTimeTest (F f, double min_time=10, unsigned int *num=NULL, TimeStamp *full_time=NULL)
     Tool to measure the running time more exactly.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,27 +5,45 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces\n-christofides_tsp.h File Reference\n-Algorithms \u00bb Traveling_Salesman_Problem\n-#include \n-#include \n-#include \n-#include \n-#include \n+Classes | Namespaces | Functions\n+time_measure.h File Reference\n+Tools_and_Utilities \u00bb Miscellaneous_Tools \u00bb Time_Measuring_and_Counting\n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n Classes\n-class \u00a0ChristofidesTsp<_CM_>\n-\u00a0 Christofides algorithm for symmetric TSP. More...\n+class \u00a0TimeStamp\n+\u00a0 A class to store (cpu)time instances. More...\n+\u00a0\n+class \u00a0Timer\n+\u00a0 Class for measuring the cpu time and real time usage of the process.\n+ More...\n+\u00a0\n+class \u00a0TimeReport\n+\u00a0 Same as Timer but prints a report on destruction. More...\n+\u00a0\n+class \u00a0NoTimeReport\n+\u00a0 'Do nothing' version of TimeReport More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n+ Functions\n+template\n+TimeStamp\u00a0runningTimeTest (F f, double min_time=10, unsigned int *num=NULL,\n+ TimeStamp *full_time=NULL)\n+\u00a0 Tool to measure the running time more exactly.\n+\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00251.html", "source2": "./usr/share/doc/lemon/html/a00251.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/dimacs.h File Reference\n+My Project: lemon/pairing_heap.h File Reference\n \n \n \n \n \n \n \n@@ -71,66 +71,34 @@\n \n
    \n \n
    \n
    \n Classes |\n-Namespaces |\n-Functions
    \n-
    dimacs.h File Reference
    Input-Output » DIMACS Format
    \n+Namespaces
    \n+
    pairing_heap.h File Reference
    Data Structures » Heap Structures
    \n \n
    \n-
    #include <iostream>
    \n-#include <string>
    \n-#include <vector>
    \n-#include <limits>
    \n-#include <lemon/maps.h>
    \n-#include <lemon/error.h>
    \n+
    #include <vector>
    \n+#include <utility>
    \n+#include <functional>
    \n+#include <lemon/math.h>
    \n
    \n \n-\n-\n+\n+\n \n

    \n Classes

    struct  DimacsDescriptor
     DIMACS file type descriptor. More...
    class  PairingHeap< PR, IM, CMP >
     Pairing Heap. More...
     
    \n \n \n \n \n-

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n

    \n-Functions

    DimacsDescriptor dimacsType (std::istream &is)
     Discover the type of a DIMACS file.
     
    template<typename Digraph , typename LowerMap , typename CapacityMap , typename CostMap , typename SupplyMap >
    void readDimacsMin (std::istream &is, Digraph &g, LowerMap &lower, CapacityMap &capacity, CostMap &cost, SupplyMap &supply, typename CapacityMap::Value infty=0, DimacsDescriptor desc=DimacsDescriptor())
     DIMACS minimum cost flow reader function.
     
    template<typename Digraph , typename CapacityMap >
    void readDimacsMax (std::istream &is, Digraph &g, CapacityMap &capacity, typename Digraph::Node &s, typename Digraph::Node &t, typename CapacityMap::Value infty=0, DimacsDescriptor desc=DimacsDescriptor())
     DIMACS maximum flow reader function.
     
    template<typename Digraph , typename LengthMap >
    void readDimacsSp (std::istream &is, Digraph &g, LengthMap &length, typename Digraph::Node &s, DimacsDescriptor desc=DimacsDescriptor())
     DIMACS shortest path reader function.
     
    template<typename Digraph , typename CapacityMap >
    void readDimacsCap (std::istream &is, Digraph &g, CapacityMap &capacity, typename CapacityMap::Value infty=0, DimacsDescriptor desc=DimacsDescriptor())
     DIMACS capacitated digraph reader function.
     
    template<typename Graph >
    void readDimacsMat (std::istream &is, Graph &g, DimacsDescriptor desc=DimacsDescriptor())
     DIMACS plain (di)graph reader function.
     
    template<typename Digraph >
    void writeDimacsMat (std::ostream &os, const Digraph &g, std::string comment="")
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,68 +5,26 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces | Functions\n-dimacs.h File Reference\n-Input-Output \u00bb DIMACS_Format\n-#include \n-#include \n+Classes | Namespaces\n+pairing_heap.h File Reference\n+Data_Structures \u00bb Heap_Structures\n #include \n-#include \n-#include \n-#include \n+#include \n+#include \n+#include \n Classes\n-struct \u00a0DimacsDescriptor\n-\u00a0 DIMACS file type descriptor. More...\n+class \u00a0PairingHeap<_PR,_IM,_CMP_>\n+\u00a0 Pairing Heap. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n- Functions\n-DimacsDescriptor\u00a0dimacsType (std::istream &is)\n-\u00a0 Discover the type of a DIMACS file.\n-\u00a0\n-template\n- void\u00a0readDimacsMin (std::istream &is, Digraph &g, LowerMap &lower,\n- CapacityMap &capacity, CostMap &cost, SupplyMap &supply,\n- typename CapacityMap::Value infty=0, DimacsDescriptor\n- desc=DimacsDescriptor())\n-\u00a0 DIMACS minimum cost flow reader function.\n-\u00a0\n-template\n- void\u00a0readDimacsMax (std::istream &is, Digraph &g, CapacityMap\n- &capacity, typename Digraph::Node &s, typename Digraph::Node\n- &t, typename CapacityMap::Value infty=0, DimacsDescriptor\n- desc=DimacsDescriptor())\n-\u00a0 DIMACS maximum flow reader function.\n-\u00a0\n-template\n- void\u00a0readDimacsSp (std::istream &is, Digraph &g, LengthMap\n- &length, typename Digraph::Node &s, DimacsDescriptor\n- desc=DimacsDescriptor())\n-\u00a0 DIMACS shortest path reader function.\n-\u00a0\n-template\n- void\u00a0readDimacsCap (std::istream &is, Digraph &g, CapacityMap\n- &capacity, typename CapacityMap::Value infty=0,\n- DimacsDescriptor desc=DimacsDescriptor())\n-\u00a0 DIMACS capacitated digraph reader function.\n-\u00a0\n-template\n- void\u00a0readDimacsMat (std::istream &is, Graph &g, DimacsDescriptor\n- desc=DimacsDescriptor())\n-\u00a0 DIMACS plain (di)graph reader function.\n-\u00a0\n-template\n- void\u00a0writeDimacsMat (std::ostream &os, const Digraph &g, std::\n- string comment=\"\")\n-\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00254.html", "source2": "./usr/share/doc/lemon/html/a00254.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/arg_parser.h File Reference\n+My Project: lemon/gomory_hu.h File Reference\n \n \n \n \n \n \n \n@@ -72,36 +72,33 @@\n
  • lemon
    • \n
    \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    arg_parser.h File Reference
    Tools and Utilities » Miscellaneous Tools
    \n+
    gomory_hu.h File Reference
    Algorithms » Minimum Cut Algorithms
    \n
    \n
    \n-
    #include <vector>
    \n-#include <map>
    \n-#include <list>
    \n-#include <string>
    \n-#include <iostream>
    \n-#include <sstream>
    \n-#include <algorithm>
    \n-#include <lemon/assert.h>
    \n+
    #include <limits>
    \n+#include <lemon/core.h>
    \n+#include <lemon/preflow.h>
    \n+#include <lemon/concept_check.h>
    \n+#include <lemon/concepts/maps.h>
    \n
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Classes

    class  ArgParserException
     Exception used by ArgParser. More...
    class  GomoryHu< GR, CAP >
     Gomory-Hu cut tree algorithm. More...
     
    class  ArgParser
     Command line arguments parser. More...
    class  GomoryHu< GR, CAP >::MinCutNodeIt
     Iterate on the nodes of a minimum cut. More...
     
    class  ArgParser::RefType
     Magic type for operator[]. More...
    class  GomoryHu< GR, CAP >::MinCutEdgeIt
     Iterate on the edges of a minimum cut. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,33 +6,30 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-arg_parser.h File Reference\n-Tools_and_Utilities \u00bb Miscellaneous_Tools\n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n+gomory_hu.h File Reference\n+Algorithms \u00bb Minimum_Cut_Algorithms\n+#include \n+#include \n+#include \n+#include \n+#include \n Classes\n-class \u00a0ArgParserException\n-\u00a0 Exception used by ArgParser. More...\n+class \u00a0GomoryHu<_GR,_CAP_>\n+\u00a0 Gomory-Hu cut tree algorithm. More...\n \u00a0\n-class \u00a0ArgParser\n-\u00a0 Command line arguments parser. More...\n+class \u00a0GomoryHu<_GR,_CAP_>::MinCutNodeIt\n+\u00a0 Iterate on the nodes of a minimum cut. More...\n \u00a0\n-class \u00a0ArgParser::RefType\n-\u00a0 Magic type for operator[]. More...\n+class \u00a0GomoryHu<_GR,_CAP_>::MinCutEdgeIt\n+\u00a0 Iterate on the edges of a minimum cut. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00257.html", "source2": "./usr/share/doc/lemon/html/a00257.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/capacity_scaling.h File Reference\n+My Project: lemon/static_graph.h File Reference\n \n \n \n \n \n \n \n@@ -72,33 +72,24 @@\n
  • lemon
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    capacity_scaling.h File Reference
    Algorithms » Minimum Cost Flow Algorithms
    \n+
    static_graph.h File Reference
    Data Structures » Graph Structures
    \n
    \n
    \n-
    #include <vector>
    \n-#include <limits>
    \n-#include <lemon/core.h>
    \n-#include <lemon/maps.h>
    \n-#include <lemon/bin_heap.h>
    \n+
    #include <lemon/core.h>
    \n+#include <lemon/bits/graph_extender.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    struct  CapacityScalingDefaultTraits< GR, V, C >
     Default traits class of CapacityScaling algorithm. More...
     
    class  CapacityScaling< GR, V, C, TR >
     Implementation of the Capacity Scaling algorithm for finding a minimum cost flow. More...
     
    struct  CapacityScaling< GR, V, C, TR >::SetHeap< T >
     Named parameter for setting Heap type. More...
    class  StaticDigraph
     A static directed graph class. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,31 +6,21 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-capacity_scaling.h File Reference\n-Algorithms \u00bb Minimum_Cost_Flow_Algorithms\n-#include \n-#include \n+static_graph.h File Reference\n+Data_Structures \u00bb Graph_Structures\n #include \n-#include \n-#include \n+#include \n Classes\n-struct \u00a0CapacityScalingDefaultTraits<_GR,_V,_C_>\n-\u00a0 Default traits class of CapacityScaling algorithm. More...\n-\u00a0\n- class \u00a0CapacityScaling<_GR,_V,_C,_TR_>\n-\u00a0 Implementation of the Capacity Scaling algorithm for finding a minimum\n- cost_flow. More...\n-\u00a0\n-struct \u00a0CapacityScaling<_GR,_V,_C,_TR_>::SetHeap<_T_>\n-\u00a0 Named_parameter for setting Heap type. More...\n+class \u00a0StaticDigraph\n+\u00a0 A static directed graph class. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00260.html", "source2": "./usr/share/doc/lemon/html/a00260.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/soplex.cc File Reference\n+My Project: lemon/cost_scaling.h File Reference\n \n \n \n \n \n \n \n@@ -70,22 +70,41 @@\n
    \n \n
    \n \n
    \n
    \n+Classes |\n Namespaces
    \n-
    soplex.cc File Reference
    \n+
    cost_scaling.h File Reference
    Algorithms » Minimum Cost Flow Algorithms
    \n
    \n
    \n-
    #include <iostream>
    \n-#include <lemon/soplex.h>
    \n-#include <spxout.h>
    \n+
    #include <vector>
    \n+#include <deque>
    \n+#include <limits>
    \n+#include <lemon/core.h>
    \n+#include <lemon/maps.h>
    \n+#include <lemon/math.h>
    \n+#include <lemon/static_graph.h>
    \n+#include <lemon/circulation.h>
    \n+#include <lemon/bellman_ford.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+

    \n+Classes

    struct  CostScalingDefaultTraits< GR, V, C >
     Default traits class of CostScaling algorithm. More...
     
    class  CostScaling< GR, V, C, TR >
     Implementation of the Cost Scaling algorithm for finding a minimum cost flow. More...
     
    struct  CostScaling< GR, V, C, TR >::SetLargeCost< T >
     Named parameter for setting LargeCost type. More...
     
    \n \n \n \n \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n
    \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,19 +5,37 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Namespaces\n-soplex.cc File Reference\n-#include \n-#include \n-#include \n+Classes | Namespaces\n+cost_scaling.h File Reference\n+Algorithms \u00bb Minimum_Cost_Flow_Algorithms\n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+ Classes\n+struct \u00a0CostScalingDefaultTraits<_GR,_V,_C_>\n+\u00a0 Default traits class of CostScaling algorithm. More...\n+\u00a0\n+ class \u00a0CostScaling<_GR,_V,_C,_TR_>\n+\u00a0 Implementation of the Cost Scaling algorithm for finding a minimum\n+ cost_flow. More...\n+\u00a0\n+struct \u00a0CostScaling<_GR,_V,_C,_TR_>::SetLargeCost<_T_>\n+\u00a0 Named_parameter for setting LargeCost type. More...\n+\u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00263.html", "source2": "./usr/share/doc/lemon/html/a00263.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/graph_to_eps.h File Reference\n+My Project: lemon/core.h File Reference\n \n \n \n \n \n \n \n@@ -72,62 +72,147 @@\n
  • lemon
    • \n
    \n \n
    \n
    \n Classes |\n Namespaces |\n+Macros |\n Functions
    \n-
    graph_to_eps.h File Reference
    Input-Output » Postscript Exporting
    \n+
    core.h File Reference
    \n
    \n
    \n-
    #include <iostream>
    \n-#include <fstream>
    \n-#include <sstream>
    \n+

    Detailed Description

    \n+

    This header file contains core utilities for LEMON. It is automatically included by all graph types, therefore it usually do not have to be included directly.

    \n+
    #include <vector>
    \n #include <algorithm>
    \n-#include <vector>
    \n-#include <sys/time.h>
    \n-#include <ctime>
    \n-#include <lemon/math.h>
    \n-#include <lemon/core.h>
    \n-#include <lemon/dim2.h>
    \n-#include <lemon/maps.h>
    \n-#include <lemon/color.h>
    \n-#include <lemon/bits/bezier.h>
    \n-#include <lemon/error.h>
    \n+#include <lemon/config.h>
    \n+#include <lemon/bits/enable_if.h>
    \n+#include <lemon/bits/traits.h>
    \n+#include <lemon/assert.h>
    \n
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    struct  DefaultGraphToEpsTraits< GR >
     Default traits class of GraphToEps. More...
    struct  Invalid
     Dummy type to make it easier to create invalid iterators. More...
     
    class  GraphToEps< T >
     Auxiliary class to implement the named parameters of graphToEps() More...
    class  DigraphCopy< From, To >
     Class to copy a digraph. More...
     
    class  GraphCopy< From, To >
     Class to copy a graph. More...
     
    class  BpGraphCopy< From, To >
     Class to copy a bipartite graph. More...
     
    class  ConArcIt< GR >
     Iterator for iterating on parallel arcs connecting the same nodes. More...
     
    class  ConEdgeIt< GR >
     Iterator for iterating on parallel edges connecting the same nodes. More...
     
    class  DynArcLookUp< GR >
     Dynamic arc look-up between given endpoints. More...
     
    class  ArcLookUp< GR >
     Fast arc look-up between given endpoints. More...
     
    class  AllArcLookUp< GR >
     Fast look-up of all arcs between given endpoints. More...
     
    \n \n \n \n \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+

    \n+Macros

    #define DIGRAPH_TYPEDEFS(Digraph)
     Create convenience typedefs for the digraph types and iterators.
     
    #define TEMPLATE_DIGRAPH_TYPEDEFS(Digraph)
     Create convenience typedefs for the digraph types and iterators.
     
    #define GRAPH_TYPEDEFS(Graph)
     Create convenience typedefs for the graph types and iterators.
     
    #define TEMPLATE_GRAPH_TYPEDEFS(Graph)
     Create convenience typedefs for the graph types and iterators.
     
    #define BPGRAPH_TYPEDEFS(BpGraph)
     Create convenience typedefs for the bipartite graph types and iterators.
     
    #define TEMPLATE_BPGRAPH_TYPEDEFS(BpGraph)
     Create convenience typedefs for the bipartite graph types and iterators.
     
    \n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n

    \n Functions

    template<class GR >
    GraphToEps< DefaultGraphToEpsTraits< GR > > graphToEps (GR &g, std::ostream &os=std::cout)
     Generates an EPS file from a graph.
     
    template<class GR >
    GraphToEps< DefaultGraphToEpsTraits< GR > > graphToEps (GR &g, const char *file_name)
     Generates an EPS file from a graph.
     
    template<class GR >
    GraphToEps< DefaultGraphToEpsTraits< GR > > graphToEps (GR &g, const std::string &file_name)
     Generates an EPS file from a graph.
     
    template<typename Graph , typename Item >
    int countItems (const Graph &g)
     Function to count the items in a graph.
     
    template<typename Graph >
    int countNodes (const Graph &g)
     Function to count the nodes in the graph.
     
    template<typename Graph >
    int countRedNodes (const Graph &g)
     Function to count the red nodes in the graph.
     
    template<typename Graph >
    int countBlueNodes (const Graph &g)
     Function to count the blue nodes in the graph.
     
    template<typename Graph >
    int countArcs (const Graph &g)
     Function to count the arcs in the graph.
     
    template<typename Graph >
    int countEdges (const Graph &g)
     Function to count the edges in the graph.
     
    template<typename Graph >
    int countOutArcs (const Graph &g, const typename Graph::Node &n)
     Function to count the number of the out-arcs from node n.
     
    template<typename Graph >
    int countInArcs (const Graph &g, const typename Graph::Node &n)
     Function to count the number of the in-arcs to node n.
     
    template<typename Graph >
    int countIncEdges (const Graph &g, const typename Graph::Node &n)
     Function to count the number of the inc-edges to node n.
     
    template<typename GR >
    bool undirected (const GR &g)
     Check whether a graph is undirected.
     
    template<typename From , typename To >
    DigraphCopy< From, To > digraphCopy (const From &from, To &to)
     Copy a digraph to another digraph.
     
    template<typename From , typename To >
    GraphCopy< From, To > graphCopy (const From &from, To &to)
     Copy a graph to another graph.
     
    template<typename From , typename To >
    BpGraphCopy< From, To > bpGraphCopy (const From &from, To &to)
     Copy a graph to another graph.
     
    template<typename Graph >
    Graph::Arc findArc (const Graph &g, typename Graph::Node u, typename Graph::Node v, typename Graph::Arc prev=INVALID)
     Find an arc between two nodes of a digraph.
     
    template<typename Graph >
    Graph::Edge findEdge (const Graph &g, typename Graph::Node u, typename Graph::Node v, typename Graph::Edge p=INVALID)
     Find an edge between two nodes of a graph.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,56 +5,149 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces | Functions\n-graph_to_eps.h File Reference\n-Input-Output \u00bb Postscript_Exporting\n-#include \n-#include \n-#include \n-#include \n+Classes | Namespaces | Macros | Functions\n+core.h File Reference\n+***** Detailed Description *****\n+This header file contains core utilities for LEMON. It is automatically\n+included by all graph types, therefore it usually do not have to be included\n+directly.\n #include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n+#include \n+#include \n+#include \n+#include \n+#include \n Classes\n-struct \u00a0DefaultGraphToEpsTraits<_GR_>\n-\u00a0 Default traits class of GraphToEps. More...\n+struct \u00a0Invalid\n+\u00a0 Dummy type to make it easier to create invalid iterators. More...\n+\u00a0\n+ class \u00a0DigraphCopy<_From,_To_>\n+\u00a0 Class to copy a digraph. More...\n+\u00a0\n+ class \u00a0GraphCopy<_From,_To_>\n+\u00a0 Class to copy a graph. More...\n+\u00a0\n+ class \u00a0BpGraphCopy<_From,_To_>\n+\u00a0 Class to copy a bipartite graph. More...\n+\u00a0\n+ class \u00a0ConArcIt<_GR_>\n+\u00a0 Iterator for iterating on parallel arcs connecting the same nodes.\n+ More...\n \u00a0\n- class \u00a0GraphToEps<_T_>\n-\u00a0 Auxiliary class to implement the named parameters of graphToEps()\n+ class \u00a0ConEdgeIt<_GR_>\n+\u00a0 Iterator for iterating on parallel edges connecting the same nodes.\n More...\n \u00a0\n+ class \u00a0DynArcLookUp<_GR_>\n+\u00a0 Dynamic arc look-up between given endpoints. More...\n+\u00a0\n+ class \u00a0ArcLookUp<_GR_>\n+\u00a0 Fast arc look-up between given endpoints. More...\n+\u00a0\n+ class \u00a0AllArcLookUp<_GR_>\n+\u00a0 Fast look-up of all arcs between given endpoints. More...\n+\u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n+ Macros\n+#define\u00a0DIGRAPH_TYPEDEFS(Digraph)\n+\u00a0 Create convenience typedefs for the digraph types and iterators.\n+\u00a0\n+#define\u00a0TEMPLATE_DIGRAPH_TYPEDEFS(Digraph)\n+\u00a0 Create convenience typedefs for the digraph types and iterators.\n+\u00a0\n+#define\u00a0GRAPH_TYPEDEFS(Graph)\n+\u00a0 Create convenience typedefs for the graph types and iterators.\n+\u00a0\n+#define\u00a0TEMPLATE_GRAPH_TYPEDEFS(Graph)\n+\u00a0 Create convenience typedefs for the graph types and iterators.\n+\u00a0\n+#define\u00a0BPGRAPH_TYPEDEFS(BpGraph)\n+\u00a0 Create convenience typedefs for the bipartite graph types and\n+ iterators.\n+\u00a0\n+#define\u00a0TEMPLATE_BPGRAPH_TYPEDEFS(BpGraph)\n+\u00a0 Create convenience typedefs for the bipartite graph types and\n+ iterators.\n+\u00a0\n Functions\n-template\n-GraphToEps< DefaultGraphToEpsTraits< GR graphToEps (GR &g, std::ostream\n- > >\u00a0&os=std::cout)\n-\u00a0 Generates an EPS file from a graph.\n-\u00a0\n-template\n-GraphToEps< DefaultGraphToEpsTraits< GR graphToEps (GR &g, const char\n- > >\u00a0*file_name)\n-\u00a0 Generates an EPS file from a graph.\n-\u00a0\n-template\n-GraphToEps< DefaultGraphToEpsTraits< GR graphToEps (GR &g, const std::string\n- > >\u00a0&file_name)\n-\u00a0 Generates an EPS file from a graph.\n+template\n+ int\u00a0countItems (const Graph &g)\n+\u00a0 Function to count the items in a graph.\n+\u00a0\n+template\n+ int\u00a0countNodes (const Graph &g)\n+\u00a0 Function to count the nodes in the graph.\n+\u00a0\n+template\n+ int\u00a0countRedNodes (const Graph &g)\n+\u00a0 Function to count the red nodes in the graph.\n+\u00a0\n+template\n+ int\u00a0countBlueNodes (const Graph &g)\n+\u00a0 Function to count the blue nodes in the graph.\n+\u00a0\n+template\n+ int\u00a0countArcs (const Graph &g)\n+\u00a0 Function to count the arcs in the graph.\n+\u00a0\n+template\n+ int\u00a0countEdges (const Graph &g)\n+\u00a0 Function to count the edges in the graph.\n+\u00a0\n+template\n+ int\u00a0countOutArcs (const Graph &g, const typename Graph::\n+ Node &n)\n+\u00a0 Function to count the number of the out-arcs from node\n+ n.\n+\u00a0\n+template\n+ int\u00a0countInArcs (const Graph &g, const typename Graph::\n+ Node &n)\n+\u00a0 Function to count the number of the in-arcs to node n.\n+\n+\u00a0\n+template\n+ int\u00a0countIncEdges (const Graph &g, const typename Graph::\n+ Node &n)\n+\u00a0 Function to count the number of the inc-edges to node\n+ n.\n+\u00a0\n+template\n+ bool\u00a0undirected (const GR &g)\n+\u00a0 Check whether a graph is undirected.\n+\u00a0\n+template\n+DigraphCopy< From, To >\u00a0digraphCopy (const From &from, To &to)\n+\u00a0 Copy a digraph to another digraph.\n+\u00a0\n+template\n+ GraphCopy< From, To >\u00a0graphCopy (const From &from, To &to)\n+\u00a0 Copy a graph to another graph.\n+\u00a0\n+template\n+BpGraphCopy< From, To >\u00a0bpGraphCopy (const From &from, To &to)\n+\u00a0 Copy a graph to another graph.\n+\u00a0\n+template\n+ Graph::Arc\u00a0findArc (const Graph &g, typename Graph::Node u,\n+ typename Graph::Node v, typename Graph::Arc\n+ prev=INVALID)\n+\u00a0 Find an arc between two nodes of a digraph.\n+\u00a0\n+template\n+ Graph::Edge\u00a0findEdge (const Graph &g, typename Graph::Node u,\n+ typename Graph::Node v, typename Graph::Edge\n+ p=INVALID)\n+\u00a0 Find an edge between two nodes of a graph.\n \u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00266.html", "source2": "./usr/share/doc/lemon/html/a00266.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/path.h File Reference\n+My Project: lemon/hypercube_graph.h File Reference\n \n \n \n \n \n \n \n@@ -71,83 +71,37 @@\n \n
    \n \n
    \n
    \n Classes |\n-Namespaces |\n-Functions
    \n-
    path.h File Reference
    Data Structures » Path Structures
    \n+Namespaces
    \n+
    hypercube_graph.h File Reference
    Data Structures » Graph Structures
    \n \n
    \n
    #include <vector>
    \n-#include <algorithm>
    \n-#include <lemon/error.h>
    \n-#include <lemon/core.h>
    \n-#include <lemon/concepts/path.h>
    \n+#include <lemon/core.h>
    \n+#include <lemon/assert.h>
    \n+#include <lemon/bits/graph_extender.h>
    \n
    \n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    class  Path< GR >
     A structure for representing directed paths in a digraph. More...
    class  HypercubeGraph
     Hypercube graph class. More...
     
    class  Path< GR >::ArcIt
     LEMON style iterator for path arcs. More...
     
    class  SimplePath< GR >
     A structure for representing directed paths in a digraph. More...
     
    class  SimplePath< GR >::ArcIt
     Iterator class to iterate on the arcs of the paths. More...
     
    class  ListPath< GR >
     A structure for representing directed paths in a digraph. More...
     
    class  ListPath< GR >::ArcIt
     Iterator class to iterate on the arcs of the paths. More...
     
    class  StaticPath< GR >
     A structure for representing directed paths in a digraph. More...
     
    class  StaticPath< GR >::ArcIt
     Iterator class to iterate on the arcs of the paths. More...
     
    class  PathNodeIt< Path >
     Class which helps to iterate through the nodes of a path. More...
    class  HypercubeGraph::HyperMap< T, BF >
     Linear combination map. More...
     
    \n \n \n \n \n-

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n

    \n-Functions

    template<typename From , typename To >
    void pathCopy (const From &from, To &to)
     Make a copy of a path.
     
    template<typename To , typename From >
    void copyPath (To &to, const From &from)
     Deprecated version of pathCopy().
     
    template<typename Digraph , typename Path >
    bool checkPath (const Digraph &digraph, const Path &path)
     Check the consistency of a path.
     
    template<typename Digraph , typename Path >
    Digraph::Node pathSource (const Digraph &digraph, const Path &path)
     The source of a path.
     
    template<typename Digraph , typename Path >
    Digraph::Node pathTarget (const Digraph &digraph, const Path &path)
     The target of a path.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,72 +5,29 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces | Functions\n-path.h File Reference\n-Data_Structures \u00bb Path_Structures\n+Classes | Namespaces\n+hypercube_graph.h File Reference\n+Data_Structures \u00bb Graph_Structures\n #include \n-#include \n-#include \n #include \n-#include \n+#include \n+#include \n Classes\n-class \u00a0Path<_GR_>\n-\u00a0 A structure for representing directed paths in a digraph. More...\n+class \u00a0HypercubeGraph\n+\u00a0 Hypercube graph class. More...\n \u00a0\n-class \u00a0Path<_GR_>::ArcIt\n-\u00a0 LEMON style iterator for path arcs. More...\n-\u00a0\n-class \u00a0SimplePath<_GR_>\n-\u00a0 A structure for representing directed paths in a digraph. More...\n-\u00a0\n-class \u00a0SimplePath<_GR_>::ArcIt\n-\u00a0 Iterator class to iterate on the arcs of the paths. More...\n-\u00a0\n-class \u00a0ListPath<_GR_>\n-\u00a0 A structure for representing directed paths in a digraph. More...\n-\u00a0\n-class \u00a0ListPath<_GR_>::ArcIt\n-\u00a0 Iterator class to iterate on the arcs of the paths. More...\n-\u00a0\n-class \u00a0StaticPath<_GR_>\n-\u00a0 A structure for representing directed paths in a digraph. More...\n-\u00a0\n-class \u00a0StaticPath<_GR_>::ArcIt\n-\u00a0 Iterator class to iterate on the arcs of the paths. More...\n-\u00a0\n-class \u00a0PathNodeIt<_Path_>\n-\u00a0 Class which helps to iterate through the nodes of a path. More...\n+class \u00a0HypercubeGraph::HyperMap<_T,_BF_>\n+\u00a0 Linear combination map. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n- Functions\n-template\n- void\u00a0pathCopy (const From &from, To &to)\n-\u00a0 Make a copy of a path.\n-\u00a0\n-template\n- void\u00a0copyPath (To &to, const From &from)\n-\u00a0 Deprecated version of pathCopy().\n-\u00a0\n-template\n- bool\u00a0checkPath (const Digraph &digraph, const Path &path)\n-\u00a0 Check the consistency of a path.\n-\u00a0\n-template\n-Digraph::Node\u00a0pathSource (const Digraph &digraph, const Path &path)\n-\u00a0 The source of a path.\n-\u00a0\n-template\n-Digraph::Node\u00a0pathTarget (const Digraph &digraph, const Path &path)\n-\u00a0 The target of a path.\n-\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00269.html", "source2": "./usr/share/doc/lemon/html/a00269.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/lp_skeleton.h File Reference\n+My Project: lemon/greedy_tsp.h File Reference\n \n \n \n \n \n \n \n@@ -72,31 +72,26 @@\n
  • lemon
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    lp_skeleton.h File Reference
    \n+
    greedy_tsp.h File Reference
    Algorithms » Traveling Salesman Problem
    \n
    \n
    \n-

    Detailed Description

    \n-

    The classes in this file do nothing, but they can serve as skeletons when implementing an interface to new solvers.

    \n-
    #include <lemon/lp_base.h>
    \n+
    #include <vector>
    \n+#include <algorithm>
    \n+#include <lemon/full_graph.h>
    \n+#include <lemon/unionfind.h>
    \n
    \n \n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    class  SkeletonSolverBase
     A skeleton class to implement LP/MIP solver base interface. More...
     
    class  LpSkeleton
     Skeleton class for an LP solver interface. More...
     
    class  MipSkeleton
     Skeleton class for a MIP solver interface. More...
    class  GreedyTsp< CM >
     Greedy algorithm for symmetric TSP. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,28 +6,23 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-lp_skeleton.h File Reference\n-***** Detailed Description *****\n-The classes in this file do nothing, but they can serve as skeletons when\n-implementing an interface to new solvers.\n-#include \n+greedy_tsp.h File Reference\n+Algorithms \u00bb Traveling_Salesman_Problem\n+#include \n+#include \n+#include \n+#include \n Classes\n-class \u00a0SkeletonSolverBase\n-\u00a0 A skeleton class to implement LP/MIP solver base interface. More...\n-\u00a0\n-class \u00a0LpSkeleton\n-\u00a0 Skeleton class for an LP solver interface. More...\n-\u00a0\n-class \u00a0MipSkeleton\n-\u00a0 Skeleton class for a MIP solver interface. More...\n+class \u00a0GreedyTsp<_CM_>\n+\u00a0 Greedy algorithm for symmetric TSP. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00272.html", "source2": "./usr/share/doc/lemon/html/a00272.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/radix_sort.h File Reference\n+My Project: lemon/full_graph.h File Reference\n \n \n \n \n \n \n \n@@ -70,42 +70,39 @@\n
    \n \n
    \n \n
    \n
    \n-Namespaces |\n-Functions
    \n-
    radix_sort.h File Reference
    Algorithms » Auxiliary Algorithms
    \n+Classes |\n+Namespaces
    \n+
    full_graph.h File Reference
    Data Structures » Graph Structures
    \n \n
    \n-

    Detailed Description

    \n-

    Linear time sorting algorithms

    \n-
    #include <vector>
    \n-#include <limits>
    \n-#include <iterator>
    \n-#include <algorithm>
    \n+
    #include <lemon/core.h>
    \n+#include <lemon/bits/graph_extender.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+

    \n+Classes

    class  FullDigraph
     A directed full graph class. More...
     
    class  FullGraph
     An undirected full graph class. More...
     
    class  FullBpGraph
     An undirected full bipartite graph class. More...
     
    \n \n \n \n \n-

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n-\n-\n-\n-\n

    \n-Functions

    template<typename Iterator , typename Functor >
    void radixSort (Iterator first, Iterator last, Functor functor)
     Sorts the STL compatible range into ascending order.
     
    template<typename Iterator , typename Functor >
    void stableRadixSort (Iterator first, Iterator last, Functor functor)
     Sorts the STL compatible range into ascending order in a stable way.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,33 +5,30 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Namespaces | Functions\n-radix_sort.h File Reference\n-Algorithms \u00bb Auxiliary_Algorithms\n-***** Detailed Description *****\n-Linear time sorting algorithms\n-#include \n-#include \n-#include \n-#include \n+Classes | Namespaces\n+full_graph.h File Reference\n+Data_Structures \u00bb Graph_Structures\n+#include \n+#include \n+ Classes\n+class \u00a0FullDigraph\n+\u00a0 A directed full graph class. More...\n+\u00a0\n+class \u00a0FullGraph\n+\u00a0 An undirected full graph class. More...\n+\u00a0\n+class \u00a0FullBpGraph\n+\u00a0 An undirected full bipartite graph class. More...\n+\u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n- Functions\n-template\n-void\u00a0radixSort (Iterator first, Iterator last, Functor functor)\n-\u00a0 Sorts the STL compatible range into ascending order.\n-\u00a0\n-template\n-void\u00a0stableRadixSort (Iterator first, Iterator last, Functor functor)\n-\u00a0 Sorts the STL compatible range into ascending order in a stable way.\n-\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00275.html", "source2": "./usr/share/doc/lemon/html/a00275.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/base.cc File Reference\n+My Project: lemon/random.h File Reference\n \n \n \n \n \n \n \n@@ -70,34 +70,42 @@\n
    \n \n
    \n
    \n
    \n
    \n-Namespaces |\n-Variables
    \n-
    base.cc File Reference
    \n+Classes |\n+Namespaces
    \n+
    random.h File Reference
    Tools and Utilities » Miscellaneous Tools
    \n \n
    \n-
    #include <lemon/tolerance.h>
    \n-#include <lemon/core.h>
    \n-#include <lemon/time_measure.h>
    \n+
    #include <algorithm>
    \n+#include <iterator>
    \n+#include <vector>
    \n+#include <limits>
    \n+#include <fstream>
    \n+#include <lemon/math.h>
    \n+#include <lemon/dim2.h>
    \n+#include <sys/time.h>
    \n+#include <ctime>
    \n+#include <sys/types.h>
    \n+#include <unistd.h>
    \n
    \n+\n+\n+\n+\n+

    \n+Classes

    class  Random
     Mersenne Twister random number generator. More...
     
    \n \n \n \n \n-

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n

    \n-Variables

    const Invalid INVALID = Invalid()
     Invalid iterators.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,24 +5,33 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Namespaces | Variables\n-base.cc File Reference\n-#include \n-#include \n-#include \n+Classes | Namespaces\n+random.h File Reference\n+Tools_and_Utilities \u00bb Miscellaneous_Tools\n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+ Classes\n+class \u00a0Random\n+\u00a0 Mersenne Twister random number generator. More...\n+\u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n- Variables\n-const Invalid\u00a0INVALID = Invalid()\n-\u00a0 Invalid iterators.\n-\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00278.html", "source2": "./usr/share/doc/lemon/html/a00278.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/error.h File Reference\n+My Project: lemon/nagamochi_ibaraki.h File Reference\n \n \n \n \n \n \n \n@@ -72,34 +72,41 @@\n
  • lemon
    • \n
    \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    error.h File Reference
    Tools and Utilities » Exceptions
    \n+
    nagamochi_ibaraki.h File Reference
    Algorithms » Minimum Cut Algorithms
    \n
    \n
    \n-
    #include <exception>
    \n-#include <string>
    \n-#include <sstream>
    \n-#include <iostream>
    \n-#include <cstdlib>
    \n-#include <memory>
    \n+
    #include <lemon/core.h>
    \n+#include <lemon/bin_heap.h>
    \n+#include <lemon/bucket_heap.h>
    \n+#include <lemon/maps.h>
    \n+#include <lemon/radix_sort.h>
    \n+#include <lemon/unionfind.h>
    \n+#include <cassert>
    \n
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  Exception
     Generic exception class. More...
    struct  NagamochiIbarakiDefaultTraits< GR, CM >
     Default traits class for NagamochiIbaraki class. More...
     
    class  IoError
     Input-Output error. More...
    class  NagamochiIbaraki< GR, CM, TR >
     Calculates the minimum cut in an undirected graph. More...
     
    class  FormatError
     Format error. More...
    struct  NagamochiIbaraki< GR, CM, TR >::SetUnitCapacity
     Named parameter for setting the capacity map to a constMap<Edge, int, 1>() instance More...
     
    struct  NagamochiIbaraki< GR, CM, TR >::SetHeap< H, CR >
     Named parameter for setting heap and cross reference type More...
     
    struct  NagamochiIbaraki< GR, CM, TR >::SetStandardHeap< H, CR >
     Named parameter for setting heap and cross reference type with automatic allocation More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,31 +6,40 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-error.h File Reference\n-Tools_and_Utilities \u00bb Exceptions\n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n+nagamochi_ibaraki.h File Reference\n+Algorithms \u00bb Minimum_Cut_Algorithms\n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n Classes\n-class \u00a0Exception\n-\u00a0 Generic exception class. More...\n+struct \u00a0NagamochiIbarakiDefaultTraits<_GR,_CM_>\n+\u00a0 Default traits class for NagamochiIbaraki class. More...\n \u00a0\n-class \u00a0IoError\n-\u00a0 Input-Output error. More...\n+ class \u00a0NagamochiIbaraki<_GR,_CM,_TR_>\n+\u00a0 Calculates the minimum cut in an undirected graph. More...\n \u00a0\n-class \u00a0FormatError\n-\u00a0 Format error. More...\n+struct \u00a0NagamochiIbaraki<_GR,_CM,_TR_>::SetUnitCapacity\n+\u00a0 Named_parameter for setting the capacity map to a constMap() instance More...\n+\u00a0\n+struct \u00a0NagamochiIbaraki<_GR,_CM,_TR_>::SetHeap<_H,_CR_>\n+\u00a0 Named_parameter for setting heap and cross reference type More...\n+\u00a0\n+struct \u00a0NagamochiIbaraki<_GR,_CM,_TR_>::SetStandardHeap<_H,_CR_>\n+\u00a0 Named_parameter for setting heap and cross reference type with\n+ automatic allocation More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00281.html", "source2": "./usr/share/doc/lemon/html/a00281.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/dim2.h File Reference\n+My Project: lemon/soplex.h File Reference\n \n \n \n \n \n \n \n@@ -72,52 +72,32 @@\n
  • lemon
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    dim2.h File Reference
    Data Structures » Auxiliary Data Structures » Geometric Data Structures
    \n+
    soplex.h File Reference
    \n
    \n
    \n-
    #include <iostream>
    \n-#include <algorithm>
    \n+
    #include <vector>
    \n+#include <string>
    \n+#include <lemon/lp_base.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    class  Point< T >
     Two dimensional vector (plain vector) More...
     
    class  Box< T >
     Bounding box of plain vectors (points). More...
     
    class  XMap< M >
     Map of x-coordinates of a Point-map. More...
     
    class  ConstXMap< M >
     Constant (read only) version of XMap. More...
     
    class  YMap< M >
     Map of y-coordinates of a Point-map. More...
     
    class  ConstYMap< M >
     Constant (read only) version of YMap. More...
     
    class  NormSquareMap< M >
     Map of the normSquare() of a Point-map. More...
    class  SoplexLp
     Interface for the SOPLEX solver. More...
     
    \n \n \n \n \n-\n-\n-\n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    namespace  lemon::dim2
     Tools for handling two dimensional coordinates.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,44 +6,23 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-dim2.h File Reference\n-Data_Structures \u00bb Auxiliary_Data_Structures \u00bb Geometric_Data_Structures\n-#include \n-#include \n+soplex.h File Reference\n+#include \n+#include \n+#include \n Classes\n-class \u00a0Point<_T_>\n-\u00a0 Two dimensional vector (plain vector) More...\n-\u00a0\n-class \u00a0Box<_T_>\n-\u00a0 Bounding box of plain vectors (points). More...\n-\u00a0\n-class \u00a0XMap<_M_>\n-\u00a0 Map of x-coordinates of a Point-map. More...\n-\u00a0\n-class \u00a0ConstXMap<_M_>\n-\u00a0 Constant (read only) version of XMap. More...\n-\u00a0\n-class \u00a0YMap<_M_>\n-\u00a0 Map of y-coordinates of a Point-map. More...\n-\u00a0\n-class \u00a0ConstYMap<_M_>\n-\u00a0 Constant (read only) version of YMap. More...\n-\u00a0\n-class \u00a0NormSquareMap<_M_>\n-\u00a0 Map of the normSquare() of a Point-map. More...\n+class \u00a0SoplexLp\n+\u00a0 Interface for the SOPLEX solver. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n-namespace \u00a0lemon::dim2\n-\u00a0 Tools for handling two dimensional coordinates.\n-\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00284.html", "source2": "./usr/share/doc/lemon/html/a00284.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/bin_heap.h File Reference\n+My Project: lemon/dheap.h File Reference\n \n \n \n \n \n \n \n@@ -72,25 +72,25 @@\n
  • lemon
    • \n
    \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    bin_heap.h File Reference
    Data Structures » Heap Structures
    \n+
    dheap.h File Reference
    Data Structures » Heap Structures
    \n
    \n
    \n
    #include <vector>
    \n #include <utility>
    \n #include <functional>
    \n
    \n \n-\n-\n+\n+\n \n

    \n Classes

    class  BinHeap< PR, IM, CMP >
     Binary heap data structure. More...
    class  DHeap< PR, IM, D, CMP >
     D-ary heap data structure. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,22 +6,22 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-bin_heap.h File Reference\n+dheap.h File Reference\n Data_Structures \u00bb Heap_Structures\n #include \n #include \n #include \n Classes\n-class \u00a0BinHeap<_PR,_IM,_CMP_>\n-\u00a0 Binary heap data structure. More...\n+class \u00a0DHeap<_PR,_IM,_D,_CMP_>\n+\u00a0 D-ary heap data structure. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00287.html", "source2": "./usr/share/doc/lemon/html/a00287.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/static_graph.h File Reference\n+My Project: lemon/dfs.h File Reference\n \n \n \n \n \n \n \n@@ -71,32 +71,83 @@\n \n \n \n
    \n
    \n Classes |\n-Namespaces
    \n-
    static_graph.h File Reference
    Data Structures » Graph Structures
    \n+Namespaces |\n+Functions
    \n+
    dfs.h File Reference
    Algorithms » Graph Search
    \n \n
    \n-
    #include <lemon/core.h>
    \n-#include <lemon/bits/graph_extender.h>
    \n+
    #include <lemon/list_graph.h>
    \n+#include <lemon/bits/path_dump.h>
    \n+#include <lemon/core.h>
    \n+#include <lemon/error.h>
    \n+#include <lemon/maps.h>
    \n+#include <lemon/path.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  StaticDigraph
     A static directed graph class. More...
    struct  DfsDefaultTraits< GR >
     Default traits class of Dfs class. More...
     
    class  Dfs< GR, TR >
     DFS algorithm class. More...
     
    struct  Dfs< GR, TR >::SetPredMap< T >
     Named parameter for setting PredMap type. More...
     
    struct  Dfs< GR, TR >::SetDistMap< T >
     Named parameter for setting DistMap type. More...
     
    struct  Dfs< GR, TR >::SetReachedMap< T >
     Named parameter for setting ReachedMap type. More...
     
    struct  Dfs< GR, TR >::SetProcessedMap< T >
     Named parameter for setting ProcessedMap type. More...
     
    struct  Dfs< GR, TR >::SetStandardProcessedMap
     Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool>. More...
     
    struct  DfsWizardDefaultTraits< GR >
     Default traits class of dfs() function. More...
     
    class  DfsWizardBase< GR >
     Default traits class used by DfsWizard. More...
     
    class  DfsWizard< TR >
     Auxiliary class for the function-type interface of DFS algorithm. More...
     
    struct  DfsVisitor< GR >
     Visitor class for DFS. More...
     
    struct  DfsVisitDefaultTraits< GR >
     Default traits class of DfsVisit class. More...
     
    class  DfsVisit< GR, VS, TR >
     DFS algorithm class with visitor interface. More...
     
    struct  DfsVisit< GR, VS, TR >::SetReachedMap< T >
     Named parameter for setting ReachedMap type. More...
     
    \n \n \n \n \n+

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n+\n+\n+\n+\n+\n

    \n+Functions

    template<class GR >
    DfsWizard< DfsWizardBase< GR > > dfs (const GR &digraph)
     Function-type interface for DFS algorithm.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,24 +5,74 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces\n-static_graph.h File Reference\n-Data_Structures \u00bb Graph_Structures\n+Classes | Namespaces | Functions\n+dfs.h File Reference\n+Algorithms \u00bb Graph_Search\n+#include \n+#include \n #include \n-#include \n+#include \n+#include \n+#include \n Classes\n-class \u00a0StaticDigraph\n-\u00a0 A static directed graph class. More...\n+struct \u00a0DfsDefaultTraits<_GR_>\n+\u00a0 Default traits class of Dfs class. More...\n+\u00a0\n+ class \u00a0Dfs<_GR,_TR_>\n+\u00a0 DFS algorithm class. More...\n+\u00a0\n+struct \u00a0Dfs<_GR,_TR_>::SetPredMap<_T_>\n+\u00a0 Named_parameter for setting PredMap type. More...\n+\u00a0\n+struct \u00a0Dfs<_GR,_TR_>::SetDistMap<_T_>\n+\u00a0 Named_parameter for setting DistMap type. More...\n+\u00a0\n+struct \u00a0Dfs<_GR,_TR_>::SetReachedMap<_T_>\n+\u00a0 Named_parameter for setting ReachedMap type. More...\n+\u00a0\n+struct \u00a0Dfs<_GR,_TR_>::SetProcessedMap<_T_>\n+\u00a0 Named_parameter for setting ProcessedMap type. More...\n+\u00a0\n+struct \u00a0Dfs<_GR,_TR_>::SetStandardProcessedMap\n+\u00a0 Named_parameter for setting ProcessedMap type to be Digraph::\n+ NodeMap. More...\n+\u00a0\n+struct \u00a0DfsWizardDefaultTraits<_GR_>\n+\u00a0 Default traits class of dfs() function. More...\n+\u00a0\n+ class \u00a0DfsWizardBase<_GR_>\n+\u00a0 Default traits class used by DfsWizard. More...\n+\u00a0\n+ class \u00a0DfsWizard<_TR_>\n+\u00a0 Auxiliary class for the function-type interface of DFS algorithm.\n+ More...\n+\u00a0\n+struct \u00a0DfsVisitor<_GR_>\n+\u00a0 Visitor class for DFS. More...\n+\u00a0\n+struct \u00a0DfsVisitDefaultTraits<_GR_>\n+\u00a0 Default traits class of DfsVisit class. More...\n+\u00a0\n+ class \u00a0DfsVisit<_GR,_VS,_TR_>\n+\u00a0 DFS algorithm class with visitor interface. More...\n+\u00a0\n+struct \u00a0DfsVisit<_GR,_VS,_TR_>::SetReachedMap<_T_>\n+\u00a0 Named_parameter for setting ReachedMap type. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n+ Functions\n+template\n+DfsWizard< DfsWizardBase< GR > >\u00a0dfs (const GR &digraph)\n+\u00a0 Function-type interface for DFS algorithm.\n+\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00290.html", "source2": "./usr/share/doc/lemon/html/a00290.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/cost_scaling.h File Reference\n+My Project: lemon/adaptors.h File Reference\n \n \n \n \n \n \n \n@@ -72,37 +72,70 @@\n
  • lemon
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    cost_scaling.h File Reference
    Algorithms » Minimum Cost Flow Algorithms
    \n+
    adaptors.h File Reference
    Data Structures » Graph Structures » Adaptor Classes for Graphs
    \n
    \n
    \n-
    #include <vector>
    \n-#include <deque>
    \n-#include <limits>
    \n-#include <lemon/core.h>
    \n-#include <lemon/maps.h>
    \n-#include <lemon/math.h>
    \n-#include <lemon/static_graph.h>
    \n-#include <lemon/circulation.h>
    \n-#include <lemon/bellman_ford.h>
    \n+

    Detailed Description

    \n+

    This file contains several useful adaptors for digraphs and graphs.

    \n+
    #include <lemon/core.h>
    \n+#include <lemon/maps.h>
    \n+#include <lemon/bits/variant.h>
    \n+#include <lemon/bits/graph_adaptor_extender.h>
    \n+#include <lemon/bits/map_extender.h>
    \n+#include <lemon/tolerance.h>
    \n+#include <algorithm>
    \n
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    struct  CostScalingDefaultTraits< GR, V, C >
     Default traits class of CostScaling algorithm. More...
    class  ReverseDigraph< DGR >
     Adaptor class for reversing the orientation of the arcs in a digraph. More...
     
    class  CostScaling< GR, V, C, TR >
     Implementation of the Cost Scaling algorithm for finding a minimum cost flow. More...
    class  SubDigraph< DGR, NF, AF >
     Adaptor class for hiding nodes and arcs in a digraph. More...
     
    struct  CostScaling< GR, V, C, TR >::SetLargeCost< T >
     Named parameter for setting LargeCost type. More...
    class  SubGraph< GR, NF, EF >
     Adaptor class for hiding nodes and edges in an undirected graph. More...
     
    class  FilterNodes< GR, NF >
     Adaptor class for hiding nodes in a digraph or a graph. More...
     
    class  FilterArcs< DGR, AF >
     Adaptor class for hiding arcs in a digraph. More...
     
    class  FilterEdges< GR, EF >
     Adaptor class for hiding edges in a graph. More...
     
    class  Undirector< DGR >
     Adaptor class for viewing a digraph as an undirected graph. More...
     
    class  Undirector< DGR >::CombinedArcMap< FW, BK >
     Arc map combined from two original arc maps. More...
     
    class  Orienter< GR, DM >
     Adaptor class for orienting the edges of a graph to get a digraph. More...
     
    class  ResidualDigraph< DGR, CM, FM, TL >
     Adaptor class for composing the residual digraph for directed flow and circulation problems. More...
     
    class  ResidualDigraph< DGR, CM, FM, TL >::ResidualCapacity
     Residual capacity map. More...
     
    class  SplitNodes< DGR >
     Adaptor class for splitting the nodes of a digraph. More...
     
    class  SplitNodes< DGR >::CombinedNodeMap< IN, OUT >
     Node map combined from two original node maps. More...
     
    class  SplitNodes< DGR >::CombinedArcMap< AM, NM >
     Arc map combined from an arc map and a node map of the original digraph. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,35 +6,72 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-cost_scaling.h File Reference\n-Algorithms \u00bb Minimum_Cost_Flow_Algorithms\n-#include \n-#include \n-#include \n+adaptors.h File Reference\n+Data_Structures \u00bb Graph_Structures \u00bb Adaptor_Classes_for_Graphs\n+***** Detailed Description *****\n+This file contains several useful adaptors for digraphs and graphs.\n #include \n #include \n-#include \n-#include \n-#include \n-#include \n+#include \n+#include \n+#include \n+#include \n+#include \n Classes\n-struct \u00a0CostScalingDefaultTraits<_GR,_V,_C_>\n-\u00a0 Default traits class of CostScaling algorithm. More...\n+class \u00a0ReverseDigraph<_DGR_>\n+\u00a0 Adaptor class for reversing the orientation of the arcs in a digraph.\n+ More...\n \u00a0\n- class \u00a0CostScaling<_GR,_V,_C,_TR_>\n-\u00a0 Implementation of the Cost Scaling algorithm for finding a minimum\n- cost_flow. More...\n+class \u00a0SubDigraph<_DGR,_NF,_AF_>\n+\u00a0 Adaptor class for hiding nodes and arcs in a digraph. More...\n \u00a0\n-struct \u00a0CostScaling<_GR,_V,_C,_TR_>::SetLargeCost<_T_>\n-\u00a0 Named_parameter for setting LargeCost type. More...\n+class \u00a0SubGraph<_GR,_NF,_EF_>\n+\u00a0 Adaptor class for hiding nodes and edges in an undirected graph.\n+ More...\n+\u00a0\n+class \u00a0FilterNodes<_GR,_NF_>\n+\u00a0 Adaptor class for hiding nodes in a digraph or a graph. More...\n+\u00a0\n+class \u00a0FilterArcs<_DGR,_AF_>\n+\u00a0 Adaptor class for hiding arcs in a digraph. More...\n+\u00a0\n+class \u00a0FilterEdges<_GR,_EF_>\n+\u00a0 Adaptor class for hiding edges in a graph. More...\n+\u00a0\n+class \u00a0Undirector<_DGR_>\n+\u00a0 Adaptor class for viewing a digraph as an undirected graph. More...\n+\u00a0\n+class \u00a0Undirector<_DGR_>::CombinedArcMap<_FW,_BK_>\n+\u00a0 Arc map combined from two original arc maps. More...\n+\u00a0\n+class \u00a0Orienter<_GR,_DM_>\n+\u00a0 Adaptor class for orienting the edges of a graph to get a digraph.\n+ More...\n+\u00a0\n+class \u00a0ResidualDigraph<_DGR,_CM,_FM,_TL_>\n+\u00a0 Adaptor class for composing the residual digraph for directed flow and\n+ circulation problems. More...\n+\u00a0\n+class \u00a0ResidualDigraph<_DGR,_CM,_FM,_TL_>::ResidualCapacity\n+\u00a0 Residual capacity map. More...\n+\u00a0\n+class \u00a0SplitNodes<_DGR_>\n+\u00a0 Adaptor class for splitting the nodes of a digraph. More...\n+\u00a0\n+class \u00a0SplitNodes<_DGR_>::CombinedNodeMap<_IN,_OUT_>\n+\u00a0 Node map combined from two original node maps. More...\n+\u00a0\n+class \u00a0SplitNodes<_DGR_>::CombinedArcMap<_AM,_NM_>\n+\u00a0 Arc map combined from an arc map and a node map of the original\n+ digraph. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00293.html", "source2": "./usr/share/doc/lemon/html/a00293.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/nagamochi_ibaraki.h File Reference\n+My Project: lemon/radix_heap.h File Reference\n \n \n \n \n \n \n \n@@ -72,41 +72,27 @@\n
  • lemon
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    nagamochi_ibaraki.h File Reference
    Algorithms » Minimum Cut Algorithms
    \n+
    radix_heap.h File Reference
    Data Structures » Heap Structures
    \n
    \n
    \n-
    #include <lemon/core.h>
    \n-#include <lemon/bin_heap.h>
    \n-#include <lemon/bucket_heap.h>
    \n-#include <lemon/maps.h>
    \n-#include <lemon/radix_sort.h>
    \n-#include <lemon/unionfind.h>
    \n-#include <cassert>
    \n+
    #include <vector>
    \n+#include <lemon/error.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    struct  NagamochiIbarakiDefaultTraits< GR, CM >
     Default traits class for NagamochiIbaraki class. More...
    class  RadixHeap< IM >
     Radix heap data structure. More...
     
    class  NagamochiIbaraki< GR, CM, TR >
     Calculates the minimum cut in an undirected graph. More...
     
    struct  NagamochiIbaraki< GR, CM, TR >::SetUnitCapacity
     Named parameter for setting the capacity map to a constMap<Edge, int, 1>() instance More...
     
    struct  NagamochiIbaraki< GR, CM, TR >::SetHeap< H, CR >
     Named parameter for setting heap and cross reference type More...
     
    struct  NagamochiIbaraki< GR, CM, TR >::SetStandardHeap< H, CR >
     Named parameter for setting heap and cross reference type with automatic allocation More...
    class  RadixHeap< IM >::PriorityUnderflowError
     Exception thrown by RadixHeap. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,40 +6,24 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-nagamochi_ibaraki.h File Reference\n-Algorithms \u00bb Minimum_Cut_Algorithms\n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n+radix_heap.h File Reference\n+Data_Structures \u00bb Heap_Structures\n+#include \n+#include \n Classes\n-struct \u00a0NagamochiIbarakiDefaultTraits<_GR,_CM_>\n-\u00a0 Default traits class for NagamochiIbaraki class. More...\n+class \u00a0RadixHeap<_IM_>\n+\u00a0 Radix heap data structure. More...\n \u00a0\n- class \u00a0NagamochiIbaraki<_GR,_CM,_TR_>\n-\u00a0 Calculates the minimum cut in an undirected graph. More...\n-\u00a0\n-struct \u00a0NagamochiIbaraki<_GR,_CM,_TR_>::SetUnitCapacity\n-\u00a0 Named_parameter for setting the capacity map to a constMap() instance More...\n-\u00a0\n-struct \u00a0NagamochiIbaraki<_GR,_CM,_TR_>::SetHeap<_H,_CR_>\n-\u00a0 Named_parameter for setting heap and cross reference type More...\n-\u00a0\n-struct \u00a0NagamochiIbaraki<_GR,_CM,_TR_>::SetStandardHeap<_H,_CR_>\n-\u00a0 Named_parameter for setting heap and cross reference type with\n- automatic allocation More...\n+class \u00a0RadixHeap<_IM_>::PriorityUnderflowError\n+\u00a0 Exception thrown by RadixHeap. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00296.html", "source2": "./usr/share/doc/lemon/html/a00296.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/random.h File Reference\n+My Project: lemon/fib_heap.h File Reference\n \n \n \n \n \n \n \n@@ -72,33 +72,26 @@\n
  • lemon
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    random.h File Reference
    Tools and Utilities » Miscellaneous Tools
    \n+
    fib_heap.h File Reference
    Data Structures » Heap Structures
    \n
    \n
    \n-
    #include <algorithm>
    \n-#include <iterator>
    \n-#include <vector>
    \n-#include <limits>
    \n-#include <fstream>
    \n-#include <lemon/math.h>
    \n-#include <lemon/dim2.h>
    \n-#include <sys/time.h>
    \n-#include <ctime>
    \n-#include <sys/types.h>
    \n-#include <unistd.h>
    \n+
    #include <vector>
    \n+#include <utility>
    \n+#include <functional>
    \n+#include <lemon/math.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n+\n+\n \n

    \n Classes

    class  Random
     Mersenne Twister random number generator. More...
    class  FibHeap< PR, IM, CMP >
     Fibonacci heap data structure. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,30 +6,23 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-random.h File Reference\n-Tools_and_Utilities \u00bb Miscellaneous_Tools\n-#include \n-#include \n+fib_heap.h File Reference\n+Data_Structures \u00bb Heap_Structures\n #include \n-#include \n-#include \n+#include \n+#include \n #include \n-#include \n-#include \n-#include \n-#include \n-#include \n Classes\n-class \u00a0Random\n-\u00a0 Mersenne Twister random number generator. More...\n+class \u00a0FibHeap<_PR,_IM,_CMP_>\n+\u00a0 Fibonacci heap data structure. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00299.html", "source2": "./usr/share/doc/lemon/html/a00299.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/lp_base.h File Reference\n+My Project: lemon/graph_to_eps.h File Reference\n \n \n \n \n \n \n \n@@ -71,81 +71,63 @@\n \n \n \n
    \n
    \n Classes |\n-Namespaces
    \n-
    lp_base.h File Reference
    General Optimization Tools » LP and MIP Solvers
    \n+Namespaces |\n+Functions
    \n+
    graph_to_eps.h File Reference
    Input-Output » Postscript Exporting
    \n \n
    \n
    #include <iostream>
    \n+#include <fstream>
    \n+#include <sstream>
    \n+#include <algorithm>
    \n #include <vector>
    \n-#include <map>
    \n-#include <limits>
    \n-#include <lemon/math.h>
    \n-#include <lemon/error.h>
    \n-#include <lemon/assert.h>
    \n-#include <lemon/core.h>
    \n-#include <lemon/bits/solver_bits.h>
    \n+#include <sys/time.h>
    \n+#include <ctime>
    \n+#include <lemon/math.h>
    \n+#include <lemon/core.h>
    \n+#include <lemon/dim2.h>
    \n+#include <lemon/maps.h>
    \n+#include <lemon/color.h>
    \n+#include <lemon/bits/bezier.h>
    \n+#include <lemon/error.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    class  LpBase
     Common base class for LP and MIP solvers. More...
    struct  DefaultGraphToEpsTraits< GR >
     Default traits class of GraphToEps. More...
     
    class  LpBase::Col
     Refer to a column of the LP. More...
     
    class  LpBase::ColIt
     Iterator for iterate over the columns of an LP problem. More...
     
    class  LpBase::Row
     Refer to a row of the LP. More...
     
    class  LpBase::RowIt
     Iterator for iterate over the rows of an LP problem. More...
     
    class  LpBase::Expr
     Linear expression of variables and a constant component. More...
     
    class  LpBase::Expr::CoeffIt
     Iterator over the expression. More...
     
    class  LpBase::Expr::ConstCoeffIt
     Const iterator over the expression. More...
     
    class  LpBase::Constr
     Linear constraint. More...
     
    class  LpBase::DualExpr
     Linear expression of rows. More...
     
    class  LpBase::DualExpr::CoeffIt
     Iterator over the expression. More...
     
    class  LpBase::DualExpr::ConstCoeffIt
     Iterator over the expression. More...
     
    class  LpBase::UnsupportedFormatError
     Unsupported file format exception. More...
     
    class  LpSolver
     Common base class for LP solvers. More...
     
    class  MipSolver
     Common base class for MIP solvers. More...
    class  GraphToEps< T >
     Auxiliary class to implement the named parameters of graphToEps() More...
     
    \n \n \n \n \n+

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n

    \n+Functions

    template<class GR >
    GraphToEps< DefaultGraphToEpsTraits< GR > > graphToEps (GR &g, std::ostream &os=std::cout)
     Generates an EPS file from a graph.
     
    template<class GR >
    GraphToEps< DefaultGraphToEpsTraits< GR > > graphToEps (GR &g, const char *file_name)
     Generates an EPS file from a graph.
     
    template<class GR >
    GraphToEps< DefaultGraphToEpsTraits< GR > > graphToEps (GR &g, const std::string &file_name)
     Generates an EPS file from a graph.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,73 +5,56 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces\n-lp_base.h File Reference\n-General_Optimization_Tools \u00bb LP_and_MIP_Solvers\n+Classes | Namespaces | Functions\n+graph_to_eps.h File Reference\n+Input-Output \u00bb Postscript_Exporting\n #include \n+#include \n+#include \n+#include \n #include \n-#include \n-#include \n+#include \n+#include \n #include \n-#include \n-#include \n #include \n-#include \n+#include \n+#include \n+#include \n+#include \n+#include \n Classes\n-class \u00a0LpBase\n-\u00a0 Common base class for LP and MIP solvers. More...\n-\u00a0\n-class \u00a0LpBase::Col\n-\u00a0 Refer to a column of the LP. More...\n-\u00a0\n-class \u00a0LpBase::ColIt\n-\u00a0 Iterator for iterate over the columns of an LP problem. More...\n-\u00a0\n-class \u00a0LpBase::Row\n-\u00a0 Refer to a row of the LP. More...\n-\u00a0\n-class \u00a0LpBase::RowIt\n-\u00a0 Iterator for iterate over the rows of an LP problem. More...\n-\u00a0\n-class \u00a0LpBase::Expr\n-\u00a0 Linear expression of variables and a constant component. More...\n-\u00a0\n-class \u00a0LpBase::Expr::CoeffIt\n-\u00a0 Iterator over the expression. More...\n+struct \u00a0DefaultGraphToEpsTraits<_GR_>\n+\u00a0 Default traits class of GraphToEps. More...\n \u00a0\n-class \u00a0LpBase::Expr::ConstCoeffIt\n-\u00a0 Const iterator over the expression. More...\n-\u00a0\n-class \u00a0LpBase::Constr\n-\u00a0 Linear constraint. More...\n-\u00a0\n-class \u00a0LpBase::DualExpr\n-\u00a0 Linear expression of rows. More...\n-\u00a0\n-class \u00a0LpBase::DualExpr::CoeffIt\n-\u00a0 Iterator over the expression. More...\n-\u00a0\n-class \u00a0LpBase::DualExpr::ConstCoeffIt\n-\u00a0 Iterator over the expression. More...\n-\u00a0\n-class \u00a0LpBase::UnsupportedFormatError\n-\u00a0 Unsupported file format exception. More...\n-\u00a0\n-class \u00a0LpSolver\n-\u00a0 Common base class for LP solvers. More...\n-\u00a0\n-class \u00a0MipSolver\n-\u00a0 Common base class for MIP solvers. More...\n+ class \u00a0GraphToEps<_T_>\n+\u00a0 Auxiliary class to implement the named parameters of graphToEps()\n+ More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n+ Functions\n+template\n+GraphToEps< DefaultGraphToEpsTraits< GR graphToEps (GR &g, std::ostream\n+ > >\u00a0&os=std::cout)\n+\u00a0 Generates an EPS file from a graph.\n+\u00a0\n+template\n+GraphToEps< DefaultGraphToEpsTraits< GR graphToEps (GR &g, const char\n+ > >\u00a0*file_name)\n+\u00a0 Generates an EPS file from a graph.\n+\u00a0\n+template\n+GraphToEps< DefaultGraphToEpsTraits< GR graphToEps (GR &g, const std::string\n+ > >\u00a0&file_name)\n+\u00a0 Generates an EPS file from a graph.\n+\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00302.html", "source2": "./usr/share/doc/lemon/html/a00302.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/dheap.h File Reference\n+My Project: lemon/suurballe.h File Reference\n \n \n \n \n \n \n \n@@ -72,25 +72,44 @@\n
  • lemon
    • \n
    \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    dheap.h File Reference
    Data Structures » Heap Structures
    \n+
    suurballe.h File Reference
    Algorithms » Shortest Path Algorithms
    \n
    \n
    \n
    #include <vector>
    \n-#include <utility>
    \n-#include <functional>
    \n+#include <limits>
    \n+#include <lemon/bin_heap.h>
    \n+#include <lemon/path.h>
    \n+#include <lemon/list_graph.h>
    \n+#include <lemon/dijkstra.h>
    \n+#include <lemon/maps.h>
    \n
    \n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  DHeap< PR, IM, D, CMP >
     D-ary heap data structure. More...
    struct  SuurballeDefaultTraits< GR, LEN >
     Default traits class of Suurballe algorithm. More...
     
    class  Suurballe< GR, LEN, TR >
     Algorithm for finding arc-disjoint paths between two nodes having minimum total length. More...
     
    struct  Suurballe< GR, LEN, TR >::SetFlowMap< T >
     Named parameter for setting FlowMap type. More...
     
    struct  Suurballe< GR, LEN, TR >::SetPotentialMap< T >
     Named parameter for setting PotentialMap type. More...
     
    struct  Suurballe< GR, LEN, TR >::SetPath< T >
     Named parameter for setting Path type. More...
     
    struct  Suurballe< GR, LEN, TR >::SetHeap< H, CR >
     Named parameter for setting Heap and HeapCrossRef types. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,22 +6,42 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-dheap.h File Reference\n-Data_Structures \u00bb Heap_Structures\n+suurballe.h File Reference\n+Algorithms \u00bb Shortest_Path_Algorithms\n #include \n-#include \n-#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n Classes\n-class \u00a0DHeap<_PR,_IM,_D,_CMP_>\n-\u00a0 D-ary heap data structure. More...\n+struct \u00a0SuurballeDefaultTraits<_GR,_LEN_>\n+\u00a0 Default traits class of Suurballe algorithm. More...\n+\u00a0\n+ class \u00a0Suurballe<_GR,_LEN,_TR_>\n+\u00a0 Algorithm for finding arc-disjoint paths between two nodes having\n+ minimum total length. More...\n+\u00a0\n+struct \u00a0Suurballe<_GR,_LEN,_TR_>::SetFlowMap<_T_>\n+\u00a0 Named_parameter for setting FlowMap type. More...\n+\u00a0\n+struct \u00a0Suurballe<_GR,_LEN,_TR_>::SetPotentialMap<_T_>\n+\u00a0 Named_parameter for setting PotentialMap type. More...\n+\u00a0\n+struct \u00a0Suurballe<_GR,_LEN,_TR_>::SetPath<_T_>\n+\u00a0 Named_parameter for setting Path type. More...\n+\u00a0\n+struct \u00a0Suurballe<_GR,_LEN,_TR_>::SetHeap<_H,_CR_>\n+\u00a0 Named_parameter for setting Heap and HeapCrossRef types. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00305.html", "source2": "./usr/share/doc/lemon/html/a00305.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/connectivity.h File Reference\n+My Project: lemon/cplex.cc File Reference\n \n \n \n \n \n \n \n@@ -70,140 +70,29 @@\n
    \n \n
    \n \n
    \n
    \n-Namespaces |\n-Functions
    \n-
    connectivity.h File Reference
    Algorithms » Connectivity and Other Graph Properties
    \n+Namespaces
    \n+
    cplex.cc File Reference
    \n \n
    \n-

    Detailed Description

    \n-

    Connectivity algorithms

    \n-
    #include <lemon/dfs.h>
    \n-#include <lemon/bfs.h>
    \n-#include <lemon/core.h>
    \n-#include <lemon/maps.h>
    \n-#include <lemon/adaptors.h>
    \n-#include <lemon/concepts/digraph.h>
    \n-#include <lemon/concepts/graph.h>
    \n-#include <lemon/concept_check.h>
    \n-#include <stack>
    \n-#include <functional>
    \n+
    #include <iostream>
    \n+#include <vector>
    \n+#include <cstring>
    \n+#include <lemon/cplex.h>
    \n+#include <ilcplex/cplex.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n \n \n \n-

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n

    \n-Functions

    template<typename Graph >
    bool connected (const Graph &graph)
     Check whether an undirected graph is connected.
     
    template<typename Graph >
    int countConnectedComponents (const Graph &graph)
     Count the number of connected components of an undirected graph.
     
    template<class Graph , class NodeMap >
    int connectedComponents (const Graph &graph, NodeMap &compMap)
     Find the connected components of an undirected graph.
     
    template<typename Digraph >
    bool stronglyConnected (const Digraph &digraph)
     Check whether a directed graph is strongly connected.
     
    template<typename Digraph >
    int countStronglyConnectedComponents (const Digraph &digraph)
     Count the number of strongly connected components of a directed graph.
     
    template<typename Digraph , typename NodeMap >
    int stronglyConnectedComponents (const Digraph &digraph, NodeMap &compMap)
     Find the strongly connected components of a directed graph.
     
    template<typename Digraph , typename ArcMap >
    int stronglyConnectedCutArcs (const Digraph &digraph, ArcMap &cutMap)
     Find the cut arcs of the strongly connected components.
     
    template<typename Graph >
    int countBiNodeConnectedComponents (const Graph &graph)
     Count the number of bi-node-connected components of an undirected graph.
     
    template<typename Graph >
    bool biNodeConnected (const Graph &graph)
     Check whether an undirected graph is bi-node-connected.
     
    template<typename Graph , typename EdgeMap >
    int biNodeConnectedComponents (const Graph &graph, EdgeMap &compMap)
     Find the bi-node-connected components of an undirected graph.
     
    template<typename Graph , typename NodeMap >
    int biNodeConnectedCutNodes (const Graph &graph, NodeMap &cutMap)
     Find the bi-node-connected cut nodes in an undirected graph.
     
    template<typename Graph >
    int countBiEdgeConnectedComponents (const Graph &graph)
     Count the number of bi-edge-connected components of an undirected graph.
     
    template<typename Graph >
    bool biEdgeConnected (const Graph &graph)
     Check whether an undirected graph is bi-edge-connected.
     
    template<typename Graph , typename NodeMap >
    int biEdgeConnectedComponents (const Graph &graph, NodeMap &compMap)
     Find the bi-edge-connected components of an undirected graph.
     
    template<typename Graph , typename EdgeMap >
    int biEdgeConnectedCutEdges (const Graph &graph, EdgeMap &cutMap)
     Find the bi-edge-connected cut edges in an undirected graph.
     
    template<typename Digraph >
    bool dag (const Digraph &digraph)
     Check whether a digraph is DAG.
     
    template<typename Digraph , typename NodeMap >
    void topologicalSort (const Digraph &digraph, NodeMap &order)
     Sort the nodes of a DAG into topolgical order.
     
    template<typename Digraph , typename NodeMap >
    bool checkedTopologicalSort (const Digraph &digraph, NodeMap &order)
     Sort the nodes of a DAG into topolgical order.
     
    template<typename Graph >
    bool acyclic (const Graph &graph)
     Check whether an undirected graph is acyclic.
     
    template<typename Graph >
    bool tree (const Graph &graph)
     Check whether an undirected graph is tree.
     
    template<typename Graph >
    bool bipartite (const Graph &graph)
     Check whether an undirected graph is bipartite.
     
    template<typename Graph , typename NodeMap >
    bool bipartitePartitions (const Graph &graph, NodeMap &partMap)
     Find the bipartite partitions of an undirected graph.
     
    template<typename Graph >
    bool loopFree (const Graph &graph)
     Check whether the given graph contains no loop arcs/edges.
     
    template<typename Graph >
    bool parallelFree (const Graph &graph)
     Check whether the given graph contains no parallel arcs/edges.
     
    template<typename Graph >
    bool simpleGraph (const Graph &graph)
     Check whether the given graph is simple.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,131 +5,22 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Namespaces | Functions\n-connectivity.h File Reference\n-Algorithms \u00bb Connectivity_and_Other_Graph_Properties\n-***** Detailed Description *****\n-Connectivity algorithms\n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n+Namespaces\n+cplex.cc File Reference\n+#include \n+#include \n+#include \n+#include \n+#include \n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n- Functions\n-template\n-bool\u00a0connected (const Graph &graph)\n-\u00a0 Check whether an undirected graph is connected.\n-\u00a0\n-template\n- int\u00a0countConnectedComponents (const Graph &graph)\n-\u00a0 Count the number of connected components of an undirected graph.\n-\u00a0\n-template\n- int\u00a0connectedComponents (const Graph &graph, NodeMap &compMap)\n-\u00a0 Find the connected components of an undirected graph.\n-\u00a0\n-template\n-bool\u00a0stronglyConnected (const Digraph &digraph)\n-\u00a0 Check whether a directed graph is strongly connected.\n-\u00a0\n-template\n- int\u00a0countStronglyConnectedComponents (const Digraph &digraph)\n-\u00a0 Count the number of strongly connected components of a directed graph.\n-\u00a0\n-template\n- int\u00a0stronglyConnectedComponents (const Digraph &digraph, NodeMap &compMap)\n-\u00a0 Find the strongly connected components of a directed graph.\n-\u00a0\n-template\n- int\u00a0stronglyConnectedCutArcs (const Digraph &digraph, ArcMap &cutMap)\n-\u00a0 Find the cut arcs of the strongly connected components.\n-\u00a0\n-template\n- int\u00a0countBiNodeConnectedComponents (const Graph &graph)\n-\u00a0 Count the number of bi-node-connected components of an undirected graph.\n-\u00a0\n-template\n-bool\u00a0biNodeConnected (const Graph &graph)\n-\u00a0 Check whether an undirected graph is bi-node-connected.\n-\u00a0\n-template\n- int\u00a0biNodeConnectedComponents (const Graph &graph, EdgeMap &compMap)\n-\u00a0 Find the bi-node-connected components of an undirected graph.\n-\u00a0\n-template\n- int\u00a0biNodeConnectedCutNodes (const Graph &graph, NodeMap &cutMap)\n-\u00a0 Find the bi-node-connected cut nodes in an undirected graph.\n-\u00a0\n-template\n- int\u00a0countBiEdgeConnectedComponents (const Graph &graph)\n-\u00a0 Count the number of bi-edge-connected components of an undirected graph.\n-\u00a0\n-template\n-bool\u00a0biEdgeConnected (const Graph &graph)\n-\u00a0 Check whether an undirected graph is bi-edge-connected.\n-\u00a0\n-template\n- int\u00a0biEdgeConnectedComponents (const Graph &graph, NodeMap &compMap)\n-\u00a0 Find the bi-edge-connected components of an undirected graph.\n-\u00a0\n-template\n- int\u00a0biEdgeConnectedCutEdges (const Graph &graph, EdgeMap &cutMap)\n-\u00a0 Find the bi-edge-connected cut edges in an undirected graph.\n-\u00a0\n-template\n-bool\u00a0dag (const Digraph &digraph)\n-\u00a0 Check whether a digraph is DAG.\n-\u00a0\n-template\n-void\u00a0topologicalSort (const Digraph &digraph, NodeMap &order)\n-\u00a0 Sort the nodes of a DAG into topolgical order.\n-\u00a0\n-template\n-bool\u00a0checkedTopologicalSort (const Digraph &digraph, NodeMap &order)\n-\u00a0 Sort the nodes of a DAG into topolgical order.\n-\u00a0\n-template\n-bool\u00a0acyclic (const Graph &graph)\n-\u00a0 Check whether an undirected graph is acyclic.\n-\u00a0\n-template\n-bool\u00a0tree (const Graph &graph)\n-\u00a0 Check whether an undirected graph is tree.\n-\u00a0\n-template\n-bool\u00a0bipartite (const Graph &graph)\n-\u00a0 Check whether an undirected graph is bipartite.\n-\u00a0\n-template\n-bool\u00a0bipartitePartitions (const Graph &graph, NodeMap &partMap)\n-\u00a0 Find the bipartite partitions of an undirected graph.\n-\u00a0\n-template\n-bool\u00a0loopFree (const Graph &graph)\n-\u00a0 Check whether the given graph contains no loop arcs/edges.\n-\u00a0\n-template\n-bool\u00a0parallelFree (const Graph &graph)\n-\u00a0 Check whether the given graph contains no parallel arcs/edges.\n-\u00a0\n-template\n-bool\u00a0simpleGraph (const Graph &graph)\n-\u00a0 Check whether the given graph is simple.\n-\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00308.html", "source2": "./usr/share/doc/lemon/html/a00308.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/nauty_reader.h File Reference\n+My Project: lemon/glpk.cc File Reference\n \n \n \n \n \n \n \n@@ -70,35 +70,26 @@\n
    \n \n
    \n \n
    \n
    \n-Namespaces |\n-Functions
    \n-
    nauty_reader.h File Reference
    Input-Output » NAUTY Format
    \n+Namespaces
    \n+
    glpk.cc File Reference
    \n \n
    \n-
    #include <vector>
    \n-#include <iostream>
    \n-#include <string>
    \n+
    #include <lemon/glpk.h>
    \n+#include <lemon/assert.h>
    \n
    \n \n \n \n \n-

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n

    \n-Functions

    template<typename Graph >
    std::istream & readNautyGraph (Graph &graph, std::istream &is=std::cin)
     Nauty file reader.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,26 +5,19 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Namespaces | Functions\n-nauty_reader.h File Reference\n-Input-Output \u00bb NAUTY_Format\n-#include \n-#include \n-#include \n+Namespaces\n+glpk.cc File Reference\n+#include \n+#include \n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n- Functions\n-template\n-std::istream &\u00a0readNautyGraph (Graph &graph, std::istream &is=std::cin)\n-\u00a0 Nauty file reader.\n-\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00311.html", "source2": "./usr/share/doc/lemon/html/a00311.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/cycle_canceling.h File Reference\n+My Project: lemon/edmonds_karp.h File Reference\n \n \n \n \n \n \n \n@@ -72,34 +72,30 @@\n
  • lemon
    • \n
    \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    cycle_canceling.h File Reference
    Algorithms » Minimum Cost Flow Algorithms
    \n+
    edmonds_karp.h File Reference
    Algorithms » Maximum Flow Algorithms
    \n
    \n
    \n-
    #include <vector>
    \n-#include <limits>
    \n-#include <lemon/core.h>
    \n-#include <lemon/maps.h>
    \n-#include <lemon/path.h>
    \n-#include <lemon/math.h>
    \n-#include <lemon/static_graph.h>
    \n-#include <lemon/adaptors.h>
    \n-#include <lemon/circulation.h>
    \n-#include <lemon/bellman_ford.h>
    \n-#include <lemon/howard_mmc.h>
    \n-#include <lemon/hartmann_orlin_mmc.h>
    \n+
    #include <lemon/tolerance.h>
    \n+#include <vector>
    \n
    \n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  CycleCanceling< GR, V, C >
     Implementation of cycle-canceling algorithms for finding a minimum cost flow. More...
    struct  EdmondsKarpDefaultTraits< GR, CAP >
     Default traits class of EdmondsKarp class. More...
     
    class  EdmondsKarp< GR, CAP, TR >
     Edmonds-Karp algorithms class. More...
     
    struct  EdmondsKarp< GR, CAP, TR >::SetFlowMap< T >
     Named parameter for setting FlowMap type More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,32 +6,27 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-cycle_canceling.h File Reference\n-Algorithms \u00bb Minimum_Cost_Flow_Algorithms\n+edmonds_karp.h File Reference\n+Algorithms \u00bb Maximum_Flow_Algorithms\n+#include \n #include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n Classes\n-class \u00a0CycleCanceling<_GR,_V,_C_>\n-\u00a0 Implementation of cycle-canceling algorithms for finding a minimum_cost\n- flow. More...\n+struct \u00a0EdmondsKarpDefaultTraits<_GR,_CAP_>\n+\u00a0 Default traits class of EdmondsKarp class. More...\n+\u00a0\n+ class \u00a0EdmondsKarp<_GR,_CAP,_TR_>\n+\u00a0 Edmonds-Karp algorithms class. More...\n+\u00a0\n+struct \u00a0EdmondsKarp<_GR,_CAP,_TR_>::SetFlowMap<_T_>\n+\u00a0 Named_parameter for setting FlowMap type More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00314.html", "source2": "./usr/share/doc/lemon/html/a00314.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/glpk.h File Reference\n+My Project: lemon/dim2.h File Reference\n \n \n \n \n \n \n \n@@ -72,36 +72,52 @@\n
  • lemon
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    glpk.h File Reference
    General Optimization Tools » LP and MIP Solvers
    \n+
    dim2.h File Reference
    Data Structures » Auxiliary Data Structures » Geometric Data Structures
    \n
    \n
    \n-
    #include <lemon/lp_base.h>
    \n+
    #include <iostream>
    \n+#include <algorithm>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  GlpkBase
     Base interface for the GLPK LP and MIP solver. More...
    class  Point< T >
     Two dimensional vector (plain vector) More...
     
    class  GlpkLp
     Interface for the GLPK LP solver. More...
    class  Box< T >
     Bounding box of plain vectors (points). More...
     
    class  GlpkMip
     Interface for the GLPK MIP solver. More...
    class  XMap< M >
     Map of x-coordinates of a Point-map. More...
     
    class  ConstXMap< M >
     Constant (read only) version of XMap. More...
     
    class  YMap< M >
     Map of y-coordinates of a Point-map. More...
     
    class  ConstYMap< M >
     Constant (read only) version of YMap. More...
     
    class  NormSquareMap< M >
     Map of the normSquare() of a Point-map. More...
     
    \n \n \n \n \n+\n+\n+\n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    namespace  lemon::dim2
     Tools for handling two dimensional coordinates.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,28 +6,44 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-glpk.h File Reference\n-General_Optimization_Tools \u00bb LP_and_MIP_Solvers\n-#include \n+dim2.h File Reference\n+Data_Structures \u00bb Auxiliary_Data_Structures \u00bb Geometric_Data_Structures\n+#include \n+#include \n Classes\n-class \u00a0GlpkBase\n-\u00a0 Base interface for the GLPK LP and MIP solver. More...\n+class \u00a0Point<_T_>\n+\u00a0 Two dimensional vector (plain vector) More...\n \u00a0\n-class \u00a0GlpkLp\n-\u00a0 Interface for the GLPK LP solver. More...\n+class \u00a0Box<_T_>\n+\u00a0 Bounding box of plain vectors (points). More...\n \u00a0\n-class \u00a0GlpkMip\n-\u00a0 Interface for the GLPK MIP solver. More...\n+class \u00a0XMap<_M_>\n+\u00a0 Map of x-coordinates of a Point-map. More...\n+\u00a0\n+class \u00a0ConstXMap<_M_>\n+\u00a0 Constant (read only) version of XMap. More...\n+\u00a0\n+class \u00a0YMap<_M_>\n+\u00a0 Map of y-coordinates of a Point-map. More...\n+\u00a0\n+class \u00a0ConstYMap<_M_>\n+\u00a0 Constant (read only) version of YMap. More...\n+\u00a0\n+class \u00a0NormSquareMap<_M_>\n+\u00a0 Map of the normSquare() of a Point-map. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n+namespace \u00a0lemon::dim2\n+\u00a0 Tools for handling two dimensional coordinates.\n+\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00317.html", "source2": "./usr/share/doc/lemon/html/a00317.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/color.h File Reference\n+My Project: lemon/radix_sort.h File Reference\n \n \n \n \n \n \n \n@@ -70,47 +70,42 @@\n
    \n \n
    \n
    \n
    \n
    \n-Classes |\n Namespaces |\n Functions
    \n-
    color.h File Reference
    Tools and Utilities » Miscellaneous Tools
    \n+
    radix_sort.h File Reference
    Algorithms » Auxiliary Algorithms
    \n
    \n
    \n-
    #include <vector>
    \n-#include <lemon/math.h>
    \n-#include <lemon/maps.h>
    \n+

    Detailed Description

    \n+

    Linear time sorting algorithms

    \n+
    #include <vector>
    \n+#include <limits>
    \n+#include <iterator>
    \n+#include <algorithm>
    \n
    \n-\n-\n-\n-\n-\n-\n-\n-

    \n-Classes

    class  Color
     Data structure representing RGB colors. More...
     
    class  Palette
     Map ints to different Colors. More...
     
    \n \n \n \n \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n

    \n Functions

    Color distantColor (const Color &c)
     Returns a visibly distinct Color.
     
    Color distantBW (const Color &c)
     Returns black for light colors and white for the dark ones.
     
    template<typename Iterator , typename Functor >
    void radixSort (Iterator first, Iterator last, Functor functor)
     Sorts the STL compatible range into ascending order.
     
    template<typename Iterator , typename Functor >
    void stableRadixSort (Iterator first, Iterator last, Functor functor)
     Sorts the STL compatible range into ascending order in a stable way.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,35 +5,33 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces | Functions\n-color.h File Reference\n-Tools_and_Utilities \u00bb Miscellaneous_Tools\n+Namespaces | Functions\n+radix_sort.h File Reference\n+Algorithms \u00bb Auxiliary_Algorithms\n+***** Detailed Description *****\n+Linear time sorting algorithms\n #include \n-#include \n-#include \n- Classes\n-class \u00a0Color\n-\u00a0 Data structure representing RGB colors. More...\n-\u00a0\n-class \u00a0Palette\n-\u00a0 Map ints to different Colors. More...\n-\u00a0\n+#include \n+#include \n+#include \n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n Functions\n-Color\u00a0distantColor (const Color &c)\n-\u00a0 Returns a visibly distinct Color.\n+template\n+void\u00a0radixSort (Iterator first, Iterator last, Functor functor)\n+\u00a0 Sorts the STL compatible range into ascending order.\n \u00a0\n-Color\u00a0distantBW (const Color &c)\n-\u00a0 Returns black for light colors and white for the dark ones.\n+template\n+void\u00a0stableRadixSort (Iterator first, Iterator last, Functor functor)\n+\u00a0 Sorts the STL compatible range into ascending order in a stable way.\n \u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00320.html", "source2": "./usr/share/doc/lemon/html/a00320.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/glpk.cc File Reference\n+My Project: lemon/glpk.h File Reference\n \n \n \n \n \n \n \n@@ -70,21 +70,33 @@\n
    \n \n
    \n
    \n
    \n
    \n+Classes |\n Namespaces
    \n-
    glpk.cc File Reference
    \n+
    glpk.h File Reference
    General Optimization Tools » LP and MIP Solvers
    \n
    \n
    \n-
    #include <lemon/glpk.h>
    \n-#include <lemon/assert.h>
    \n+
    #include <lemon/lp_base.h>
    \n
    \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+

    \n+Classes

    class  GlpkBase
     Base interface for the GLPK LP and MIP solver. More...
     
    class  GlpkLp
     Interface for the GLPK LP solver. More...
     
    class  GlpkMip
     Interface for the GLPK MIP solver. More...
     
    \n \n \n \n \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n
    \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,18 +5,28 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Namespaces\n-glpk.cc File Reference\n-#include \n-#include \n+Classes | Namespaces\n+glpk.h File Reference\n+General_Optimization_Tools \u00bb LP_and_MIP_Solvers\n+#include \n+ Classes\n+class \u00a0GlpkBase\n+\u00a0 Base interface for the GLPK LP and MIP solver. More...\n+\u00a0\n+class \u00a0GlpkLp\n+\u00a0 Interface for the GLPK LP solver. More...\n+\u00a0\n+class \u00a0GlpkMip\n+\u00a0 Interface for the GLPK MIP solver. More...\n+\u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00323.html", "source2": "./usr/share/doc/lemon/html/a00323.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/greedy_tsp.h File Reference\n+My Project: lemon/hartmann_orlin_mmc.h File Reference\n \n \n \n \n \n \n \n@@ -72,26 +72,37 @@\n
  • lemon
    • \n
    \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    greedy_tsp.h File Reference
    Algorithms » Traveling Salesman Problem
    \n+
    hartmann_orlin_mmc.h File Reference
    Algorithms » Minimum Mean Cycle Algorithms
    \n
    \n
    \n
    #include <vector>
    \n-#include <algorithm>
    \n-#include <lemon/full_graph.h>
    \n-#include <lemon/unionfind.h>
    \n+#include <limits>
    \n+#include <lemon/core.h>
    \n+#include <lemon/path.h>
    \n+#include <lemon/tolerance.h>
    \n+#include <lemon/connectivity.h>
    \n
    \n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  GreedyTsp< CM >
     Greedy algorithm for symmetric TSP. More...
    struct  HartmannOrlinMmcDefaultTraits< GR, CM >
     Default traits class of HartmannOrlinMmc class. More...
     
    class  HartmannOrlinMmc< GR, CM, TR >
     Implementation of the Hartmann-Orlin algorithm for finding a minimum mean cycle. More...
     
    struct  HartmannOrlinMmc< GR, CM, TR >::SetLargeCost< T >
     Named parameter for setting LargeCost type. More...
     
    struct  HartmannOrlinMmc< GR, CM, TR >::SetPath< T >
     Named parameter for setting Path type. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,23 +6,35 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-greedy_tsp.h File Reference\n-Algorithms \u00bb Traveling_Salesman_Problem\n+hartmann_orlin_mmc.h File Reference\n+Algorithms \u00bb Minimum_Mean_Cycle_Algorithms\n #include \n-#include \n-#include \n-#include \n+#include \n+#include \n+#include \n+#include \n+#include \n Classes\n-class \u00a0GreedyTsp<_CM_>\n-\u00a0 Greedy algorithm for symmetric TSP. More...\n+struct \u00a0HartmannOrlinMmcDefaultTraits<_GR,_CM_>\n+\u00a0 Default traits class of HartmannOrlinMmc class. More...\n+\u00a0\n+ class \u00a0HartmannOrlinMmc<_GR,_CM,_TR_>\n+\u00a0 Implementation of the Hartmann-Orlin algorithm for finding a minimum\n+ mean cycle. More...\n+\u00a0\n+struct \u00a0HartmannOrlinMmc<_GR,_CM,_TR_>::SetLargeCost<_T_>\n+\u00a0 Named_parameter for setting LargeCost type. More...\n+\u00a0\n+struct \u00a0HartmannOrlinMmc<_GR,_CM,_TR_>::SetPath<_T_>\n+\u00a0 Named_parameter for setting Path type. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00326.html", "source2": "./usr/share/doc/lemon/html/a00326.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/bucket_heap.h File Reference\n+My Project: lemon/soplex.cc File Reference\n \n \n \n \n \n \n \n@@ -70,32 +70,22 @@\n
    \n \n
    \n \n
    \n
    \n-Classes |\n Namespaces
    \n-
    bucket_heap.h File Reference
    Data Structures » Heap Structures
    \n+
    soplex.cc File Reference
    \n
    \n
    \n-
    #include <vector>
    \n-#include <utility>
    \n-#include <functional>
    \n+
    #include <iostream>
    \n+#include <lemon/soplex.h>
    \n+#include <spxout.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n-\n-\n-

    \n-Classes

    class  BucketHeap< IM, MIN >
     Bucket heap data structure. More...
     
    class  SimpleBucketHeap< IM, MIN >
     Simplified bucket heap data structure. More...
     
    \n \n \n \n \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n
    \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,27 +5,19 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces\n-bucket_heap.h File Reference\n-Data_Structures \u00bb Heap_Structures\n-#include \n-#include \n-#include \n- Classes\n-class \u00a0BucketHeap<_IM,_MIN_>\n-\u00a0 Bucket heap data structure. More...\n-\u00a0\n-class \u00a0SimpleBucketHeap<_IM,_MIN_>\n-\u00a0 Simplified bucket heap data structure. More...\n-\u00a0\n+Namespaces\n+soplex.cc File Reference\n+#include \n+#include \n+#include \n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00329.html", "source2": "./usr/share/doc/lemon/html/a00329.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/core.h File Reference\n+My Project: lemon/quad_heap.h File Reference\n \n \n \n \n \n \n \n@@ -71,148 +71,33 @@\n \n \n \n
    \n
    \n Classes |\n-Namespaces |\n-Macros |\n-Functions
    \n-
    core.h File Reference
    \n+Namespaces
    \n+
    quad_heap.h File Reference
    Data Structures » Heap Structures
    \n \n
    \n-

    Detailed Description

    \n-

    This header file contains core utilities for LEMON. It is automatically included by all graph types, therefore it usually do not have to be included directly.

    \n-
    #include <vector>
    \n-#include <algorithm>
    \n-#include <lemon/config.h>
    \n-#include <lemon/bits/enable_if.h>
    \n-#include <lemon/bits/traits.h>
    \n-#include <lemon/assert.h>
    \n+
    #include <vector>
    \n+#include <utility>
    \n+#include <functional>
    \n
    \n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    struct  Invalid
     Dummy type to make it easier to create invalid iterators. More...
     
    class  DigraphCopy< From, To >
     Class to copy a digraph. More...
     
    class  GraphCopy< From, To >
     Class to copy a graph. More...
     
    class  BpGraphCopy< From, To >
     Class to copy a bipartite graph. More...
     
    class  ConArcIt< GR >
     Iterator for iterating on parallel arcs connecting the same nodes. More...
     
    class  ConEdgeIt< GR >
     Iterator for iterating on parallel edges connecting the same nodes. More...
     
    class  DynArcLookUp< GR >
     Dynamic arc look-up between given endpoints. More...
     
    class  ArcLookUp< GR >
     Fast arc look-up between given endpoints. More...
     
    class  AllArcLookUp< GR >
     Fast look-up of all arcs between given endpoints. More...
    class  QuadHeap< PR, IM, CMP >
     Fourary (quaternary) heap data structure. More...
     
    \n \n \n \n \n-

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-

    \n-Macros

    #define DIGRAPH_TYPEDEFS(Digraph)
     Create convenience typedefs for the digraph types and iterators.
     
    #define TEMPLATE_DIGRAPH_TYPEDEFS(Digraph)
     Create convenience typedefs for the digraph types and iterators.
     
    #define GRAPH_TYPEDEFS(Graph)
     Create convenience typedefs for the graph types and iterators.
     
    #define TEMPLATE_GRAPH_TYPEDEFS(Graph)
     Create convenience typedefs for the graph types and iterators.
     
    #define BPGRAPH_TYPEDEFS(BpGraph)
     Create convenience typedefs for the bipartite graph types and iterators.
     
    #define TEMPLATE_BPGRAPH_TYPEDEFS(BpGraph)
     Create convenience typedefs for the bipartite graph types and iterators.
     
    \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n

    \n-Functions

    template<typename Graph , typename Item >
    int countItems (const Graph &g)
     Function to count the items in a graph.
     
    template<typename Graph >
    int countNodes (const Graph &g)
     Function to count the nodes in the graph.
     
    template<typename Graph >
    int countRedNodes (const Graph &g)
     Function to count the red nodes in the graph.
     
    template<typename Graph >
    int countBlueNodes (const Graph &g)
     Function to count the blue nodes in the graph.
     
    template<typename Graph >
    int countArcs (const Graph &g)
     Function to count the arcs in the graph.
     
    template<typename Graph >
    int countEdges (const Graph &g)
     Function to count the edges in the graph.
     
    template<typename Graph >
    int countOutArcs (const Graph &g, const typename Graph::Node &n)
     Function to count the number of the out-arcs from node n.
     
    template<typename Graph >
    int countInArcs (const Graph &g, const typename Graph::Node &n)
     Function to count the number of the in-arcs to node n.
     
    template<typename Graph >
    int countIncEdges (const Graph &g, const typename Graph::Node &n)
     Function to count the number of the inc-edges to node n.
     
    template<typename GR >
    bool undirected (const GR &g)
     Check whether a graph is undirected.
     
    template<typename From , typename To >
    DigraphCopy< From, To > digraphCopy (const From &from, To &to)
     Copy a digraph to another digraph.
     
    template<typename From , typename To >
    GraphCopy< From, To > graphCopy (const From &from, To &to)
     Copy a graph to another graph.
     
    template<typename From , typename To >
    BpGraphCopy< From, To > bpGraphCopy (const From &from, To &to)
     Copy a graph to another graph.
     
    template<typename Graph >
    Graph::Arc findArc (const Graph &g, typename Graph::Node u, typename Graph::Node v, typename Graph::Arc prev=INVALID)
     Find an arc between two nodes of a digraph.
     
    template<typename Graph >
    Graph::Edge findEdge (const Graph &g, typename Graph::Node u, typename Graph::Node v, typename Graph::Edge p=INVALID)
     Find an edge between two nodes of a graph.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,149 +5,25 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces | Macros | Functions\n-core.h File Reference\n-***** Detailed Description *****\n-This header file contains core utilities for LEMON. It is automatically\n-included by all graph types, therefore it usually do not have to be included\n-directly.\n+Classes | Namespaces\n+quad_heap.h File Reference\n+Data_Structures \u00bb Heap_Structures\n #include \n-#include \n-#include \n-#include \n-#include \n-#include \n+#include \n+#include \n Classes\n-struct \u00a0Invalid\n-\u00a0 Dummy type to make it easier to create invalid iterators. More...\n-\u00a0\n- class \u00a0DigraphCopy<_From,_To_>\n-\u00a0 Class to copy a digraph. More...\n-\u00a0\n- class \u00a0GraphCopy<_From,_To_>\n-\u00a0 Class to copy a graph. More...\n-\u00a0\n- class \u00a0BpGraphCopy<_From,_To_>\n-\u00a0 Class to copy a bipartite graph. More...\n-\u00a0\n- class \u00a0ConArcIt<_GR_>\n-\u00a0 Iterator for iterating on parallel arcs connecting the same nodes.\n- More...\n-\u00a0\n- class \u00a0ConEdgeIt<_GR_>\n-\u00a0 Iterator for iterating on parallel edges connecting the same nodes.\n- More...\n-\u00a0\n- class \u00a0DynArcLookUp<_GR_>\n-\u00a0 Dynamic arc look-up between given endpoints. More...\n-\u00a0\n- class \u00a0ArcLookUp<_GR_>\n-\u00a0 Fast arc look-up between given endpoints. More...\n-\u00a0\n- class \u00a0AllArcLookUp<_GR_>\n-\u00a0 Fast look-up of all arcs between given endpoints. More...\n+class \u00a0QuadHeap<_PR,_IM,_CMP_>\n+\u00a0 Fourary (quaternary) heap data structure. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n- Macros\n-#define\u00a0DIGRAPH_TYPEDEFS(Digraph)\n-\u00a0 Create convenience typedefs for the digraph types and iterators.\n-\u00a0\n-#define\u00a0TEMPLATE_DIGRAPH_TYPEDEFS(Digraph)\n-\u00a0 Create convenience typedefs for the digraph types and iterators.\n-\u00a0\n-#define\u00a0GRAPH_TYPEDEFS(Graph)\n-\u00a0 Create convenience typedefs for the graph types and iterators.\n-\u00a0\n-#define\u00a0TEMPLATE_GRAPH_TYPEDEFS(Graph)\n-\u00a0 Create convenience typedefs for the graph types and iterators.\n-\u00a0\n-#define\u00a0BPGRAPH_TYPEDEFS(BpGraph)\n-\u00a0 Create convenience typedefs for the bipartite graph types and\n- iterators.\n-\u00a0\n-#define\u00a0TEMPLATE_BPGRAPH_TYPEDEFS(BpGraph)\n-\u00a0 Create convenience typedefs for the bipartite graph types and\n- iterators.\n-\u00a0\n- Functions\n-template\n- int\u00a0countItems (const Graph &g)\n-\u00a0 Function to count the items in a graph.\n-\u00a0\n-template\n- int\u00a0countNodes (const Graph &g)\n-\u00a0 Function to count the nodes in the graph.\n-\u00a0\n-template\n- int\u00a0countRedNodes (const Graph &g)\n-\u00a0 Function to count the red nodes in the graph.\n-\u00a0\n-template\n- int\u00a0countBlueNodes (const Graph &g)\n-\u00a0 Function to count the blue nodes in the graph.\n-\u00a0\n-template\n- int\u00a0countArcs (const Graph &g)\n-\u00a0 Function to count the arcs in the graph.\n-\u00a0\n-template\n- int\u00a0countEdges (const Graph &g)\n-\u00a0 Function to count the edges in the graph.\n-\u00a0\n-template\n- int\u00a0countOutArcs (const Graph &g, const typename Graph::\n- Node &n)\n-\u00a0 Function to count the number of the out-arcs from node\n- n.\n-\u00a0\n-template\n- int\u00a0countInArcs (const Graph &g, const typename Graph::\n- Node &n)\n-\u00a0 Function to count the number of the in-arcs to node n.\n-\n-\u00a0\n-template\n- int\u00a0countIncEdges (const Graph &g, const typename Graph::\n- Node &n)\n-\u00a0 Function to count the number of the inc-edges to node\n- n.\n-\u00a0\n-template\n- bool\u00a0undirected (const GR &g)\n-\u00a0 Check whether a graph is undirected.\n-\u00a0\n-template\n-DigraphCopy< From, To >\u00a0digraphCopy (const From &from, To &to)\n-\u00a0 Copy a digraph to another digraph.\n-\u00a0\n-template\n- GraphCopy< From, To >\u00a0graphCopy (const From &from, To &to)\n-\u00a0 Copy a graph to another graph.\n-\u00a0\n-template\n-BpGraphCopy< From, To >\u00a0bpGraphCopy (const From &from, To &to)\n-\u00a0 Copy a graph to another graph.\n-\u00a0\n-template\n- Graph::Arc\u00a0findArc (const Graph &g, typename Graph::Node u,\n- typename Graph::Node v, typename Graph::Arc\n- prev=INVALID)\n-\u00a0 Find an arc between two nodes of a digraph.\n-\u00a0\n-template\n- Graph::Edge\u00a0findEdge (const Graph &g, typename Graph::Node u,\n- typename Graph::Node v, typename Graph::Edge\n- p=INVALID)\n-\u00a0 Find an edge between two nodes of a graph.\n-\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00332.html", "source2": "./usr/share/doc/lemon/html/a00332.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/cbc.cc File Reference\n+My Project: lemon/network_simplex.h File Reference\n \n \n \n \n \n \n \n@@ -70,37 +70,31 @@\n
    \n \n
    \n
    \n
    \n
    \n+Classes |\n Namespaces
    \n-
    cbc.cc File Reference
    \n+
    network_simplex.h File Reference
    Algorithms » Minimum Cost Flow Algorithms
    \n
    \n
    \n-
    #include "cbc.h"
    \n-#include <coin/CoinModel.hpp>
    \n-#include <coin/CbcModel.hpp>
    \n-#include <coin/OsiSolverInterface.hpp>
    \n-#include "coin/OsiClpSolverInterface.hpp"
    \n-#include "coin/CbcCutGenerator.hpp"
    \n-#include "coin/CbcHeuristicLocal.hpp"
    \n-#include "coin/CbcHeuristicGreedy.hpp"
    \n-#include "coin/CbcHeuristicFPump.hpp"
    \n-#include "coin/CbcHeuristicRINS.hpp"
    \n-#include "coin/CglGomory.hpp"
    \n-#include "coin/CglProbing.hpp"
    \n-#include "coin/CglKnapsackCover.hpp"
    \n-#include "coin/CglOddHole.hpp"
    \n-#include "coin/CglClique.hpp"
    \n-#include "coin/CglFlowCover.hpp"
    \n-#include "coin/CglMixedIntegerRounding.hpp"
    \n-#include "coin/CbcHeuristic.hpp"
    \n+
    #include <vector>
    \n+#include <limits>
    \n+#include <algorithm>
    \n+#include <lemon/core.h>
    \n+#include <lemon/math.h>
    \n
    \n+\n+\n+\n+\n+

    \n+Classes

    class  NetworkSimplex< GR, V, C >
     Implementation of the primal Network Simplex algorithm for finding a minimum cost flow. More...
     
    \n \n \n \n \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n
    \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,34 +5,27 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Namespaces\n-cbc.cc File Reference\n-#include \"cbc.h\"\n-#include \n-#include \n-#include \n-#include \"coin/OsiClpSolverInterface.hpp\"\n-#include \"coin/CbcCutGenerator.hpp\"\n-#include \"coin/CbcHeuristicLocal.hpp\"\n-#include \"coin/CbcHeuristicGreedy.hpp\"\n-#include \"coin/CbcHeuristicFPump.hpp\"\n-#include \"coin/CbcHeuristicRINS.hpp\"\n-#include \"coin/CglGomory.hpp\"\n-#include \"coin/CglProbing.hpp\"\n-#include \"coin/CglKnapsackCover.hpp\"\n-#include \"coin/CglOddHole.hpp\"\n-#include \"coin/CglClique.hpp\"\n-#include \"coin/CglFlowCover.hpp\"\n-#include \"coin/CglMixedIntegerRounding.hpp\"\n-#include \"coin/CbcHeuristic.hpp\"\n+Classes | Namespaces\n+network_simplex.h File Reference\n+Algorithms \u00bb Minimum_Cost_Flow_Algorithms\n+#include \n+#include \n+#include \n+#include \n+#include \n+ Classes\n+class \u00a0NetworkSimplex<_GR,_V,_C_>\n+\u00a0 Implementation of the primal Network Simplex algorithm for finding a\n+ minimum_cost_flow. More...\n+\u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00335.html", "source2": "./usr/share/doc/lemon/html/a00335.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/grosso_locatelli_pullan_mc.h File Reference\n+My Project: lemon/opt2_tsp.h File Reference\n \n \n \n \n \n \n \n@@ -72,29 +72,24 @@\n
  • lemon
    • \n
    \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    grosso_locatelli_pullan_mc.h File Reference
    Algorithms » Approximation Algorithms
    \n+
    opt2_tsp.h File Reference
    Algorithms » Traveling Salesman Problem
    \n
    \n
    \n
    #include <vector>
    \n-#include <limits>
    \n-#include <lemon/core.h>
    \n-#include <lemon/random.h>
    \n+#include <lemon/full_graph.h>
    \n
    \n \n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    class  GrossoLocatelliPullanMc< GR >
     Implementation of the iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem. More...
     
    class  GrossoLocatelliPullanMc< GR >::CliqueNodeIt
     Iterator to list the nodes of the found clique. More...
    class  Opt2Tsp< CM >
     2-opt algorithm for symmetric TSP. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,27 +6,21 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-grosso_locatelli_pullan_mc.h File Reference\n-Algorithms \u00bb Approximation_Algorithms\n+opt2_tsp.h File Reference\n+Algorithms \u00bb Traveling_Salesman_Problem\n #include \n-#include \n-#include \n-#include \n+#include \n Classes\n-class \u00a0GrossoLocatelliPullanMc<_GR_>\n-\u00a0 Implementation of the iterated local search algorithm of Grosso,\n- Locatelli, and Pullan for the maximum clique problem. More...\n-\u00a0\n-class \u00a0GrossoLocatelliPullanMc<_GR_>::CliqueNodeIt\n-\u00a0 Iterator to list the nodes of the found clique. More...\n+class \u00a0Opt2Tsp<_CM_>\n+\u00a0 2-opt algorithm for symmetric TSP. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00338.html", "source2": "./usr/share/doc/lemon/html/a00338.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/hao_orlin.h File Reference\n+My Project: lemon/path.h File Reference\n \n \n \n \n \n \n \n@@ -71,38 +71,83 @@\n \n \n \n
    \n
    \n Classes |\n-Namespaces
    \n-
    hao_orlin.h File Reference
    Algorithms » Minimum Cut Algorithms
    \n+Namespaces |\n+Functions
    \n+
    path.h File Reference
    Data Structures » Path Structures
    \n \n
    \n-

    Detailed Description

    \n-

    Implementation of the Hao-Orlin algorithm for finding a minimum cut in a digraph.

    \n-
    #include <vector>
    \n-#include <list>
    \n-#include <limits>
    \n-#include <lemon/maps.h>
    \n-#include <lemon/core.h>
    \n-#include <lemon/tolerance.h>
    \n+
    #include <vector>
    \n+#include <algorithm>
    \n+#include <lemon/error.h>
    \n+#include <lemon/core.h>
    \n+#include <lemon/concepts/path.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  HaoOrlin< GR, CAP, TOL >
     Hao-Orlin algorithm for finding a minimum cut in a digraph. More...
    class  Path< GR >
     A structure for representing directed paths in a digraph. More...
     
    class  Path< GR >::ArcIt
     LEMON style iterator for path arcs. More...
     
    class  SimplePath< GR >
     A structure for representing directed paths in a digraph. More...
     
    class  SimplePath< GR >::ArcIt
     Iterator class to iterate on the arcs of the paths. More...
     
    class  ListPath< GR >
     A structure for representing directed paths in a digraph. More...
     
    class  ListPath< GR >::ArcIt
     Iterator class to iterate on the arcs of the paths. More...
     
    class  StaticPath< GR >
     A structure for representing directed paths in a digraph. More...
     
    class  StaticPath< GR >::ArcIt
     Iterator class to iterate on the arcs of the paths. More...
     
    class  PathNodeIt< Path >
     Class which helps to iterate through the nodes of a path. More...
     
    \n \n \n \n \n+

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n

    \n+Functions

    template<typename From , typename To >
    void pathCopy (const From &from, To &to)
     Make a copy of a path.
     
    template<typename To , typename From >
    void copyPath (To &to, const From &from)
     Deprecated version of pathCopy().
     
    template<typename Digraph , typename Path >
    bool checkPath (const Digraph &digraph, const Path &path)
     Check the consistency of a path.
     
    template<typename Digraph , typename Path >
    Digraph::Node pathSource (const Digraph &digraph, const Path &path)
     The source of a path.
     
    template<typename Digraph , typename Path >
    Digraph::Node pathTarget (const Digraph &digraph, const Path &path)
     The target of a path.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,31 +5,72 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces\n-hao_orlin.h File Reference\n-Algorithms \u00bb Minimum_Cut_Algorithms\n-***** Detailed Description *****\n-Implementation of the Hao-Orlin algorithm for finding a minimum cut in a\n-digraph.\n+Classes | Namespaces | Functions\n+path.h File Reference\n+Data_Structures \u00bb Path_Structures\n #include \n-#include \n-#include \n-#include \n+#include \n+#include \n #include \n-#include \n+#include \n Classes\n-class \u00a0HaoOrlin<_GR,_CAP,_TOL_>\n-\u00a0 Hao-Orlin algorithm for finding a minimum cut in a digraph. More...\n+class \u00a0Path<_GR_>\n+\u00a0 A structure for representing directed paths in a digraph. More...\n+\u00a0\n+class \u00a0Path<_GR_>::ArcIt\n+\u00a0 LEMON style iterator for path arcs. More...\n+\u00a0\n+class \u00a0SimplePath<_GR_>\n+\u00a0 A structure for representing directed paths in a digraph. More...\n+\u00a0\n+class \u00a0SimplePath<_GR_>::ArcIt\n+\u00a0 Iterator class to iterate on the arcs of the paths. More...\n+\u00a0\n+class \u00a0ListPath<_GR_>\n+\u00a0 A structure for representing directed paths in a digraph. More...\n+\u00a0\n+class \u00a0ListPath<_GR_>::ArcIt\n+\u00a0 Iterator class to iterate on the arcs of the paths. More...\n+\u00a0\n+class \u00a0StaticPath<_GR_>\n+\u00a0 A structure for representing directed paths in a digraph. More...\n+\u00a0\n+class \u00a0StaticPath<_GR_>::ArcIt\n+\u00a0 Iterator class to iterate on the arcs of the paths. More...\n+\u00a0\n+class \u00a0PathNodeIt<_Path_>\n+\u00a0 Class which helps to iterate through the nodes of a path. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n+ Functions\n+template\n+ void\u00a0pathCopy (const From &from, To &to)\n+\u00a0 Make a copy of a path.\n+\u00a0\n+template\n+ void\u00a0copyPath (To &to, const From &from)\n+\u00a0 Deprecated version of pathCopy().\n+\u00a0\n+template\n+ bool\u00a0checkPath (const Digraph &digraph, const Path &path)\n+\u00a0 Check the consistency of a path.\n+\u00a0\n+template\n+Digraph::Node\u00a0pathSource (const Digraph &digraph, const Path &path)\n+\u00a0 The source of a path.\n+\u00a0\n+template\n+Digraph::Node\u00a0pathTarget (const Digraph &digraph, const Path &path)\n+\u00a0 The target of a path.\n+\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00341.html", "source2": "./usr/share/doc/lemon/html/a00341.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/lp_skeleton.cc File Reference\n+My Project: lemon/hao_orlin.h File Reference\n \n \n \n \n \n \n \n@@ -70,20 +70,34 @@\n
    \n \n
    \n \n
    \n
    \n+Classes |\n Namespaces
    \n-
    lp_skeleton.cc File Reference
    \n+
    hao_orlin.h File Reference
    Algorithms » Minimum Cut Algorithms
    \n
    \n
    \n-
    #include <lemon/lp_skeleton.h>
    \n+

    Detailed Description

    \n+

    Implementation of the Hao-Orlin algorithm for finding a minimum cut in a digraph.

    \n+
    #include <vector>
    \n+#include <list>
    \n+#include <limits>
    \n+#include <lemon/maps.h>
    \n+#include <lemon/core.h>
    \n+#include <lemon/tolerance.h>
    \n
    \n+\n+\n+\n+\n+

    \n+Classes

    class  HaoOrlin< GR, CAP, TOL >
     Hao-Orlin algorithm for finding a minimum cut in a digraph. More...
     
    \n \n \n \n \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n
    \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,17 +5,30 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Namespaces\n-lp_skeleton.cc File Reference\n-#include \n+Classes | Namespaces\n+hao_orlin.h File Reference\n+Algorithms \u00bb Minimum_Cut_Algorithms\n+***** Detailed Description *****\n+Implementation of the Hao-Orlin algorithm for finding a minimum cut in a\n+digraph.\n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+ Classes\n+class \u00a0HaoOrlin<_GR,_CAP,_TOL_>\n+\u00a0 Hao-Orlin algorithm for finding a minimum cut in a digraph. More...\n+\u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00344.html", "source2": "./usr/share/doc/lemon/html/a00344.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/howard_mmc.h File Reference\n+My Project: lemon/dijkstra.h File Reference\n \n \n \n \n \n \n \n@@ -71,45 +71,82 @@\n \n
    \n \n
    \n
    \n Classes |\n-Namespaces
    \n-
    howard_mmc.h File Reference
    Algorithms » Minimum Mean Cycle Algorithms
    \n+Namespaces |\n+Functions
    \n+
    dijkstra.h File Reference
    Algorithms » Shortest Path Algorithms
    \n \n
    \n-
    #include <vector>
    \n-#include <limits>
    \n-#include <lemon/core.h>
    \n-#include <lemon/path.h>
    \n-#include <lemon/tolerance.h>
    \n-#include <lemon/connectivity.h>
    \n+
    #include <limits>
    \n+#include <lemon/list_graph.h>
    \n+#include <lemon/bin_heap.h>
    \n+#include <lemon/bits/path_dump.h>
    \n+#include <lemon/core.h>
    \n+#include <lemon/error.h>
    \n+#include <lemon/maps.h>
    \n+#include <lemon/path.h>
    \n
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    struct  HowardMmcDefaultTraits< GR, CM >
     Default traits class of HowardMmc class. More...
    struct  DijkstraDefaultOperationTraits< V >
     Default operation traits for the Dijkstra algorithm class. More...
     
    class  HowardMmc< GR, CM, TR >
     Implementation of Howard's algorithm for finding a minimum mean cycle. More...
    struct  DijkstraDefaultTraits< GR, LEN >
     Default traits class of Dijkstra class. More...
     
    struct  HowardMmc< GR, CM, TR >::SetLargeCost< T >
     Named parameter for setting LargeCost type. More...
    class  Dijkstra< GR, LEN, TR >
     Dijkstra algorithm class. More...
     
    struct  HowardMmc< GR, CM, TR >::SetPath< T >
     Named parameter for setting Path type. More...
    struct  Dijkstra< GR, LEN, TR >::SetPredMap< T >
     Named parameter for setting PredMap type. More...
     
    struct  Dijkstra< GR, LEN, TR >::SetDistMap< T >
     Named parameter for setting DistMap type. More...
     
    struct  Dijkstra< GR, LEN, TR >::SetProcessedMap< T >
     Named parameter for setting ProcessedMap type. More...
     
    struct  Dijkstra< GR, LEN, TR >::SetStandardProcessedMap
     Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool>. More...
     
    struct  Dijkstra< GR, LEN, TR >::SetHeap< H, CR >
     Named parameter for setting heap and cross reference types More...
     
    struct  Dijkstra< GR, LEN, TR >::SetStandardHeap< H, CR >
     Named parameter for setting heap and cross reference types with automatic allocation More...
     
    struct  Dijkstra< GR, LEN, TR >::SetOperationTraits< T >
     Named parameter for setting OperationTraits type More...
     
    struct  DijkstraWizardDefaultTraits< GR, LEN >
     Default traits class of dijkstra() function. More...
     
    class  DijkstraWizardBase< GR, LEN >
     Default traits class used by DijkstraWizard. More...
     
    class  DijkstraWizard< TR >
     Auxiliary class for the function-type interface of Dijkstra algorithm. More...
     
    \n \n \n \n \n+

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n+\n+\n+\n+\n+\n

    \n+Functions

    template<typename GR , typename LEN >
    DijkstraWizard< DijkstraWizardBase< GR, LEN > > dijkstra (const GR &digraph, const LEN &length)
     Function-type interface for Dijkstra algorithm.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,38 +5,76 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces\n-howard_mmc.h File Reference\n-Algorithms \u00bb Minimum_Mean_Cycle_Algorithms\n-#include \n+Classes | Namespaces | Functions\n+dijkstra.h File Reference\n+Algorithms \u00bb Shortest_Path_Algorithms\n #include \n+#include \n+#include \n+#include \n #include \n+#include \n+#include \n #include \n-#include \n-#include \n Classes\n-struct \u00a0HowardMmcDefaultTraits<_GR,_CM_>\n-\u00a0 Default traits class of HowardMmc class. More...\n+struct \u00a0DijkstraDefaultOperationTraits<_V_>\n+\u00a0 Default operation traits for the Dijkstra algorithm class. More...\n \u00a0\n- class \u00a0HowardMmc<_GR,_CM,_TR_>\n-\u00a0 Implementation of Howard's algorithm for finding a minimum mean cycle.\n- More...\n+struct \u00a0DijkstraDefaultTraits<_GR,_LEN_>\n+\u00a0 Default traits class of Dijkstra class. More...\n+\u00a0\n+ class \u00a0Dijkstra<_GR,_LEN,_TR_>\n+\u00a0 Dijkstra algorithm class. More...\n+\u00a0\n+struct \u00a0Dijkstra<_GR,_LEN,_TR_>::SetPredMap<_T_>\n+\u00a0 Named_parameter for setting PredMap type. More...\n+\u00a0\n+struct \u00a0Dijkstra<_GR,_LEN,_TR_>::SetDistMap<_T_>\n+\u00a0 Named_parameter for setting DistMap type. More...\n+\u00a0\n+struct \u00a0Dijkstra<_GR,_LEN,_TR_>::SetProcessedMap<_T_>\n+\u00a0 Named_parameter for setting ProcessedMap type. More...\n+\u00a0\n+struct \u00a0Dijkstra<_GR,_LEN,_TR_>::SetStandardProcessedMap\n+\u00a0 Named_parameter for setting ProcessedMap type to be Digraph::\n+ NodeMap. More...\n \u00a0\n-struct \u00a0HowardMmc<_GR,_CM,_TR_>::SetLargeCost<_T_>\n-\u00a0 Named_parameter for setting LargeCost type. More...\n+struct \u00a0Dijkstra<_GR,_LEN,_TR_>::SetHeap<_H,_CR_>\n+\u00a0 Named_parameter for setting heap and cross reference types More...\n \u00a0\n-struct \u00a0HowardMmc<_GR,_CM,_TR_>::SetPath<_T_>\n-\u00a0 Named_parameter for setting Path type. More...\n+struct \u00a0Dijkstra<_GR,_LEN,_TR_>::SetStandardHeap<_H,_CR_>\n+\u00a0 Named_parameter for setting heap and cross reference types with\n+ automatic allocation More...\n+\u00a0\n+struct \u00a0Dijkstra<_GR,_LEN,_TR_>::SetOperationTraits<_T_>\n+\u00a0 Named_parameter for setting OperationTraits type More...\n+\u00a0\n+struct \u00a0DijkstraWizardDefaultTraits<_GR,_LEN_>\n+\u00a0 Default traits class of dijkstra() function. More...\n+\u00a0\n+ class \u00a0DijkstraWizardBase<_GR,_LEN_>\n+\u00a0 Default traits class used by DijkstraWizard. More...\n+\u00a0\n+ class \u00a0DijkstraWizard<_TR_>\n+\u00a0 Auxiliary class for the function-type interface of Dijkstra algorithm.\n+ More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n+ Functions\n+template\n+DijkstraWizard< DijkstraWizardBase< GR, dijkstra (const GR &digraph, const LEN\n+ LEN > >\u00a0&length)\n+\u00a0 Function-type interface for Dijkstra\n+ algorithm.\n+\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00347.html", "source2": "./usr/share/doc/lemon/html/a00347.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/concept_check.h File Reference\n+My Project: lemon/error.h File Reference\n \n \n \n \n \n \n \n@@ -70,38 +70,43 @@\n
    \n \n
    \n
    \n
    \n
    \n-Namespaces |\n-Functions
    \n-
    concept_check.h File Reference
    \n+Classes |\n+Namespaces
    \n+
    error.h File Reference
    Tools and Utilities » Exceptions
    \n \n
    \n-\n+
    #include <exception>
    \n+#include <string>
    \n+#include <sstream>
    \n+#include <iostream>
    \n+#include <cstdlib>
    \n+#include <memory>
    \n+
    \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+

    \n+Classes

    class  Exception
     Generic exception class. More...
     
    class  IoError
     Input-Output error. More...
     
    class  FormatError
     Format error. More...
     
    \n \n \n \n \n-

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n-\n-\n-\n-\n

    \n-Functions

    \n-template<class Concept >
    void function_requires ()
     
     
    \n-template<typename Concept , typename Type >
    void checkConcept ()
     
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,26 +5,34 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Namespaces | Functions\n-concept_check.h File Reference\n- Namespaces\n-namespace \u00a0lemon\n-\u00a0 The namespace of LEMON.\n-\u00a0\n- Functions\n- template\n-void\u00a0function_requires ()\n+Classes | Namespaces\n+error.h File Reference\n+Tools_and_Utilities \u00bb Exceptions\n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+ Classes\n+class \u00a0Exception\n+\u00a0 Generic exception class. More...\n \u00a0\n+class \u00a0IoError\n+\u00a0 Input-Output error. More...\n \u00a0\n- template\n-void\u00a0checkConcept ()\n+class \u00a0FormatError\n+\u00a0 Format error. More...\n \u00a0\n+ Namespaces\n+namespace \u00a0lemon\n+\u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00350.html", "source2": "./usr/share/doc/lemon/html/a00350.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/lgf_reader.h File Reference\n+My Project: lemon/cplex.h File Reference\n \n \n \n \n \n \n \n@@ -72,43 +72,36 @@\n
  • lemon
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    lgf_reader.h File Reference
    Input-Output » LEMON Graph Format
    \n+
    cplex.h File Reference
    \n
    \n
    \n-
    #include <iostream>
    \n-#include <fstream>
    \n-#include <sstream>
    \n-#include <set>
    \n-#include <map>
    \n-#include <lemon/core.h>
    \n-#include <lemon/lgf_writer.h>
    \n-#include <lemon/concept_check.h>
    \n-#include <lemon/concepts/maps.h>
    \n+
    #include <lemon/lp_base.h>
    \n+#include <lemon/bits/lock.h>
    \n
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Classes

    class  DigraphReader< DGR >
     LGF reader for directed graphs More...
    class  CplexEnv
     Reference counted wrapper around cpxenv pointer. More...
     
    class  GraphReader< GR >
     LGF reader for undirected graphs More...
    class  CplexEnv::LicenseError
     This exception is thrown when the license check is not sufficient. More...
     
    class  BpGraphReader< BGR >
     LGF reader for bipartite graphs More...
    class  CplexBase
     Base interface for the CPLEX LP and MIP solver. More...
     
    class  SectionReader
     Section reader class. More...
    class  CplexLp
     Interface for the CPLEX LP solver. More...
     
    class  LgfContents
     Reader for the contents of the LGF file. More...
    class  CplexMip
     Interface for the CPLEX MIP solver. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,40 +6,33 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-lgf_reader.h File Reference\n-Input-Output \u00bb LEMON_Graph_Format\n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n+cplex.h File Reference\n+#include \n+#include \n Classes\n-class \u00a0DigraphReader<_DGR_>\n-\u00a0 LGF reader for directed graphs More...\n+class \u00a0CplexEnv\n+\u00a0 Reference counted wrapper around cpxenv pointer. More...\n \u00a0\n-class \u00a0GraphReader<_GR_>\n-\u00a0 LGF reader for undirected graphs More...\n+class \u00a0CplexEnv::LicenseError\n+\u00a0 This exception is thrown when the license check is not sufficient.\n+ More...\n \u00a0\n-class \u00a0BpGraphReader<_BGR_>\n-\u00a0 LGF reader for bipartite graphs More...\n+class \u00a0CplexBase\n+\u00a0 Base interface for the CPLEX LP and MIP solver. More...\n \u00a0\n-class \u00a0SectionReader\n-\u00a0 Section reader class. More...\n+class \u00a0CplexLp\n+\u00a0 Interface for the CPLEX LP solver. More...\n \u00a0\n-class \u00a0LgfContents\n-\u00a0 Reader for the contents of the LGF file. More...\n+class \u00a0CplexMip\n+\u00a0 Interface for the CPLEX MIP solver. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00353.html", "source2": "./usr/share/doc/lemon/html/a00353.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/dfs.h File Reference\n+My Project: lemon/bellman_ford.h File Reference\n \n \n \n \n \n \n \n@@ -73,81 +73,70 @@\n \n \n
    \n
    \n Classes |\n Namespaces |\n Functions
    \n-
    dfs.h File Reference
    Algorithms » Graph Search
    \n+
    bellman_ford.h File Reference
    Algorithms » Shortest Path Algorithms
    \n
    \n
    \n-
    #include <lemon/list_graph.h>
    \n+
    #include <lemon/list_graph.h>
    \n #include <lemon/bits/path_dump.h>
    \n-#include <lemon/core.h>
    \n-#include <lemon/error.h>
    \n-#include <lemon/maps.h>
    \n-#include <lemon/path.h>
    \n+#include <lemon/core.h>
    \n+#include <lemon/error.h>
    \n+#include <lemon/maps.h>
    \n+#include <lemon/path.h>
    \n+#include <limits>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    struct  DfsDefaultTraits< GR >
     Default traits class of Dfs class. More...
    struct  BellmanFordDefaultOperationTraits< V, has_inf >
     Default OperationTraits for the BellmanFord algorithm class. More...
     
    class  Dfs< GR, TR >
     DFS algorithm class. More...
    struct  BellmanFordDefaultTraits< GR, LEN >
     Default traits class of BellmanFord class. More...
     
    struct  Dfs< GR, TR >::SetPredMap< T >
     Named parameter for setting PredMap type. More...
    class  BellmanFord< GR, LEN, TR >
     BellmanFord algorithm class. More...
     
    struct  Dfs< GR, TR >::SetDistMap< T >
     Named parameter for setting DistMap type. More...
    struct  BellmanFord< GR, LEN, TR >::SetPredMap< T >
     Named parameter for setting PredMap type. More...
     
    struct  Dfs< GR, TR >::SetReachedMap< T >
     Named parameter for setting ReachedMap type. More...
    struct  BellmanFord< GR, LEN, TR >::SetDistMap< T >
     Named parameter for setting DistMap type. More...
     
    struct  Dfs< GR, TR >::SetProcessedMap< T >
     Named parameter for setting ProcessedMap type. More...
    struct  BellmanFord< GR, LEN, TR >::SetOperationTraits< T >
     Named parameter for setting OperationTraits type. More...
     
    struct  Dfs< GR, TR >::SetStandardProcessedMap
     Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool>. More...
    class  BellmanFord< GR, LEN, TR >::ActiveIt
     LEMON iterator for getting the active nodes. More...
     
    struct  DfsWizardDefaultTraits< GR >
     Default traits class of dfs() function. More...
    struct  BellmanFordWizardDefaultTraits< GR, LEN >
     Default traits class of bellmanFord() function. More...
     
    class  DfsWizardBase< GR >
     Default traits class used by DfsWizard. More...
    class  BellmanFordWizardBase< GR, LEN >
     Default traits class used by BellmanFordWizard. More...
     
    class  DfsWizard< TR >
     Auxiliary class for the function-type interface of DFS algorithm. More...
     
    struct  DfsVisitor< GR >
     Visitor class for DFS. More...
     
    struct  DfsVisitDefaultTraits< GR >
     Default traits class of DfsVisit class. More...
     
    class  DfsVisit< GR, VS, TR >
     DFS algorithm class with visitor interface. More...
     
    struct  DfsVisit< GR, VS, TR >::SetReachedMap< T >
     Named parameter for setting ReachedMap type. More...
    class  BellmanFordWizard< TR >
     Auxiliary class for the function-type interface of the Bellman-Ford algorithm. More...
     
    \n \n \n \n \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n-\n-\n+\n+\n+\n+\n

    \n Functions

    template<class GR >
    DfsWizard< DfsWizardBase< GR > > dfs (const GR &digraph)
     Function-type interface for DFS algorithm.
     
    template<typename GR , typename LEN >
    BellmanFordWizard< BellmanFordWizardBase< GR, LEN > > bellmanFord (const GR &digraph, const LEN &length)
     Function type interface for the Bellman-Ford algorithm.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,73 +6,63 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces | Functions\n-dfs.h File Reference\n-Algorithms \u00bb Graph_Search\n+bellman_ford.h File Reference\n+Algorithms \u00bb Shortest_Path_Algorithms\n #include \n #include \n #include \n #include \n #include \n #include \n+#include \n Classes\n-struct \u00a0DfsDefaultTraits<_GR_>\n-\u00a0 Default traits class of Dfs class. More...\n+struct \u00a0BellmanFordDefaultOperationTraits<_V,_has_inf_>\n+\u00a0 Default OperationTraits for the BellmanFord algorithm class. More...\n \u00a0\n- class \u00a0Dfs<_GR,_TR_>\n-\u00a0 DFS algorithm class. More...\n+struct \u00a0BellmanFordDefaultTraits<_GR,_LEN_>\n+\u00a0 Default traits class of BellmanFord class. More...\n \u00a0\n-struct \u00a0Dfs<_GR,_TR_>::SetPredMap<_T_>\n+ class \u00a0BellmanFord<_GR,_LEN,_TR_>\n+\u00a0 BellmanFord algorithm class. More...\n+\u00a0\n+struct \u00a0BellmanFord<_GR,_LEN,_TR_>::SetPredMap<_T_>\n \u00a0 Named_parameter for setting PredMap type. More...\n \u00a0\n-struct \u00a0Dfs<_GR,_TR_>::SetDistMap<_T_>\n+struct \u00a0BellmanFord<_GR,_LEN,_TR_>::SetDistMap<_T_>\n \u00a0 Named_parameter for setting DistMap type. More...\n \u00a0\n-struct \u00a0Dfs<_GR,_TR_>::SetReachedMap<_T_>\n-\u00a0 Named_parameter for setting ReachedMap type. More...\n-\u00a0\n-struct \u00a0Dfs<_GR,_TR_>::SetProcessedMap<_T_>\n-\u00a0 Named_parameter for setting ProcessedMap type. More...\n-\u00a0\n-struct \u00a0Dfs<_GR,_TR_>::SetStandardProcessedMap\n-\u00a0 Named_parameter for setting ProcessedMap type to be Digraph::\n- NodeMap. More...\n-\u00a0\n-struct \u00a0DfsWizardDefaultTraits<_GR_>\n-\u00a0 Default traits class of dfs() function. More...\n-\u00a0\n- class \u00a0DfsWizardBase<_GR_>\n-\u00a0 Default traits class used by DfsWizard. More...\n-\u00a0\n- class \u00a0DfsWizard<_TR_>\n-\u00a0 Auxiliary class for the function-type interface of DFS algorithm.\n- More...\n+struct \u00a0BellmanFord<_GR,_LEN,_TR_>::SetOperationTraits<_T_>\n+\u00a0 Named_parameter for setting OperationTraits type. More...\n \u00a0\n-struct \u00a0DfsVisitor<_GR_>\n-\u00a0 Visitor class for DFS. More...\n+ class \u00a0BellmanFord<_GR,_LEN,_TR_>::ActiveIt\n+\u00a0 LEMON iterator for getting the active nodes. More...\n \u00a0\n-struct \u00a0DfsVisitDefaultTraits<_GR_>\n-\u00a0 Default traits class of DfsVisit class. More...\n+struct \u00a0BellmanFordWizardDefaultTraits<_GR,_LEN_>\n+\u00a0 Default traits class of bellmanFord() function. More...\n \u00a0\n- class \u00a0DfsVisit<_GR,_VS,_TR_>\n-\u00a0 DFS algorithm class with visitor interface. More...\n+ class \u00a0BellmanFordWizardBase<_GR,_LEN_>\n+\u00a0 Default traits class used by BellmanFordWizard. More...\n \u00a0\n-struct \u00a0DfsVisit<_GR,_VS,_TR_>::SetReachedMap<_T_>\n-\u00a0 Named_parameter for setting ReachedMap type. More...\n+ class \u00a0BellmanFordWizard<_TR_>\n+\u00a0 Auxiliary class for the function-type interface of the Bellman-Ford\n+ algorithm. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n Functions\n-template\n-DfsWizard< DfsWizardBase< GR > >\u00a0dfs (const GR &digraph)\n-\u00a0 Function-type interface for DFS algorithm.\n+template\n+ BellmanFordWizard< bellmanFord (const GR &digraph, const LEN\n+ BellmanFordWizardBase< GR, LEN > >\u00a0&length)\n+\u00a0 Function type interface for the Bellman-\n+ Ford algorithm.\n \u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00356.html", "source2": "./usr/share/doc/lemon/html/a00356.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/edmonds_karp.h File Reference\n+My Project: lemon/karp_mmc.h File Reference\n \n \n \n \n \n \n \n@@ -72,30 +72,37 @@\n
  • lemon
    • \n
    \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    edmonds_karp.h File Reference
    Algorithms » Maximum Flow Algorithms
    \n+
    karp_mmc.h File Reference
    Algorithms » Minimum Mean Cycle Algorithms
    \n
    \n
    \n-
    #include <lemon/tolerance.h>
    \n-#include <vector>
    \n+
    #include <vector>
    \n+#include <limits>
    \n+#include <lemon/core.h>
    \n+#include <lemon/path.h>
    \n+#include <lemon/tolerance.h>
    \n+#include <lemon/connectivity.h>
    \n
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n+\n+\n+\n \n

    \n Classes

    struct  EdmondsKarpDefaultTraits< GR, CAP >
     Default traits class of EdmondsKarp class. More...
    struct  KarpMmcDefaultTraits< GR, CM >
     Default traits class of KarpMmc class. More...
     
    class  EdmondsKarp< GR, CAP, TR >
     Edmonds-Karp algorithms class. More...
    class  KarpMmc< GR, CM, TR >
     Implementation of Karp's algorithm for finding a minimum mean cycle. More...
     
    struct  EdmondsKarp< GR, CAP, TR >::SetFlowMap< T >
     Named parameter for setting FlowMap type More...
    struct  KarpMmc< GR, CM, TR >::SetLargeCost< T >
     Named parameter for setting LargeCost type. More...
     
    struct  KarpMmc< GR, CM, TR >::SetPath< T >
     Named parameter for setting Path type. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,27 +6,35 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-edmonds_karp.h File Reference\n-Algorithms \u00bb Maximum_Flow_Algorithms\n-#include \n+karp_mmc.h File Reference\n+Algorithms \u00bb Minimum_Mean_Cycle_Algorithms\n #include \n+#include \n+#include \n+#include \n+#include \n+#include \n Classes\n-struct \u00a0EdmondsKarpDefaultTraits<_GR,_CAP_>\n-\u00a0 Default traits class of EdmondsKarp class. More...\n+struct \u00a0KarpMmcDefaultTraits<_GR,_CM_>\n+\u00a0 Default traits class of KarpMmc class. More...\n+\u00a0\n+ class \u00a0KarpMmc<_GR,_CM,_TR_>\n+\u00a0 Implementation of Karp's algorithm for finding a minimum mean cycle.\n+ More...\n \u00a0\n- class \u00a0EdmondsKarp<_GR,_CAP,_TR_>\n-\u00a0 Edmonds-Karp algorithms class. More...\n+struct \u00a0KarpMmc<_GR,_CM,_TR_>::SetLargeCost<_T_>\n+\u00a0 Named_parameter for setting LargeCost type. More...\n \u00a0\n-struct \u00a0EdmondsKarp<_GR,_CAP,_TR_>::SetFlowMap<_T_>\n-\u00a0 Named_parameter for setting FlowMap type More...\n+struct \u00a0KarpMmc<_GR,_CM,_TR_>::SetPath<_T_>\n+\u00a0 Named_parameter for setting Path type. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00359.html", "source2": "./usr/share/doc/lemon/html/a00359.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/bfs.h File Reference\n+My Project: lemon/assert.h File Reference\n \n \n \n \n \n \n \n@@ -70,84 +70,35 @@\n
    \n \n
    \n \n
    \n
    \n-Classes |\n Namespaces |\n-Functions
    \n-
    bfs.h File Reference
    Algorithms » Graph Search
    \n+Macros
    \n+
    assert.h File Reference
    Tools and Utilities » Exceptions
    \n \n
    \n-
    #include <lemon/list_graph.h>
    \n-#include <lemon/bits/path_dump.h>
    \n-#include <lemon/core.h>
    \n-#include <lemon/error.h>
    \n-#include <lemon/maps.h>
    \n-#include <lemon/path.h>
    \n+
    #include <lemon/error.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-

    \n-Classes

    struct  BfsDefaultTraits< GR >
     Default traits class of Bfs class. More...
     
    class  Bfs< GR, TR >
     BFS algorithm class. More...
     
    struct  Bfs< GR, TR >::SetPredMap< T >
     Named parameter for setting PredMap type. More...
     
    struct  Bfs< GR, TR >::SetDistMap< T >
     Named parameter for setting DistMap type. More...
     
    struct  Bfs< GR, TR >::SetReachedMap< T >
     Named parameter for setting ReachedMap type. More...
     
    struct  Bfs< GR, TR >::SetProcessedMap< T >
     Named parameter for setting ProcessedMap type. More...
     
    struct  Bfs< GR, TR >::SetStandardProcessedMap
     Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool>. More...
     
    struct  BfsWizardDefaultTraits< GR >
     Default traits class of bfs() function. More...
     
    class  BfsWizardBase< GR >
     Default traits class used by BfsWizard. More...
     
    class  BfsWizard< TR >
     Auxiliary class for the function-type interface of BFS algorithm. More...
     
    struct  BfsVisitor< GR >
     Visitor class for BFS. More...
     
    struct  BfsVisitDefaultTraits< GR >
     Default traits class of BfsVisit class. More...
     
    class  BfsVisit< GR, VS, TR >
     BFS algorithm class with visitor interface. More...
     
    struct  BfsVisit< GR, VS, TR >::SetReachedMap< T >
     Named parameter for setting ReachedMap type. More...
     
    \n \n \n \n \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n

    \n-Functions

    template<class GR >
    BfsWizard< BfsWizardBase< GR > > bfs (const GR &digraph)
     Function-type interface for BFS algorithm.
     

    \n+Macros

    #define LEMON_ASSERT(exp, msg)
     Macro for assertion with customizable message.
     
    #define LEMON_DEBUG(exp, msg)
     Macro for internal assertions.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,74 +5,26 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces | Functions\n-bfs.h File Reference\n-Algorithms \u00bb Graph_Search\n-#include \n-#include \n-#include \n+Namespaces | Macros\n+assert.h File Reference\n+Tools_and_Utilities \u00bb Exceptions\n #include \n-#include \n-#include \n- Classes\n-struct \u00a0BfsDefaultTraits<_GR_>\n-\u00a0 Default traits class of Bfs class. More...\n-\u00a0\n- class \u00a0Bfs<_GR,_TR_>\n-\u00a0 BFS algorithm class. More...\n-\u00a0\n-struct \u00a0Bfs<_GR,_TR_>::SetPredMap<_T_>\n-\u00a0 Named_parameter for setting PredMap type. More...\n-\u00a0\n-struct \u00a0Bfs<_GR,_TR_>::SetDistMap<_T_>\n-\u00a0 Named_parameter for setting DistMap type. More...\n-\u00a0\n-struct \u00a0Bfs<_GR,_TR_>::SetReachedMap<_T_>\n-\u00a0 Named_parameter for setting ReachedMap type. More...\n-\u00a0\n-struct \u00a0Bfs<_GR,_TR_>::SetProcessedMap<_T_>\n-\u00a0 Named_parameter for setting ProcessedMap type. More...\n-\u00a0\n-struct \u00a0Bfs<_GR,_TR_>::SetStandardProcessedMap\n-\u00a0 Named_parameter for setting ProcessedMap type to be Digraph::\n- NodeMap. More...\n-\u00a0\n-struct \u00a0BfsWizardDefaultTraits<_GR_>\n-\u00a0 Default traits class of bfs() function. More...\n-\u00a0\n- class \u00a0BfsWizardBase<_GR_>\n-\u00a0 Default traits class used by BfsWizard. More...\n-\u00a0\n- class \u00a0BfsWizard<_TR_>\n-\u00a0 Auxiliary class for the function-type interface of BFS algorithm.\n- More...\n-\u00a0\n-struct \u00a0BfsVisitor<_GR_>\n-\u00a0 Visitor class for BFS. More...\n-\u00a0\n-struct \u00a0BfsVisitDefaultTraits<_GR_>\n-\u00a0 Default traits class of BfsVisit class. More...\n-\u00a0\n- class \u00a0BfsVisit<_GR,_VS,_TR_>\n-\u00a0 BFS algorithm class with visitor interface. More...\n-\u00a0\n-struct \u00a0BfsVisit<_GR,_VS,_TR_>::SetReachedMap<_T_>\n-\u00a0 Named_parameter for setting ReachedMap type. More...\n-\u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n- Functions\n-template\n-BfsWizard< BfsWizardBase< GR > >\u00a0bfs (const GR &digraph)\n-\u00a0 Function-type interface for BFS algorithm.\n+ Macros\n+#define\u00a0LEMON_ASSERT(exp, msg)\n+\u00a0 Macro for assertion with customizable message.\n+\u00a0\n+#define\u00a0LEMON_DEBUG(exp, msg)\n+\u00a0 Macro for internal assertions.\n \u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00368.html", "source2": "./usr/share/doc/lemon/html/a00368.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/cbc.h File Reference\n+My Project: lemon/grid_graph.h File Reference\n \n \n \n \n \n \n \n@@ -72,23 +72,35 @@\n
  • lemon
    • \n
    \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    cbc.h File Reference
    General Optimization Tools » LP and MIP Solvers
    \n+
    grid_graph.h File Reference
    Data Structures » Graph Structures
    \n
    \n
    \n-
    #include <lemon/lp_base.h>
    \n+
    #include <lemon/core.h>
    \n+#include <lemon/bits/graph_extender.h>
    \n+#include <lemon/dim2.h>
    \n+#include <lemon/assert.h>
    \n
    \n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  CbcMip
     Interface for the CBC MIP solver. More...
    class  GridGraph
     Grid graph class. More...
     
    class  GridGraph::IndexMap
     Map to get the indices of the nodes as dim2::Point<int>. More...
     
    class  GridGraph::ColMap
     Map to get the column of the nodes. More...
     
    class  GridGraph::RowMap
     Map to get the row of the nodes. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,20 +6,32 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-cbc.h File Reference\n-General_Optimization_Tools \u00bb LP_and_MIP_Solvers\n-#include \n+grid_graph.h File Reference\n+Data_Structures \u00bb Graph_Structures\n+#include \n+#include \n+#include \n+#include \n Classes\n-class \u00a0CbcMip\n-\u00a0 Interface for the CBC MIP solver. More...\n+class \u00a0GridGraph\n+\u00a0 Grid graph class. More...\n+\u00a0\n+class \u00a0GridGraph::IndexMap\n+\u00a0 Map to get the indices of the nodes as dim2::Point. More...\n+\u00a0\n+class \u00a0GridGraph::ColMap\n+\u00a0 Map to get the column of the nodes. More...\n+\u00a0\n+class \u00a0GridGraph::RowMap\n+\u00a0 Map to get the row of the nodes. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00371.html", "source2": "./usr/share/doc/lemon/html/a00371.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/circulation.h File Reference\n+My Project: lemon/bin_heap.h File Reference\n \n \n \n \n \n \n \n@@ -72,37 +72,25 @@\n
  • lemon
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    circulation.h File Reference
    Algorithms » Maximum Flow Algorithms
    \n+
    bin_heap.h File Reference
    Data Structures » Heap Structures
    \n
    \n
    \n-
    #include <lemon/tolerance.h>
    \n-#include <lemon/elevator.h>
    \n-#include <limits>
    \n+
    #include <vector>
    \n+#include <utility>
    \n+#include <functional>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    struct  CirculationDefaultTraits< GR, LM, UM, SM >
     Default traits class of Circulation class. More...
     
    class  Circulation< GR, LM, UM, SM, TR >
     Push-relabel algorithm for the network circulation problem. More...
     
    struct  Circulation< GR, LM, UM, SM, TR >::SetFlowMap< T >
     Named parameter for setting FlowMap type More...
     
    struct  Circulation< GR, LM, UM, SM, TR >::SetElevator< T >
     Named parameter for setting Elevator type More...
     
    struct  Circulation< GR, LM, UM, SM, TR >::SetStandardElevator< T >
     Named parameter for setting Elevator type with automatic allocation More...
    class  BinHeap< PR, IM, CMP >
     Binary heap data structure. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,35 +6,22 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-circulation.h File Reference\n-Algorithms \u00bb Maximum_Flow_Algorithms\n-#include \n-#include \n-#include \n+bin_heap.h File Reference\n+Data_Structures \u00bb Heap_Structures\n+#include \n+#include \n+#include \n Classes\n-struct \u00a0CirculationDefaultTraits<_GR,_LM,_UM,_SM_>\n-\u00a0 Default traits class of Circulation class. More...\n-\u00a0\n- class \u00a0Circulation<_GR,_LM,_UM,_SM,_TR_>\n-\u00a0 Push-relabel algorithm for the network circulation problem. More...\n-\u00a0\n-struct \u00a0Circulation<_GR,_LM,_UM,_SM,_TR_>::SetFlowMap<_T_>\n-\u00a0 Named_parameter for setting FlowMap type More...\n-\u00a0\n-struct \u00a0Circulation<_GR,_LM,_UM,_SM,_TR_>::SetElevator<_T_>\n-\u00a0 Named_parameter for setting Elevator type More...\n-\u00a0\n-struct \u00a0Circulation<_GR,_LM,_UM,_SM,_TR_>::SetStandardElevator<_T_>\n-\u00a0 Named_parameter for setting Elevator type with automatic allocation\n- More...\n+class \u00a0BinHeap<_PR,_IM,_CMP_>\n+\u00a0 Binary heap data structure. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00374.html", "source2": "./usr/share/doc/lemon/html/a00374.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/bellman_ford.h File Reference\n+My Project: lemon/lp_skeleton.cc File Reference\n \n \n \n \n \n \n \n@@ -70,73 +70,25 @@\n
    \n \n
    \n \n
    \n
    \n-Classes |\n-Namespaces |\n-Functions
    \n-
    bellman_ford.h File Reference
    Algorithms » Shortest Path Algorithms
    \n+Namespaces
    \n+
    lp_skeleton.cc File Reference
    \n \n
    \n-
    #include <lemon/list_graph.h>
    \n-#include <lemon/bits/path_dump.h>
    \n-#include <lemon/core.h>
    \n-#include <lemon/error.h>
    \n-#include <lemon/maps.h>
    \n-#include <lemon/path.h>
    \n-#include <limits>
    \n+
    #include <lemon/lp_skeleton.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-

    \n-Classes

    struct  BellmanFordDefaultOperationTraits< V, has_inf >
     Default OperationTraits for the BellmanFord algorithm class. More...
     
    struct  BellmanFordDefaultTraits< GR, LEN >
     Default traits class of BellmanFord class. More...
     
    class  BellmanFord< GR, LEN, TR >
     BellmanFord algorithm class. More...
     
    struct  BellmanFord< GR, LEN, TR >::SetPredMap< T >
     Named parameter for setting PredMap type. More...
     
    struct  BellmanFord< GR, LEN, TR >::SetDistMap< T >
     Named parameter for setting DistMap type. More...
     
    struct  BellmanFord< GR, LEN, TR >::SetOperationTraits< T >
     Named parameter for setting OperationTraits type. More...
     
    class  BellmanFord< GR, LEN, TR >::ActiveIt
     LEMON iterator for getting the active nodes. More...
     
    struct  BellmanFordWizardDefaultTraits< GR, LEN >
     Default traits class of bellmanFord() function. More...
     
    class  BellmanFordWizardBase< GR, LEN >
     Default traits class used by BellmanFordWizard. More...
     
    class  BellmanFordWizard< TR >
     Auxiliary class for the function-type interface of the Bellman-Ford algorithm. More...
     
    \n \n \n \n \n-

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n

    \n-Functions

    template<typename GR , typename LEN >
    BellmanFordWizard< BellmanFordWizardBase< GR, LEN > > bellmanFord (const GR &digraph, const LEN &length)
     Function type interface for the Bellman-Ford algorithm.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,64 +5,18 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces | Functions\n-bellman_ford.h File Reference\n-Algorithms \u00bb Shortest_Path_Algorithms\n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n- Classes\n-struct \u00a0BellmanFordDefaultOperationTraits<_V,_has_inf_>\n-\u00a0 Default OperationTraits for the BellmanFord algorithm class. More...\n-\u00a0\n-struct \u00a0BellmanFordDefaultTraits<_GR,_LEN_>\n-\u00a0 Default traits class of BellmanFord class. More...\n-\u00a0\n- class \u00a0BellmanFord<_GR,_LEN,_TR_>\n-\u00a0 BellmanFord algorithm class. More...\n-\u00a0\n-struct \u00a0BellmanFord<_GR,_LEN,_TR_>::SetPredMap<_T_>\n-\u00a0 Named_parameter for setting PredMap type. More...\n-\u00a0\n-struct \u00a0BellmanFord<_GR,_LEN,_TR_>::SetDistMap<_T_>\n-\u00a0 Named_parameter for setting DistMap type. More...\n-\u00a0\n-struct \u00a0BellmanFord<_GR,_LEN,_TR_>::SetOperationTraits<_T_>\n-\u00a0 Named_parameter for setting OperationTraits type. More...\n-\u00a0\n- class \u00a0BellmanFord<_GR,_LEN,_TR_>::ActiveIt\n-\u00a0 LEMON iterator for getting the active nodes. More...\n-\u00a0\n-struct \u00a0BellmanFordWizardDefaultTraits<_GR,_LEN_>\n-\u00a0 Default traits class of bellmanFord() function. More...\n-\u00a0\n- class \u00a0BellmanFordWizardBase<_GR,_LEN_>\n-\u00a0 Default traits class used by BellmanFordWizard. More...\n-\u00a0\n- class \u00a0BellmanFordWizard<_TR_>\n-\u00a0 Auxiliary class for the function-type interface of the Bellman-Ford\n- algorithm. More...\n-\u00a0\n+Namespaces\n+lp_skeleton.cc File Reference\n+#include \n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n- Functions\n-template\n- BellmanFordWizard< bellmanFord (const GR &digraph, const LEN\n- BellmanFordWizardBase< GR, LEN > >\u00a0&length)\n-\u00a0 Function type interface for the Bellman-\n- Ford algorithm.\n-\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00377.html", "source2": "./usr/share/doc/lemon/html/a00377.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/matching.h File Reference\n+My Project: lemon/lp_base.h File Reference\n \n \n \n \n \n \n \n@@ -72,43 +72,73 @@\n
  • lemon
    • \n
    \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    matching.h File Reference
    Algorithms » Matching Algorithms
    \n+
    lp_base.h File Reference
    General Optimization Tools » LP and MIP Solvers
    \n
    \n
    \n-
    #include <vector>
    \n-#include <queue>
    \n-#include <set>
    \n+
    #include <iostream>
    \n+#include <vector>
    \n+#include <map>
    \n #include <limits>
    \n-#include <lemon/core.h>
    \n-#include <lemon/unionfind.h>
    \n-#include <lemon/bin_heap.h>
    \n-#include <lemon/maps.h>
    \n-#include <lemon/fractional_matching.h>
    \n+#include <lemon/math.h>
    \n+#include <lemon/error.h>
    \n+#include <lemon/assert.h>
    \n+#include <lemon/core.h>
    \n+#include <lemon/bits/solver_bits.h>
    \n
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  MaxMatching< GR >
     Maximum cardinality matching in general graphs. More...
    class  LpBase
     Common base class for LP and MIP solvers. More...
     
    class  MaxWeightedMatching< GR, WM >
     Weighted matching in general graphs. More...
    class  LpBase::Col
     Refer to a column of the LP. More...
     
    class  MaxWeightedMatching< GR, WM >::BlossomIt
     Iterator for obtaining the nodes of a blossom. More...
    class  LpBase::ColIt
     Iterator for iterate over the columns of an LP problem. More...
     
    class  MaxWeightedPerfectMatching< GR, WM >
     Weighted perfect matching in general graphs. More...
    class  LpBase::Row
     Refer to a row of the LP. More...
     
    class  MaxWeightedPerfectMatching< GR, WM >::BlossomIt
     Iterator for obtaining the nodes of a blossom. More...
    class  LpBase::RowIt
     Iterator for iterate over the rows of an LP problem. More...
     
    class  LpBase::Expr
     Linear expression of variables and a constant component. More...
     
    class  LpBase::Expr::CoeffIt
     Iterator over the expression. More...
     
    class  LpBase::Expr::ConstCoeffIt
     Const iterator over the expression. More...
     
    class  LpBase::Constr
     Linear constraint. More...
     
    class  LpBase::DualExpr
     Linear expression of rows. More...
     
    class  LpBase::DualExpr::CoeffIt
     Iterator over the expression. More...
     
    class  LpBase::DualExpr::ConstCoeffIt
     Iterator over the expression. More...
     
    class  LpBase::UnsupportedFormatError
     Unsupported file format exception. More...
     
    class  LpSolver
     Common base class for LP solvers. More...
     
    class  MipSolver
     Common base class for MIP solvers. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,40 +6,70 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-matching.h File Reference\n-Algorithms \u00bb Matching_Algorithms\n+lp_base.h File Reference\n+General_Optimization_Tools \u00bb LP_and_MIP_Solvers\n+#include \n #include \n-#include \n-#include \n+#include \n #include \n+#include \n+#include \n+#include \n #include \n-#include \n-#include \n-#include \n-#include \n+#include \n Classes\n-class \u00a0MaxMatching<_GR_>\n-\u00a0 Maximum cardinality matching in general graphs. More...\n+class \u00a0LpBase\n+\u00a0 Common base class for LP and MIP solvers. More...\n \u00a0\n-class \u00a0MaxWeightedMatching<_GR,_WM_>\n-\u00a0 Weighted matching in general graphs. More...\n+class \u00a0LpBase::Col\n+\u00a0 Refer to a column of the LP. More...\n \u00a0\n-class \u00a0MaxWeightedMatching<_GR,_WM_>::BlossomIt\n-\u00a0 Iterator for obtaining the nodes of a blossom. More...\n+class \u00a0LpBase::ColIt\n+\u00a0 Iterator for iterate over the columns of an LP problem. More...\n \u00a0\n-class \u00a0MaxWeightedPerfectMatching<_GR,_WM_>\n-\u00a0 Weighted perfect matching in general graphs. More...\n+class \u00a0LpBase::Row\n+\u00a0 Refer to a row of the LP. More...\n \u00a0\n-class \u00a0MaxWeightedPerfectMatching<_GR,_WM_>::BlossomIt\n-\u00a0 Iterator for obtaining the nodes of a blossom. More...\n+class \u00a0LpBase::RowIt\n+\u00a0 Iterator for iterate over the rows of an LP problem. More...\n+\u00a0\n+class \u00a0LpBase::Expr\n+\u00a0 Linear expression of variables and a constant component. More...\n+\u00a0\n+class \u00a0LpBase::Expr::CoeffIt\n+\u00a0 Iterator over the expression. More...\n+\u00a0\n+class \u00a0LpBase::Expr::ConstCoeffIt\n+\u00a0 Const iterator over the expression. More...\n+\u00a0\n+class \u00a0LpBase::Constr\n+\u00a0 Linear constraint. More...\n+\u00a0\n+class \u00a0LpBase::DualExpr\n+\u00a0 Linear expression of rows. More...\n+\u00a0\n+class \u00a0LpBase::DualExpr::CoeffIt\n+\u00a0 Iterator over the expression. More...\n+\u00a0\n+class \u00a0LpBase::DualExpr::ConstCoeffIt\n+\u00a0 Iterator over the expression. More...\n+\u00a0\n+class \u00a0LpBase::UnsupportedFormatError\n+\u00a0 Unsupported file format exception. More...\n+\u00a0\n+class \u00a0LpSolver\n+\u00a0 Common base class for LP solvers. More...\n+\u00a0\n+class \u00a0MipSolver\n+\u00a0 Common base class for MIP solvers. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00380.html", "source2": "./usr/share/doc/lemon/html/a00380.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/gomory_hu.h File Reference\n+My Project: lemon/insertion_tsp.h File Reference\n \n \n \n \n \n \n \n@@ -72,33 +72,27 @@\n
  • lemon
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    gomory_hu.h File Reference
    Algorithms » Minimum Cut Algorithms
    \n+
    insertion_tsp.h File Reference
    Algorithms » Traveling Salesman Problem
    \n
    \n
    \n-
    #include <limits>
    \n-#include <lemon/core.h>
    \n-#include <lemon/preflow.h>
    \n-#include <lemon/concept_check.h>
    \n-#include <lemon/concepts/maps.h>
    \n+
    #include <vector>
    \n+#include <functional>
    \n+#include <lemon/full_graph.h>
    \n+#include <lemon/maps.h>
    \n+#include <lemon/random.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    class  GomoryHu< GR, CAP >
     Gomory-Hu cut tree algorithm. More...
     
    class  GomoryHu< GR, CAP >::MinCutNodeIt
     Iterate on the nodes of a minimum cut. More...
     
    class  GomoryHu< GR, CAP >::MinCutEdgeIt
     Iterate on the edges of a minimum cut. More...
    class  InsertionTsp< CM >
     Insertion algorithm for symmetric TSP. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,30 +6,24 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-gomory_hu.h File Reference\n-Algorithms \u00bb Minimum_Cut_Algorithms\n-#include \n-#include \n-#include \n-#include \n-#include \n+insertion_tsp.h File Reference\n+Algorithms \u00bb Traveling_Salesman_Problem\n+#include \n+#include \n+#include \n+#include \n+#include \n Classes\n-class \u00a0GomoryHu<_GR,_CAP_>\n-\u00a0 Gomory-Hu cut tree algorithm. More...\n-\u00a0\n-class \u00a0GomoryHu<_GR,_CAP_>::MinCutNodeIt\n-\u00a0 Iterate on the nodes of a minimum cut. More...\n-\u00a0\n-class \u00a0GomoryHu<_GR,_CAP_>::MinCutEdgeIt\n-\u00a0 Iterate on the edges of a minimum cut. More...\n+class \u00a0InsertionTsp<_CM_>\n+\u00a0 Insertion algorithm for symmetric TSP. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00383.html", "source2": "./usr/share/doc/lemon/html/a00383.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/maps.h File Reference\n+My Project: lemon/elevator.h File Reference\n \n \n \n \n \n \n \n@@ -71,270 +71,37 @@\n \n \n \n
    \n
    \n Classes |\n-Namespaces |\n-Functions
    \n-
    maps.h File Reference
    Data Structures » Maps
    \n+Namespaces
    \n+
    elevator.h File Reference
    Data Structures » Auxiliary Data Structures
    \n \n
    \n-
    #include <iterator>
    \n-#include <functional>
    \n-#include <vector>
    \n-#include <map>
    \n-#include <lemon/core.h>
    \n+

    Detailed Description

    \n+

    Elevator class implements an efficient data structure for labeling items in push-relabel type algorithms.

    \n+
    #include <lemon/core.h>
    \n+#include <lemon/bits/traits.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    class  MapBase< K, V >
     Base class of maps. More...
    class  Elevator< GR, Item >
     Class for handling \"labels\" in push-relabel type algorithms. More...
     
    class  NullMap< K, V >
     Null map. (a.k.a. DoNothingMap) More...
     
    class  ConstMap< K, V >
     Constant map. More...
     
    class  ConstMap< K, Const< V, v > >
     Constant map with inlined constant value. More...
     
    class  IdentityMap< T >
     Identity map. More...
     
    class  RangeMap< V >
     Map for storing values for integer keys from the range [0..size-1]. More...
     
    class  SparseMap< K, V, Comp >
     Map type based on std::map. More...
     
    class  ComposeMap< M1, M2 >
     Composition of two maps. More...
     
    class  CombineMap< M1, M2, F, V >
     Combination of two maps using an STL (binary) functor. More...
     
    class  FunctorToMap< F, K, V >
     Converts an STL style (unary) functor to a map. More...
     
    class  MapToFunctor< M >
     Converts a map to an STL style (unary) functor. More...
     
    class  ConvertMap< M, V >
     Map adaptor to convert the Value type of a map to another type using the default conversion. More...
     
    class  ForkMap< M1, M2 >
     Applies all map setting operations to two maps. More...
     
    class  AddMap< M1, M2 >
     Sum of two maps. More...
     
    class  SubMap< M1, M2 >
     Difference of two maps. More...
     
    class  MulMap< M1, M2 >
     Product of two maps. More...
     
    class  DivMap< M1, M2 >
     Quotient of two maps. More...
     
    class  ShiftMap< M, C >
     Shifts a map with a constant. More...
     
    class  ShiftWriteMap< M, C >
     Shifts a map with a constant (read-write version). More...
     
    class  ScaleMap< M, C >
     Scales a map with a constant. More...
     
    class  ScaleWriteMap< M, C >
     Scales a map with a constant (read-write version). More...
     
    class  NegMap< M >
     Negative of a map. More...
     
    class  NegWriteMap< M >
     Negative of a map (read-write version) More...
     
    class  AbsMap< M >
     Absolute value of a map. More...
     
    class  TrueMap< K >
     Constant true map. More...
     
    class  FalseMap< K >
     Constant false map. More...
     
    class  AndMap< M1, M2 >
     Logical 'and' of two maps. More...
     
    class  OrMap< M1, M2 >
     Logical 'or' of two maps. More...
     
    class  NotMap< M >
     Logical 'not' of a map. More...
     
    class  NotWriteMap< M >
     Logical 'not' of a map (read-write version) More...
     
    class  EqualMap< M1, M2 >
     Combination of two maps using the == operator. More...
     
    class  LessMap< M1, M2 >
     Combination of two maps using the < operator. More...
     
    class  LoggerBoolMap< IT, KEY >
     Writable bool map for logging each true assigned element. More...
     
    class  IdMap< GR, K >
     Provides an immutable and unique id for each item in a graph. More...
     
    class  IdMap< GR, K >::InverseMap
     The inverse map type of IdMap. More...
     
    class  CrossRefMap< GR, K, V >
     General cross reference graph map type. More...
     
    class  CrossRefMap< GR, K, V >::ValueIt
     Forward iterator for values. More...
     
    class  CrossRefMap< GR, K, V >::InverseMap
     The inverse map type of CrossRefMap. More...
     
    class  RangeIdMap< GR, K >
     Provides continuous and unique id for the items of a graph. More...
     
    class  RangeIdMap< GR, K >::InverseMap
     The inverse map type of RangeIdMap. More...
     
    class  IterableBoolMap< GR, K >
     Dynamic iterable bool map. More...
     
    class  IterableBoolMap< GR, K >::Reference
     Reference to the value of the map. More...
     
    class  IterableBoolMap< GR, K >::TrueIt
     Iterator for the keys mapped to true. More...
     
    class  IterableBoolMap< GR, K >::FalseIt
     Iterator for the keys mapped to false. More...
     
    class  IterableBoolMap< GR, K >::ItemIt
     Iterator for the keys mapped to a given value. More...
     
    class  IterableIntMap< GR, K >
     Dynamic iterable integer map. More...
     
    class  IterableIntMap< GR, K >::Reference
     Reference to the value of the map. More...
     
    class  IterableIntMap< GR, K >::ItemIt
     Iterator for the keys with the same value. More...
     
    class  IterableValueMap< GR, K, V >
     Dynamic iterable map for comparable values. More...
     
    class  IterableValueMap< GR, K, V >::ValueIt
     Forward iterator for values. More...
     
    class  IterableValueMap< GR, K, V >::ItemIt
     Iterator for the keys with the same value. More...
     
    class  SourceMap< GR >
     Map of the source nodes of arcs in a digraph. More...
     
    class  TargetMap< GR >
     Map of the target nodes of arcs in a digraph. More...
     
    class  ForwardMap< GR >
     Map of the \"forward\" directed arc view of edges in a graph. More...
     
    class  BackwardMap< GR >
     Map of the \"backward\" directed arc view of edges in a graph. More...
     
    class  InDegMap< GR >
     Map of the in-degrees of nodes in a digraph. More...
     
    class  OutDegMap< GR >
     Map of the out-degrees of nodes in a digraph. More...
     
    class  PotentialDifferenceMap< GR, POT >
     Potential difference map. More...
    class  LinkedElevator< GR, Item >
     Class for handling \"labels\" in push-relabel type algorithms. More...
     
    \n \n \n \n \n-

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n

    \n-Functions

    template<typename GR , typename From , typename To >
    void mapCopy (const GR &gr, const From &from, To &to)
     Copy the values of a graph map to another map.
     
    template<typename GR , typename Map1 , typename Map2 >
    bool mapCompare (const GR &gr, const Map1 &map1, const Map2 &map2)
     Compare two graph maps.
     
    template<typename GR , typename Map >
    Map::Key mapMin (const GR &gr, const Map &map)
     Return an item having minimum value of a graph map.
     
    template<typename GR , typename Map , typename Comp >
    Map::Key mapMin (const GR &gr, const Map &map, const Comp &comp)
     Return an item having minimum value of a graph map.
     
    template<typename GR , typename Map >
    Map::Key mapMax (const GR &gr, const Map &map)
     Return an item having maximum value of a graph map.
     
    template<typename GR , typename Map , typename Comp >
    Map::Key mapMax (const GR &gr, const Map &map, const Comp &comp)
     Return an item having maximum value of a graph map.
     
    template<typename GR , typename Map >
    Map::Value mapMinValue (const GR &gr, const Map &map)
     Return the minimum value of a graph map.
     
    template<typename GR , typename Map , typename Comp >
    Map::Value mapMinValue (const GR &gr, const Map &map, const Comp &comp)
     Return the minimum value of a graph map.
     
    template<typename GR , typename Map >
    Map::Value mapMaxValue (const GR &gr, const Map &map)
     Return the maximum value of a graph map.
     
    template<typename GR , typename Map , typename Comp >
    Map::Value mapMaxValue (const GR &gr, const Map &map, const Comp &comp)
     Return the maximum value of a graph map.
     
    template<typename GR , typename Map >
    Map::Key mapFind (const GR &gr, const Map &map, const typename Map::Value &val)
     Return an item having a specified value in a graph map.
     
    template<typename GR , typename Map , typename Pred >
    Map::Key mapFindIf (const GR &gr, const Map &map, const Pred &pred)
     Return an item having value for which a certain predicate is true in a graph map.
     
    template<typename GR , typename Map >
    int mapCount (const GR &gr, const Map &map, const typename Map::Value &val)
     Return the number of items having a specified value in a graph map.
     
    template<typename GR , typename Map , typename Pred >
    int mapCountIf (const GR &gr, const Map &map, const Pred &pred)
     Return the number of items having values for which a certain predicate is true in a graph map.
     
    template<typename GR , typename Map >
    void mapFill (const GR &gr, Map &map, const typename Map::Value &val)
     Fill a graph map with a certain value.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,266 +5,30 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces | Functions\n-maps.h File Reference\n-Data_Structures \u00bb Maps\n-#include \n-#include \n-#include \n-#include \n+Classes | Namespaces\n+elevator.h File Reference\n+Data_Structures \u00bb Auxiliary_Data_Structures\n+***** Detailed Description *****\n+Elevator class implements an efficient data structure for labeling items in\n+push-relabel type algorithms.\n #include \n+#include \n Classes\n-class \u00a0MapBase<_K,_V_>\n-\u00a0 Base class of maps. More...\n+class \u00a0Elevator<_GR,_Item_>\n+\u00a0 Class for handling \"labels\" in push-relabel type algorithms. More...\n \u00a0\n-class \u00a0NullMap<_K,_V_>\n-\u00a0 Null map. (a.k.a. DoNothingMap) More...\n-\u00a0\n-class \u00a0ConstMap<_K,_V_>\n-\u00a0 Constant map. More...\n-\u00a0\n-class \u00a0ConstMap<_K,_Const<_V,_v_>_>\n-\u00a0 Constant map with inlined constant value. More...\n-\u00a0\n-class \u00a0IdentityMap<_T_>\n-\u00a0 Identity map. More...\n-\u00a0\n-class \u00a0RangeMap<_V_>\n-\u00a0 Map for storing values for integer keys from the range [0..size-1].\n- More...\n-\u00a0\n-class \u00a0SparseMap<_K,_V,_Comp_>\n-\u00a0 Map type based on std::map. More...\n-\u00a0\n-class \u00a0ComposeMap<_M1,_M2_>\n-\u00a0 Composition of two maps. More...\n-\u00a0\n-class \u00a0CombineMap<_M1,_M2,_F,_V_>\n-\u00a0 Combination of two maps using an STL (binary) functor. More...\n-\u00a0\n-class \u00a0FunctorToMap<_F,_K,_V_>\n-\u00a0 Converts an STL style (unary) functor to a map. More...\n-\u00a0\n-class \u00a0MapToFunctor<_M_>\n-\u00a0 Converts a map to an STL style (unary) functor. More...\n-\u00a0\n-class \u00a0ConvertMap<_M,_V_>\n-\u00a0 Map adaptor to convert the Value type of a map to another type using\n- the default conversion. More...\n-\u00a0\n-class \u00a0ForkMap<_M1,_M2_>\n-\u00a0 Applies all map setting operations to two maps. More...\n-\u00a0\n-class \u00a0AddMap<_M1,_M2_>\n-\u00a0 Sum of two maps. More...\n-\u00a0\n-class \u00a0SubMap<_M1,_M2_>\n-\u00a0 Difference of two maps. More...\n-\u00a0\n-class \u00a0MulMap<_M1,_M2_>\n-\u00a0 Product of two maps. More...\n-\u00a0\n-class \u00a0DivMap<_M1,_M2_>\n-\u00a0 Quotient of two maps. More...\n-\u00a0\n-class \u00a0ShiftMap<_M,_C_>\n-\u00a0 Shifts a map with a constant. More...\n-\u00a0\n-class \u00a0ShiftWriteMap<_M,_C_>\n-\u00a0 Shifts a map with a constant (read-write version). More...\n-\u00a0\n-class \u00a0ScaleMap<_M,_C_>\n-\u00a0 Scales a map with a constant. More...\n-\u00a0\n-class \u00a0ScaleWriteMap<_M,_C_>\n-\u00a0 Scales a map with a constant (read-write version). More...\n-\u00a0\n-class \u00a0NegMap<_M_>\n-\u00a0 Negative of a map. More...\n-\u00a0\n-class \u00a0NegWriteMap<_M_>\n-\u00a0 Negative of a map (read-write version) More...\n-\u00a0\n-class \u00a0AbsMap<_M_>\n-\u00a0 Absolute value of a map. More...\n-\u00a0\n-class \u00a0TrueMap<_K_>\n-\u00a0 Constant true map. More...\n-\u00a0\n-class \u00a0FalseMap<_K_>\n-\u00a0 Constant false map. More...\n-\u00a0\n-class \u00a0AndMap<_M1,_M2_>\n-\u00a0 Logical 'and' of two maps. More...\n-\u00a0\n-class \u00a0OrMap<_M1,_M2_>\n-\u00a0 Logical 'or' of two maps. More...\n-\u00a0\n-class \u00a0NotMap<_M_>\n-\u00a0 Logical 'not' of a map. More...\n-\u00a0\n-class \u00a0NotWriteMap<_M_>\n-\u00a0 Logical 'not' of a map (read-write version) More...\n-\u00a0\n-class \u00a0EqualMap<_M1,_M2_>\n-\u00a0 Combination of two maps using the == operator. More...\n-\u00a0\n-class \u00a0LessMap<_M1,_M2_>\n-\u00a0 Combination of two maps using the < operator. More...\n-\u00a0\n-class \u00a0LoggerBoolMap<_IT,_KEY_>\n-\u00a0 Writable bool map for logging each true assigned element. More...\n-\u00a0\n-class \u00a0IdMap<_GR,_K_>\n-\u00a0 Provides an immutable and unique id for each item in a graph. More...\n-\u00a0\n-class \u00a0IdMap<_GR,_K_>::InverseMap\n-\u00a0 The inverse map type of IdMap. More...\n-\u00a0\n-class \u00a0CrossRefMap<_GR,_K,_V_>\n-\u00a0 General cross reference graph map type. More...\n-\u00a0\n-class \u00a0CrossRefMap<_GR,_K,_V_>::ValueIt\n-\u00a0 Forward iterator for values. More...\n-\u00a0\n-class \u00a0CrossRefMap<_GR,_K,_V_>::InverseMap\n-\u00a0 The inverse map type of CrossRefMap. More...\n-\u00a0\n-class \u00a0RangeIdMap<_GR,_K_>\n-\u00a0 Provides continuous and unique id for the items of a graph. More...\n-\u00a0\n-class \u00a0RangeIdMap<_GR,_K_>::InverseMap\n-\u00a0 The inverse map type of RangeIdMap. More...\n-\u00a0\n-class \u00a0IterableBoolMap<_GR,_K_>\n-\u00a0 Dynamic iterable bool map. More...\n-\u00a0\n-class \u00a0IterableBoolMap<_GR,_K_>::Reference\n-\u00a0 Reference to the value of the map. More...\n-\u00a0\n-class \u00a0IterableBoolMap<_GR,_K_>::TrueIt\n-\u00a0 Iterator for the keys mapped to true. More...\n-\u00a0\n-class \u00a0IterableBoolMap<_GR,_K_>::FalseIt\n-\u00a0 Iterator for the keys mapped to false. More...\n-\u00a0\n-class \u00a0IterableBoolMap<_GR,_K_>::ItemIt\n-\u00a0 Iterator for the keys mapped to a given value. More...\n-\u00a0\n-class \u00a0IterableIntMap<_GR,_K_>\n-\u00a0 Dynamic iterable integer map. More...\n-\u00a0\n-class \u00a0IterableIntMap<_GR,_K_>::Reference\n-\u00a0 Reference to the value of the map. More...\n-\u00a0\n-class \u00a0IterableIntMap<_GR,_K_>::ItemIt\n-\u00a0 Iterator for the keys with the same value. More...\n-\u00a0\n-class \u00a0IterableValueMap<_GR,_K,_V_>\n-\u00a0 Dynamic iterable map for comparable values. More...\n-\u00a0\n-class \u00a0IterableValueMap<_GR,_K,_V_>::ValueIt\n-\u00a0 Forward iterator for values. More...\n-\u00a0\n-class \u00a0IterableValueMap<_GR,_K,_V_>::ItemIt\n-\u00a0 Iterator for the keys with the same value. More...\n-\u00a0\n-class \u00a0SourceMap<_GR_>\n-\u00a0 Map of the source nodes of arcs in a digraph. More...\n-\u00a0\n-class \u00a0TargetMap<_GR_>\n-\u00a0 Map of the target nodes of arcs in a digraph. More...\n-\u00a0\n-class \u00a0ForwardMap<_GR_>\n-\u00a0 Map of the \"forward\" directed arc view of edges in a graph. More...\n-\u00a0\n-class \u00a0BackwardMap<_GR_>\n-\u00a0 Map of the \"backward\" directed arc view of edges in a graph. More...\n-\u00a0\n-class \u00a0InDegMap<_GR_>\n-\u00a0 Map of the in-degrees of nodes in a digraph. More...\n-\u00a0\n-class \u00a0OutDegMap<_GR_>\n-\u00a0 Map of the out-degrees of nodes in a digraph. More...\n-\u00a0\n-class \u00a0PotentialDifferenceMap<_GR,_POT_>\n-\u00a0 Potential difference map. More...\n+class \u00a0LinkedElevator<_GR,_Item_>\n+\u00a0 Class for handling \"labels\" in push-relabel type algorithms. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n- Functions\n-template\n- void\u00a0mapCopy (const GR &gr, const From &from, To &to)\n-\u00a0 Copy the values of a graph map to another map.\n-\u00a0\n-template\n- bool\u00a0mapCompare (const GR &gr, const Map1 &map1, const Map2 &map2)\n-\u00a0 Compare two graph maps.\n-\u00a0\n-template\n- Map::Key\u00a0mapMin (const GR &gr, const Map &map)\n-\u00a0 Return an item having minimum value of a graph map.\n-\u00a0\n-template\n- Map::Key\u00a0mapMin (const GR &gr, const Map &map, const Comp &comp)\n-\u00a0 Return an item having minimum value of a graph map.\n-\u00a0\n-template\n- Map::Key\u00a0mapMax (const GR &gr, const Map &map)\n-\u00a0 Return an item having maximum value of a graph map.\n-\u00a0\n-template\n- Map::Key\u00a0mapMax (const GR &gr, const Map &map, const Comp &comp)\n-\u00a0 Return an item having maximum value of a graph map.\n-\u00a0\n-template\n-Map::Value\u00a0mapMinValue (const GR &gr, const Map &map)\n-\u00a0 Return the minimum value of a graph map.\n-\u00a0\n-template\n-Map::Value\u00a0mapMinValue (const GR &gr, const Map &map, const Comp &comp)\n-\u00a0 Return the minimum value of a graph map.\n-\u00a0\n-template\n-Map::Value\u00a0mapMaxValue (const GR &gr, const Map &map)\n-\u00a0 Return the maximum value of a graph map.\n-\u00a0\n-template\n-Map::Value\u00a0mapMaxValue (const GR &gr, const Map &map, const Comp &comp)\n-\u00a0 Return the maximum value of a graph map.\n-\u00a0\n-template\n- Map::Key\u00a0mapFind (const GR &gr, const Map &map, const typename Map::Value\n- &val)\n-\u00a0 Return an item having a specified value in a graph map.\n-\u00a0\n-template\n- Map::Key\u00a0mapFindIf (const GR &gr, const Map &map, const Pred &pred)\n-\u00a0 Return an item having value for which a certain predicate is true\n- in a graph map.\n-\u00a0\n-template\n- int\u00a0mapCount (const GR &gr, const Map &map, const typename Map::Value\n- &val)\n-\u00a0 Return the number of items having a specified value in a graph map.\n-\n-\u00a0\n-template\n- int\u00a0mapCountIf (const GR &gr, const Map &map, const Pred &pred)\n-\u00a0 Return the number of items having values for which a certain\n- predicate is true in a graph map.\n-\u00a0\n-template\n- void\u00a0mapFill (const GR &gr, Map &map, const typename Map::Value &val)\n-\u00a0 Fill a graph map with a certain value.\n-\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00386.html", "source2": "./usr/share/doc/lemon/html/a00386.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/list_graph.h File Reference\n+My Project: lemon/christofides_tsp.h File Reference\n \n \n \n \n \n \n \n@@ -72,42 +72,27 @@\n
  • lemon
    • \n
    \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    list_graph.h File Reference
    Data Structures » Graph Structures
    \n+
    christofides_tsp.h File Reference
    Algorithms » Traveling Salesman Problem
    \n
    \n
    \n-
    #include <lemon/core.h>
    \n-#include <lemon/error.h>
    \n-#include <lemon/bits/graph_extender.h>
    \n-#include <vector>
    \n-#include <list>
    \n+
    #include <lemon/full_graph.h>
    \n+#include <lemon/smart_graph.h>
    \n+#include <lemon/kruskal.h>
    \n+#include <lemon/matching.h>
    \n+#include <lemon/euler.h>
    \n
    \n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    class  ListDigraph
     A general directed graph structure. More...
     
    class  ListDigraph::Snapshot
     Class to make a snapshot of the digraph and restore it later. More...
     
    class  ListGraph
     A general undirected graph structure. More...
     
    class  ListGraph::Snapshot
     Class to make a snapshot of the graph and restore it later. More...
     
    class  ListBpGraph
     A general undirected graph structure. More...
     
    class  ListBpGraph::Snapshot
     Class to make a snapshot of the graph and restore it later. More...
    class  ChristofidesTsp< CM >
     Christofides algorithm for symmetric TSP. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,39 +6,24 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-list_graph.h File Reference\n-Data_Structures \u00bb Graph_Structures\n-#include \n-#include \n-#include \n-#include \n-#include \n+christofides_tsp.h File Reference\n+Algorithms \u00bb Traveling_Salesman_Problem\n+#include \n+#include \n+#include \n+#include \n+#include \n Classes\n-class \u00a0ListDigraph\n-\u00a0 A general directed graph structure. More...\n-\u00a0\n-class \u00a0ListDigraph::Snapshot\n-\u00a0 Class to make a snapshot of the digraph and restore it later. More...\n-\u00a0\n-class \u00a0ListGraph\n-\u00a0 A general undirected graph structure. More...\n-\u00a0\n-class \u00a0ListGraph::Snapshot\n-\u00a0 Class to make a snapshot of the graph and restore it later. More...\n-\u00a0\n-class \u00a0ListBpGraph\n-\u00a0 A general undirected graph structure. More...\n-\u00a0\n-class \u00a0ListBpGraph::Snapshot\n-\u00a0 Class to make a snapshot of the graph and restore it later. More...\n+class \u00a0ChristofidesTsp<_CM_>\n+\u00a0 Christofides algorithm for symmetric TSP. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00389.html", "source2": "./usr/share/doc/lemon/html/a00389.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/hartmann_orlin_mmc.h File Reference\n+My Project: lemon/maps.h File Reference\n \n \n \n \n \n \n \n@@ -71,45 +71,270 @@\n \n \n \n
    \n
    \n Classes |\n-Namespaces
    \n-
    hartmann_orlin_mmc.h File Reference
    Algorithms » Minimum Mean Cycle Algorithms
    \n+Namespaces |\n+Functions
    \n+
    maps.h File Reference
    Data Structures » Maps
    \n \n
    \n-
    #include <vector>
    \n-#include <limits>
    \n-#include <lemon/core.h>
    \n-#include <lemon/path.h>
    \n-#include <lemon/tolerance.h>
    \n-#include <lemon/connectivity.h>
    \n+
    #include <iterator>
    \n+#include <functional>
    \n+#include <vector>
    \n+#include <map>
    \n+#include <lemon/core.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    struct  HartmannOrlinMmcDefaultTraits< GR, CM >
     Default traits class of HartmannOrlinMmc class. More...
    class  MapBase< K, V >
     Base class of maps. More...
     
    class  HartmannOrlinMmc< GR, CM, TR >
     Implementation of the Hartmann-Orlin algorithm for finding a minimum mean cycle. More...
    class  NullMap< K, V >
     Null map. (a.k.a. DoNothingMap) More...
     
    struct  HartmannOrlinMmc< GR, CM, TR >::SetLargeCost< T >
     Named parameter for setting LargeCost type. More...
    class  ConstMap< K, V >
     Constant map. More...
     
    struct  HartmannOrlinMmc< GR, CM, TR >::SetPath< T >
     Named parameter for setting Path type. More...
    class  ConstMap< K, Const< V, v > >
     Constant map with inlined constant value. More...
     
    class  IdentityMap< T >
     Identity map. More...
     
    class  RangeMap< V >
     Map for storing values for integer keys from the range [0..size-1]. More...
     
    class  SparseMap< K, V, Comp >
     Map type based on std::map. More...
     
    class  ComposeMap< M1, M2 >
     Composition of two maps. More...
     
    class  CombineMap< M1, M2, F, V >
     Combination of two maps using an STL (binary) functor. More...
     
    class  FunctorToMap< F, K, V >
     Converts an STL style (unary) functor to a map. More...
     
    class  MapToFunctor< M >
     Converts a map to an STL style (unary) functor. More...
     
    class  ConvertMap< M, V >
     Map adaptor to convert the Value type of a map to another type using the default conversion. More...
     
    class  ForkMap< M1, M2 >
     Applies all map setting operations to two maps. More...
     
    class  AddMap< M1, M2 >
     Sum of two maps. More...
     
    class  SubMap< M1, M2 >
     Difference of two maps. More...
     
    class  MulMap< M1, M2 >
     Product of two maps. More...
     
    class  DivMap< M1, M2 >
     Quotient of two maps. More...
     
    class  ShiftMap< M, C >
     Shifts a map with a constant. More...
     
    class  ShiftWriteMap< M, C >
     Shifts a map with a constant (read-write version). More...
     
    class  ScaleMap< M, C >
     Scales a map with a constant. More...
     
    class  ScaleWriteMap< M, C >
     Scales a map with a constant (read-write version). More...
     
    class  NegMap< M >
     Negative of a map. More...
     
    class  NegWriteMap< M >
     Negative of a map (read-write version) More...
     
    class  AbsMap< M >
     Absolute value of a map. More...
     
    class  TrueMap< K >
     Constant true map. More...
     
    class  FalseMap< K >
     Constant false map. More...
     
    class  AndMap< M1, M2 >
     Logical 'and' of two maps. More...
     
    class  OrMap< M1, M2 >
     Logical 'or' of two maps. More...
     
    class  NotMap< M >
     Logical 'not' of a map. More...
     
    class  NotWriteMap< M >
     Logical 'not' of a map (read-write version) More...
     
    class  EqualMap< M1, M2 >
     Combination of two maps using the == operator. More...
     
    class  LessMap< M1, M2 >
     Combination of two maps using the < operator. More...
     
    class  LoggerBoolMap< IT, KEY >
     Writable bool map for logging each true assigned element. More...
     
    class  IdMap< GR, K >
     Provides an immutable and unique id for each item in a graph. More...
     
    class  IdMap< GR, K >::InverseMap
     The inverse map type of IdMap. More...
     
    class  CrossRefMap< GR, K, V >
     General cross reference graph map type. More...
     
    class  CrossRefMap< GR, K, V >::ValueIt
     Forward iterator for values. More...
     
    class  CrossRefMap< GR, K, V >::InverseMap
     The inverse map type of CrossRefMap. More...
     
    class  RangeIdMap< GR, K >
     Provides continuous and unique id for the items of a graph. More...
     
    class  RangeIdMap< GR, K >::InverseMap
     The inverse map type of RangeIdMap. More...
     
    class  IterableBoolMap< GR, K >
     Dynamic iterable bool map. More...
     
    class  IterableBoolMap< GR, K >::Reference
     Reference to the value of the map. More...
     
    class  IterableBoolMap< GR, K >::TrueIt
     Iterator for the keys mapped to true. More...
     
    class  IterableBoolMap< GR, K >::FalseIt
     Iterator for the keys mapped to false. More...
     
    class  IterableBoolMap< GR, K >::ItemIt
     Iterator for the keys mapped to a given value. More...
     
    class  IterableIntMap< GR, K >
     Dynamic iterable integer map. More...
     
    class  IterableIntMap< GR, K >::Reference
     Reference to the value of the map. More...
     
    class  IterableIntMap< GR, K >::ItemIt
     Iterator for the keys with the same value. More...
     
    class  IterableValueMap< GR, K, V >
     Dynamic iterable map for comparable values. More...
     
    class  IterableValueMap< GR, K, V >::ValueIt
     Forward iterator for values. More...
     
    class  IterableValueMap< GR, K, V >::ItemIt
     Iterator for the keys with the same value. More...
     
    class  SourceMap< GR >
     Map of the source nodes of arcs in a digraph. More...
     
    class  TargetMap< GR >
     Map of the target nodes of arcs in a digraph. More...
     
    class  ForwardMap< GR >
     Map of the \"forward\" directed arc view of edges in a graph. More...
     
    class  BackwardMap< GR >
     Map of the \"backward\" directed arc view of edges in a graph. More...
     
    class  InDegMap< GR >
     Map of the in-degrees of nodes in a digraph. More...
     
    class  OutDegMap< GR >
     Map of the out-degrees of nodes in a digraph. More...
     
    class  PotentialDifferenceMap< GR, POT >
     Potential difference map. More...
     
    \n \n \n \n \n+

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n

    \n+Functions

    template<typename GR , typename From , typename To >
    void mapCopy (const GR &gr, const From &from, To &to)
     Copy the values of a graph map to another map.
     
    template<typename GR , typename Map1 , typename Map2 >
    bool mapCompare (const GR &gr, const Map1 &map1, const Map2 &map2)
     Compare two graph maps.
     
    template<typename GR , typename Map >
    Map::Key mapMin (const GR &gr, const Map &map)
     Return an item having minimum value of a graph map.
     
    template<typename GR , typename Map , typename Comp >
    Map::Key mapMin (const GR &gr, const Map &map, const Comp &comp)
     Return an item having minimum value of a graph map.
     
    template<typename GR , typename Map >
    Map::Key mapMax (const GR &gr, const Map &map)
     Return an item having maximum value of a graph map.
     
    template<typename GR , typename Map , typename Comp >
    Map::Key mapMax (const GR &gr, const Map &map, const Comp &comp)
     Return an item having maximum value of a graph map.
     
    template<typename GR , typename Map >
    Map::Value mapMinValue (const GR &gr, const Map &map)
     Return the minimum value of a graph map.
     
    template<typename GR , typename Map , typename Comp >
    Map::Value mapMinValue (const GR &gr, const Map &map, const Comp &comp)
     Return the minimum value of a graph map.
     
    template<typename GR , typename Map >
    Map::Value mapMaxValue (const GR &gr, const Map &map)
     Return the maximum value of a graph map.
     
    template<typename GR , typename Map , typename Comp >
    Map::Value mapMaxValue (const GR &gr, const Map &map, const Comp &comp)
     Return the maximum value of a graph map.
     
    template<typename GR , typename Map >
    Map::Key mapFind (const GR &gr, const Map &map, const typename Map::Value &val)
     Return an item having a specified value in a graph map.
     
    template<typename GR , typename Map , typename Pred >
    Map::Key mapFindIf (const GR &gr, const Map &map, const Pred &pred)
     Return an item having value for which a certain predicate is true in a graph map.
     
    template<typename GR , typename Map >
    int mapCount (const GR &gr, const Map &map, const typename Map::Value &val)
     Return the number of items having a specified value in a graph map.
     
    template<typename GR , typename Map , typename Pred >
    int mapCountIf (const GR &gr, const Map &map, const Pred &pred)
     Return the number of items having values for which a certain predicate is true in a graph map.
     
    template<typename GR , typename Map >
    void mapFill (const GR &gr, Map &map, const typename Map::Value &val)
     Fill a graph map with a certain value.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,38 +5,266 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces\n-hartmann_orlin_mmc.h File Reference\n-Algorithms \u00bb Minimum_Mean_Cycle_Algorithms\n+Classes | Namespaces | Functions\n+maps.h File Reference\n+Data_Structures \u00bb Maps\n+#include \n+#include \n #include \n-#include \n+#include \n #include \n-#include \n-#include \n-#include \n Classes\n-struct \u00a0HartmannOrlinMmcDefaultTraits<_GR,_CM_>\n-\u00a0 Default traits class of HartmannOrlinMmc class. More...\n+class \u00a0MapBase<_K,_V_>\n+\u00a0 Base class of maps. More...\n \u00a0\n- class \u00a0HartmannOrlinMmc<_GR,_CM,_TR_>\n-\u00a0 Implementation of the Hartmann-Orlin algorithm for finding a minimum\n- mean cycle. More...\n+class \u00a0NullMap<_K,_V_>\n+\u00a0 Null map. (a.k.a. DoNothingMap) More...\n \u00a0\n-struct \u00a0HartmannOrlinMmc<_GR,_CM,_TR_>::SetLargeCost<_T_>\n-\u00a0 Named_parameter for setting LargeCost type. More...\n+class \u00a0ConstMap<_K,_V_>\n+\u00a0 Constant map. More...\n \u00a0\n-struct \u00a0HartmannOrlinMmc<_GR,_CM,_TR_>::SetPath<_T_>\n-\u00a0 Named_parameter for setting Path type. More...\n+class \u00a0ConstMap<_K,_Const<_V,_v_>_>\n+\u00a0 Constant map with inlined constant value. More...\n+\u00a0\n+class \u00a0IdentityMap<_T_>\n+\u00a0 Identity map. More...\n+\u00a0\n+class \u00a0RangeMap<_V_>\n+\u00a0 Map for storing values for integer keys from the range [0..size-1].\n+ More...\n+\u00a0\n+class \u00a0SparseMap<_K,_V,_Comp_>\n+\u00a0 Map type based on std::map. More...\n+\u00a0\n+class \u00a0ComposeMap<_M1,_M2_>\n+\u00a0 Composition of two maps. More...\n+\u00a0\n+class \u00a0CombineMap<_M1,_M2,_F,_V_>\n+\u00a0 Combination of two maps using an STL (binary) functor. More...\n+\u00a0\n+class \u00a0FunctorToMap<_F,_K,_V_>\n+\u00a0 Converts an STL style (unary) functor to a map. More...\n+\u00a0\n+class \u00a0MapToFunctor<_M_>\n+\u00a0 Converts a map to an STL style (unary) functor. More...\n+\u00a0\n+class \u00a0ConvertMap<_M,_V_>\n+\u00a0 Map adaptor to convert the Value type of a map to another type using\n+ the default conversion. More...\n+\u00a0\n+class \u00a0ForkMap<_M1,_M2_>\n+\u00a0 Applies all map setting operations to two maps. More...\n+\u00a0\n+class \u00a0AddMap<_M1,_M2_>\n+\u00a0 Sum of two maps. More...\n+\u00a0\n+class \u00a0SubMap<_M1,_M2_>\n+\u00a0 Difference of two maps. More...\n+\u00a0\n+class \u00a0MulMap<_M1,_M2_>\n+\u00a0 Product of two maps. More...\n+\u00a0\n+class \u00a0DivMap<_M1,_M2_>\n+\u00a0 Quotient of two maps. More...\n+\u00a0\n+class \u00a0ShiftMap<_M,_C_>\n+\u00a0 Shifts a map with a constant. More...\n+\u00a0\n+class \u00a0ShiftWriteMap<_M,_C_>\n+\u00a0 Shifts a map with a constant (read-write version). More...\n+\u00a0\n+class \u00a0ScaleMap<_M,_C_>\n+\u00a0 Scales a map with a constant. More...\n+\u00a0\n+class \u00a0ScaleWriteMap<_M,_C_>\n+\u00a0 Scales a map with a constant (read-write version). More...\n+\u00a0\n+class \u00a0NegMap<_M_>\n+\u00a0 Negative of a map. More...\n+\u00a0\n+class \u00a0NegWriteMap<_M_>\n+\u00a0 Negative of a map (read-write version) More...\n+\u00a0\n+class \u00a0AbsMap<_M_>\n+\u00a0 Absolute value of a map. More...\n+\u00a0\n+class \u00a0TrueMap<_K_>\n+\u00a0 Constant true map. More...\n+\u00a0\n+class \u00a0FalseMap<_K_>\n+\u00a0 Constant false map. More...\n+\u00a0\n+class \u00a0AndMap<_M1,_M2_>\n+\u00a0 Logical 'and' of two maps. More...\n+\u00a0\n+class \u00a0OrMap<_M1,_M2_>\n+\u00a0 Logical 'or' of two maps. More...\n+\u00a0\n+class \u00a0NotMap<_M_>\n+\u00a0 Logical 'not' of a map. More...\n+\u00a0\n+class \u00a0NotWriteMap<_M_>\n+\u00a0 Logical 'not' of a map (read-write version) More...\n+\u00a0\n+class \u00a0EqualMap<_M1,_M2_>\n+\u00a0 Combination of two maps using the == operator. More...\n+\u00a0\n+class \u00a0LessMap<_M1,_M2_>\n+\u00a0 Combination of two maps using the < operator. More...\n+\u00a0\n+class \u00a0LoggerBoolMap<_IT,_KEY_>\n+\u00a0 Writable bool map for logging each true assigned element. More...\n+\u00a0\n+class \u00a0IdMap<_GR,_K_>\n+\u00a0 Provides an immutable and unique id for each item in a graph. More...\n+\u00a0\n+class \u00a0IdMap<_GR,_K_>::InverseMap\n+\u00a0 The inverse map type of IdMap. More...\n+\u00a0\n+class \u00a0CrossRefMap<_GR,_K,_V_>\n+\u00a0 General cross reference graph map type. More...\n+\u00a0\n+class \u00a0CrossRefMap<_GR,_K,_V_>::ValueIt\n+\u00a0 Forward iterator for values. More...\n+\u00a0\n+class \u00a0CrossRefMap<_GR,_K,_V_>::InverseMap\n+\u00a0 The inverse map type of CrossRefMap. More...\n+\u00a0\n+class \u00a0RangeIdMap<_GR,_K_>\n+\u00a0 Provides continuous and unique id for the items of a graph. More...\n+\u00a0\n+class \u00a0RangeIdMap<_GR,_K_>::InverseMap\n+\u00a0 The inverse map type of RangeIdMap. More...\n+\u00a0\n+class \u00a0IterableBoolMap<_GR,_K_>\n+\u00a0 Dynamic iterable bool map. More...\n+\u00a0\n+class \u00a0IterableBoolMap<_GR,_K_>::Reference\n+\u00a0 Reference to the value of the map. More...\n+\u00a0\n+class \u00a0IterableBoolMap<_GR,_K_>::TrueIt\n+\u00a0 Iterator for the keys mapped to true. More...\n+\u00a0\n+class \u00a0IterableBoolMap<_GR,_K_>::FalseIt\n+\u00a0 Iterator for the keys mapped to false. More...\n+\u00a0\n+class \u00a0IterableBoolMap<_GR,_K_>::ItemIt\n+\u00a0 Iterator for the keys mapped to a given value. More...\n+\u00a0\n+class \u00a0IterableIntMap<_GR,_K_>\n+\u00a0 Dynamic iterable integer map. More...\n+\u00a0\n+class \u00a0IterableIntMap<_GR,_K_>::Reference\n+\u00a0 Reference to the value of the map. More...\n+\u00a0\n+class \u00a0IterableIntMap<_GR,_K_>::ItemIt\n+\u00a0 Iterator for the keys with the same value. More...\n+\u00a0\n+class \u00a0IterableValueMap<_GR,_K,_V_>\n+\u00a0 Dynamic iterable map for comparable values. More...\n+\u00a0\n+class \u00a0IterableValueMap<_GR,_K,_V_>::ValueIt\n+\u00a0 Forward iterator for values. More...\n+\u00a0\n+class \u00a0IterableValueMap<_GR,_K,_V_>::ItemIt\n+\u00a0 Iterator for the keys with the same value. More...\n+\u00a0\n+class \u00a0SourceMap<_GR_>\n+\u00a0 Map of the source nodes of arcs in a digraph. More...\n+\u00a0\n+class \u00a0TargetMap<_GR_>\n+\u00a0 Map of the target nodes of arcs in a digraph. More...\n+\u00a0\n+class \u00a0ForwardMap<_GR_>\n+\u00a0 Map of the \"forward\" directed arc view of edges in a graph. More...\n+\u00a0\n+class \u00a0BackwardMap<_GR_>\n+\u00a0 Map of the \"backward\" directed arc view of edges in a graph. More...\n+\u00a0\n+class \u00a0InDegMap<_GR_>\n+\u00a0 Map of the in-degrees of nodes in a digraph. More...\n+\u00a0\n+class \u00a0OutDegMap<_GR_>\n+\u00a0 Map of the out-degrees of nodes in a digraph. More...\n+\u00a0\n+class \u00a0PotentialDifferenceMap<_GR,_POT_>\n+\u00a0 Potential difference map. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n+ Functions\n+template\n+ void\u00a0mapCopy (const GR &gr, const From &from, To &to)\n+\u00a0 Copy the values of a graph map to another map.\n+\u00a0\n+template\n+ bool\u00a0mapCompare (const GR &gr, const Map1 &map1, const Map2 &map2)\n+\u00a0 Compare two graph maps.\n+\u00a0\n+template\n+ Map::Key\u00a0mapMin (const GR &gr, const Map &map)\n+\u00a0 Return an item having minimum value of a graph map.\n+\u00a0\n+template\n+ Map::Key\u00a0mapMin (const GR &gr, const Map &map, const Comp &comp)\n+\u00a0 Return an item having minimum value of a graph map.\n+\u00a0\n+template\n+ Map::Key\u00a0mapMax (const GR &gr, const Map &map)\n+\u00a0 Return an item having maximum value of a graph map.\n+\u00a0\n+template\n+ Map::Key\u00a0mapMax (const GR &gr, const Map &map, const Comp &comp)\n+\u00a0 Return an item having maximum value of a graph map.\n+\u00a0\n+template\n+Map::Value\u00a0mapMinValue (const GR &gr, const Map &map)\n+\u00a0 Return the minimum value of a graph map.\n+\u00a0\n+template\n+Map::Value\u00a0mapMinValue (const GR &gr, const Map &map, const Comp &comp)\n+\u00a0 Return the minimum value of a graph map.\n+\u00a0\n+template\n+Map::Value\u00a0mapMaxValue (const GR &gr, const Map &map)\n+\u00a0 Return the maximum value of a graph map.\n+\u00a0\n+template\n+Map::Value\u00a0mapMaxValue (const GR &gr, const Map &map, const Comp &comp)\n+\u00a0 Return the maximum value of a graph map.\n+\u00a0\n+template\n+ Map::Key\u00a0mapFind (const GR &gr, const Map &map, const typename Map::Value\n+ &val)\n+\u00a0 Return an item having a specified value in a graph map.\n+\u00a0\n+template\n+ Map::Key\u00a0mapFindIf (const GR &gr, const Map &map, const Pred &pred)\n+\u00a0 Return an item having value for which a certain predicate is true\n+ in a graph map.\n+\u00a0\n+template\n+ int\u00a0mapCount (const GR &gr, const Map &map, const typename Map::Value\n+ &val)\n+\u00a0 Return the number of items having a specified value in a graph map.\n+\n+\u00a0\n+template\n+ int\u00a0mapCountIf (const GR &gr, const Map &map, const Pred &pred)\n+\u00a0 Return the number of items having values for which a certain\n+ predicate is true in a graph map.\n+\u00a0\n+template\n+ void\u00a0mapFill (const GR &gr, Map &map, const typename Map::Value &val)\n+\u00a0 Fill a graph map with a certain value.\n+\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00392.html", "source2": "./usr/share/doc/lemon/html/a00392.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/grid_graph.h File Reference\n+My Project: lemon/lgf_reader.h File Reference\n \n \n \n \n \n \n \n@@ -72,35 +72,43 @@\n
  • lemon
    • \n
    \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    grid_graph.h File Reference
    Data Structures » Graph Structures
    \n+
    lgf_reader.h File Reference
    Input-Output » LEMON Graph Format
    \n
    \n
    \n-
    #include <lemon/core.h>
    \n-#include <lemon/bits/graph_extender.h>
    \n-#include <lemon/dim2.h>
    \n-#include <lemon/assert.h>
    \n+
    #include <iostream>
    \n+#include <fstream>
    \n+#include <sstream>
    \n+#include <set>
    \n+#include <map>
    \n+#include <lemon/core.h>
    \n+#include <lemon/lgf_writer.h>
    \n+#include <lemon/concept_check.h>
    \n+#include <lemon/concepts/maps.h>
    \n
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  GridGraph
     Grid graph class. More...
    class  DigraphReader< DGR >
     LGF reader for directed graphs More...
     
    class  GridGraph::IndexMap
     Map to get the indices of the nodes as dim2::Point<int>. More...
    class  GraphReader< GR >
     LGF reader for undirected graphs More...
     
    class  GridGraph::ColMap
     Map to get the column of the nodes. More...
    class  BpGraphReader< BGR >
     LGF reader for bipartite graphs More...
     
    class  GridGraph::RowMap
     Map to get the row of the nodes. More...
    class  SectionReader
     Section reader class. More...
     
    class  LgfContents
     Reader for the contents of the LGF file. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,32 +6,40 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-grid_graph.h File Reference\n-Data_Structures \u00bb Graph_Structures\n+lgf_reader.h File Reference\n+Input-Output \u00bb LEMON_Graph_Format\n+#include \n+#include \n+#include \n+#include \n+#include \n #include \n-#include \n-#include \n-#include \n+#include \n+#include \n+#include \n Classes\n-class \u00a0GridGraph\n-\u00a0 Grid graph class. More...\n+class \u00a0DigraphReader<_DGR_>\n+\u00a0 LGF reader for directed graphs More...\n \u00a0\n-class \u00a0GridGraph::IndexMap\n-\u00a0 Map to get the indices of the nodes as dim2::Point. More...\n+class \u00a0GraphReader<_GR_>\n+\u00a0 LGF reader for undirected graphs More...\n \u00a0\n-class \u00a0GridGraph::ColMap\n-\u00a0 Map to get the column of the nodes. More...\n+class \u00a0BpGraphReader<_BGR_>\n+\u00a0 LGF reader for bipartite graphs More...\n \u00a0\n-class \u00a0GridGraph::RowMap\n-\u00a0 Map to get the row of the nodes. More...\n+class \u00a0SectionReader\n+\u00a0 Section reader class. More...\n+\u00a0\n+class \u00a0LgfContents\n+\u00a0 Reader for the contents of the LGF file. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00395.html", "source2": "./usr/share/doc/lemon/html/a00395.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/radix_heap.h File Reference\n+My Project: lemon/kruskal.h File Reference\n \n \n \n \n \n \n \n@@ -70,36 +70,38 @@\n
    \n \n
    \n \n
    \n
    \n-Classes |\n-Namespaces
    \n-
    radix_heap.h File Reference
    Data Structures » Heap Structures
    \n+Namespaces |\n+Functions
    \n+
    kruskal.h File Reference
    Algorithms » Minimum Spanning Tree Algorithms
    \n \n
    \n-
    #include <vector>
    \n-#include <lemon/error.h>
    \n+
    #include <algorithm>
    \n+#include <vector>
    \n+#include <lemon/unionfind.h>
    \n+#include <lemon/maps.h>
    \n+#include <lemon/core.h>
    \n+#include <lemon/bits/traits.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n-\n-\n-

    \n-Classes

    class  RadixHeap< IM >
     Radix heap data structure. More...
     
    class  RadixHeap< IM >::PriorityUnderflowError
     Exception thrown by RadixHeap. More...
     
    \n \n \n \n \n+

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n+\n+\n+\n+\n+\n

    \n+Functions

    template<typename Graph , typename In , typename Out >
    Value kruskal (const Graph &g, const In &in, Out &out)
     Kruskal's algorithm for finding a minimum cost spanning tree of a graph.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,27 +5,30 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces\n-radix_heap.h File Reference\n-Data_Structures \u00bb Heap_Structures\n+Namespaces | Functions\n+kruskal.h File Reference\n+Algorithms \u00bb Minimum_Spanning_Tree_Algorithms\n+#include \n #include \n-#include \n- Classes\n-class \u00a0RadixHeap<_IM_>\n-\u00a0 Radix heap data structure. More...\n-\u00a0\n-class \u00a0RadixHeap<_IM_>::PriorityUnderflowError\n-\u00a0 Exception thrown by RadixHeap. More...\n-\u00a0\n+#include \n+#include \n+#include \n+#include \n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n+ Functions\n+template\n+Value\u00a0kruskal (const Graph &g, const In &in, Out &out)\n+\u00a0 Kruskal's algorithm for finding a minimum cost spanning tree of a graph.\n+\n+\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00398.html", "source2": "./usr/share/doc/lemon/html/a00398.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/fib_heap.h File Reference\n+My Project: lemon/capacity_scaling.h File Reference\n \n \n \n \n \n \n \n@@ -72,26 +72,33 @@\n
  • lemon
    • \n
    \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    fib_heap.h File Reference
    Data Structures » Heap Structures
    \n+
    capacity_scaling.h File Reference
    Algorithms » Minimum Cost Flow Algorithms
    \n
    \n
    \n
    #include <vector>
    \n-#include <utility>
    \n-#include <functional>
    \n-#include <lemon/math.h>
    \n+#include <limits>
    \n+#include <lemon/core.h>
    \n+#include <lemon/maps.h>
    \n+#include <lemon/bin_heap.h>
    \n
    \n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  FibHeap< PR, IM, CMP >
     Fibonacci heap data structure. More...
    struct  CapacityScalingDefaultTraits< GR, V, C >
     Default traits class of CapacityScaling algorithm. More...
     
    class  CapacityScaling< GR, V, C, TR >
     Implementation of the Capacity Scaling algorithm for finding a minimum cost flow. More...
     
    struct  CapacityScaling< GR, V, C, TR >::SetHeap< T >
     Named parameter for setting Heap type. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,23 +6,31 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-fib_heap.h File Reference\n-Data_Structures \u00bb Heap_Structures\n+capacity_scaling.h File Reference\n+Algorithms \u00bb Minimum_Cost_Flow_Algorithms\n #include \n-#include \n-#include \n-#include \n+#include \n+#include \n+#include \n+#include \n Classes\n-class \u00a0FibHeap<_PR,_IM,_CMP_>\n-\u00a0 Fibonacci heap data structure. More...\n+struct \u00a0CapacityScalingDefaultTraits<_GR,_V,_C_>\n+\u00a0 Default traits class of CapacityScaling algorithm. More...\n+\u00a0\n+ class \u00a0CapacityScaling<_GR,_V,_C,_TR_>\n+\u00a0 Implementation of the Capacity Scaling algorithm for finding a minimum\n+ cost_flow. More...\n+\u00a0\n+struct \u00a0CapacityScaling<_GR,_V,_C,_TR_>::SetHeap<_T_>\n+\u00a0 Named_parameter for setting Heap type. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00401.html", "source2": "./usr/share/doc/lemon/html/a00401.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/adaptors.h File Reference\n+My Project: lemon/cycle_canceling.h File Reference\n \n \n \n \n \n \n \n@@ -72,70 +72,34 @@\n
  • lemon
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    adaptors.h File Reference
    Data Structures » Graph Structures » Adaptor Classes for Graphs
    \n+
    cycle_canceling.h File Reference
    Algorithms » Minimum Cost Flow Algorithms
    \n
    \n
    \n-

    Detailed Description

    \n-

    This file contains several useful adaptors for digraphs and graphs.

    \n-
    #include <lemon/core.h>
    \n-#include <lemon/maps.h>
    \n-#include <lemon/bits/variant.h>
    \n-#include <lemon/bits/graph_adaptor_extender.h>
    \n-#include <lemon/bits/map_extender.h>
    \n-#include <lemon/tolerance.h>
    \n-#include <algorithm>
    \n+
    #include <vector>
    \n+#include <limits>
    \n+#include <lemon/core.h>
    \n+#include <lemon/maps.h>
    \n+#include <lemon/path.h>
    \n+#include <lemon/math.h>
    \n+#include <lemon/static_graph.h>
    \n+#include <lemon/adaptors.h>
    \n+#include <lemon/circulation.h>
    \n+#include <lemon/bellman_ford.h>
    \n+#include <lemon/howard_mmc.h>
    \n+#include <lemon/hartmann_orlin_mmc.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    class  ReverseDigraph< DGR >
     Adaptor class for reversing the orientation of the arcs in a digraph. More...
     
    class  SubDigraph< DGR, NF, AF >
     Adaptor class for hiding nodes and arcs in a digraph. More...
     
    class  SubGraph< GR, NF, EF >
     Adaptor class for hiding nodes and edges in an undirected graph. More...
     
    class  FilterNodes< GR, NF >
     Adaptor class for hiding nodes in a digraph or a graph. More...
     
    class  FilterArcs< DGR, AF >
     Adaptor class for hiding arcs in a digraph. More...
     
    class  FilterEdges< GR, EF >
     Adaptor class for hiding edges in a graph. More...
     
    class  Undirector< DGR >
     Adaptor class for viewing a digraph as an undirected graph. More...
     
    class  Undirector< DGR >::CombinedArcMap< FW, BK >
     Arc map combined from two original arc maps. More...
     
    class  Orienter< GR, DM >
     Adaptor class for orienting the edges of a graph to get a digraph. More...
     
    class  ResidualDigraph< DGR, CM, FM, TL >
     Adaptor class for composing the residual digraph for directed flow and circulation problems. More...
     
    class  ResidualDigraph< DGR, CM, FM, TL >::ResidualCapacity
     Residual capacity map. More...
     
    class  SplitNodes< DGR >
     Adaptor class for splitting the nodes of a digraph. More...
     
    class  SplitNodes< DGR >::CombinedNodeMap< IN, OUT >
     Node map combined from two original node maps. More...
     
    class  SplitNodes< DGR >::CombinedArcMap< AM, NM >
     Arc map combined from an arc map and a node map of the original digraph. More...
    class  CycleCanceling< GR, V, C >
     Implementation of cycle-canceling algorithms for finding a minimum cost flow. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,72 +6,32 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-adaptors.h File Reference\n-Data_Structures \u00bb Graph_Structures \u00bb Adaptor_Classes_for_Graphs\n-***** Detailed Description *****\n-This file contains several useful adaptors for digraphs and graphs.\n+cycle_canceling.h File Reference\n+Algorithms \u00bb Minimum_Cost_Flow_Algorithms\n+#include \n+#include \n #include \n #include \n-#include \n-#include \n-#include \n-#include \n-#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n Classes\n-class \u00a0ReverseDigraph<_DGR_>\n-\u00a0 Adaptor class for reversing the orientation of the arcs in a digraph.\n- More...\n-\u00a0\n-class \u00a0SubDigraph<_DGR,_NF,_AF_>\n-\u00a0 Adaptor class for hiding nodes and arcs in a digraph. More...\n-\u00a0\n-class \u00a0SubGraph<_GR,_NF,_EF_>\n-\u00a0 Adaptor class for hiding nodes and edges in an undirected graph.\n- More...\n-\u00a0\n-class \u00a0FilterNodes<_GR,_NF_>\n-\u00a0 Adaptor class for hiding nodes in a digraph or a graph. More...\n-\u00a0\n-class \u00a0FilterArcs<_DGR,_AF_>\n-\u00a0 Adaptor class for hiding arcs in a digraph. More...\n-\u00a0\n-class \u00a0FilterEdges<_GR,_EF_>\n-\u00a0 Adaptor class for hiding edges in a graph. More...\n-\u00a0\n-class \u00a0Undirector<_DGR_>\n-\u00a0 Adaptor class for viewing a digraph as an undirected graph. More...\n-\u00a0\n-class \u00a0Undirector<_DGR_>::CombinedArcMap<_FW,_BK_>\n-\u00a0 Arc map combined from two original arc maps. More...\n-\u00a0\n-class \u00a0Orienter<_GR,_DM_>\n-\u00a0 Adaptor class for orienting the edges of a graph to get a digraph.\n- More...\n-\u00a0\n-class \u00a0ResidualDigraph<_DGR,_CM,_FM,_TL_>\n-\u00a0 Adaptor class for composing the residual digraph for directed flow and\n- circulation problems. More...\n-\u00a0\n-class \u00a0ResidualDigraph<_DGR,_CM,_FM,_TL_>::ResidualCapacity\n-\u00a0 Residual capacity map. More...\n-\u00a0\n-class \u00a0SplitNodes<_DGR_>\n-\u00a0 Adaptor class for splitting the nodes of a digraph. More...\n-\u00a0\n-class \u00a0SplitNodes<_DGR_>::CombinedNodeMap<_IN,_OUT_>\n-\u00a0 Node map combined from two original node maps. More...\n-\u00a0\n-class \u00a0SplitNodes<_DGR_>::CombinedArcMap<_AM,_NM_>\n-\u00a0 Arc map combined from an arc map and a node map of the original\n- digraph. More...\n+class \u00a0CycleCanceling<_GR,_V,_C_>\n+\u00a0 Implementation of cycle-canceling algorithms for finding a minimum_cost\n+ flow. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00404.html", "source2": "./usr/share/doc/lemon/html/a00404.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/preflow.h File Reference\n+My Project: lemon/howard_mmc.h File Reference\n \n \n \n \n \n \n \n@@ -72,36 +72,37 @@\n
  • lemon
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    preflow.h File Reference
    Algorithms » Maximum Flow Algorithms
    \n+
    howard_mmc.h File Reference
    Algorithms » Minimum Mean Cycle Algorithms
    \n
    \n
    \n-
    #include <lemon/tolerance.h>
    \n-#include <lemon/elevator.h>
    \n+
    #include <vector>
    \n+#include <limits>
    \n+#include <lemon/core.h>
    \n+#include <lemon/path.h>
    \n+#include <lemon/tolerance.h>
    \n+#include <lemon/connectivity.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    struct  PreflowDefaultTraits< GR, CAP >
     Default traits class of Preflow class. More...
    struct  HowardMmcDefaultTraits< GR, CM >
     Default traits class of HowardMmc class. More...
     
    class  Preflow< GR, CAP, TR >
     Preflow algorithm class. More...
    class  HowardMmc< GR, CM, TR >
     Implementation of Howard's algorithm for finding a minimum mean cycle. More...
     
    struct  Preflow< GR, CAP, TR >::SetFlowMap< T >
     Named parameter for setting FlowMap type More...
    struct  HowardMmc< GR, CM, TR >::SetLargeCost< T >
     Named parameter for setting LargeCost type. More...
     
    struct  Preflow< GR, CAP, TR >::SetElevator< T >
     Named parameter for setting Elevator type More...
     
    struct  Preflow< GR, CAP, TR >::SetStandardElevator< T >
     Named parameter for setting Elevator type with automatic allocation More...
    struct  HowardMmc< GR, CM, TR >::SetPath< T >
     Named parameter for setting Path type. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,34 +6,35 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-preflow.h File Reference\n-Algorithms \u00bb Maximum_Flow_Algorithms\n+howard_mmc.h File Reference\n+Algorithms \u00bb Minimum_Mean_Cycle_Algorithms\n+#include \n+#include \n+#include \n+#include \n #include \n-#include \n+#include \n Classes\n-struct \u00a0PreflowDefaultTraits<_GR,_CAP_>\n-\u00a0 Default traits class of Preflow class. More...\n+struct \u00a0HowardMmcDefaultTraits<_GR,_CM_>\n+\u00a0 Default traits class of HowardMmc class. More...\n \u00a0\n- class \u00a0Preflow<_GR,_CAP,_TR_>\n-\u00a0 Preflow algorithm class. More...\n-\u00a0\n-struct \u00a0Preflow<_GR,_CAP,_TR_>::SetFlowMap<_T_>\n-\u00a0 Named_parameter for setting FlowMap type More...\n+ class \u00a0HowardMmc<_GR,_CM,_TR_>\n+\u00a0 Implementation of Howard's algorithm for finding a minimum mean cycle.\n+ More...\n \u00a0\n-struct \u00a0Preflow<_GR,_CAP,_TR_>::SetElevator<_T_>\n-\u00a0 Named_parameter for setting Elevator type More...\n+struct \u00a0HowardMmc<_GR,_CM,_TR_>::SetLargeCost<_T_>\n+\u00a0 Named_parameter for setting LargeCost type. More...\n \u00a0\n-struct \u00a0Preflow<_GR,_CAP,_TR_>::SetStandardElevator<_T_>\n-\u00a0 Named_parameter for setting Elevator type with automatic allocation\n- More...\n+struct \u00a0HowardMmc<_GR,_CM,_TR_>::SetPath<_T_>\n+\u00a0 Named_parameter for setting Path type. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00407.html", "source2": "./usr/share/doc/lemon/html/a00407.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/cplex.h File Reference\n+My Project: lemon/edge_set.h File Reference\n \n \n \n \n \n \n \n@@ -72,36 +72,35 @@\n
  • lemon
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    cplex.h File Reference
    \n+
    edge_set.h File Reference
    Data Structures » Graph Structures
    \n
    \n
    \n-
    #include <lemon/lp_base.h>
    \n-#include <lemon/bits/lock.h>
    \n+

    Detailed Description

    \n+

    Graphs which use another graph's node-set as own.

    \n+
    #include <lemon/core.h>
    \n+#include <lemon/bits/edge_set_extender.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    class  CplexEnv
     Reference counted wrapper around cpxenv pointer. More...
    class  ListArcSet< GR >
     Digraph using a node set of another digraph or graph and an own arc set. More...
     
    class  CplexEnv::LicenseError
     This exception is thrown when the license check is not sufficient. More...
    class  ListEdgeSet< GR >
     Graph using a node set of another digraph or graph and an own edge set. More...
     
    class  CplexBase
     Base interface for the CPLEX LP and MIP solver. More...
    class  SmartArcSet< GR >
     Digraph using a node set of another digraph or graph and an own arc set. More...
     
    class  CplexLp
     Interface for the CPLEX LP solver. More...
     
    class  CplexMip
     Interface for the CPLEX MIP solver. More...
    class  SmartEdgeSet< GR >
     Graph using a node set of another digraph or graph and an own edge set. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,33 +6,36 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-cplex.h File Reference\n-#include \n-#include \n+edge_set.h File Reference\n+Data_Structures \u00bb Graph_Structures\n+***** Detailed Description *****\n+Graphs which use another graph's node-set as own.\n+#include \n+#include \n Classes\n-class \u00a0CplexEnv\n-\u00a0 Reference counted wrapper around cpxenv pointer. More...\n+class \u00a0ListArcSet<_GR_>\n+\u00a0 Digraph using a node set of another digraph or graph and an own arc\n+ set. More...\n \u00a0\n-class \u00a0CplexEnv::LicenseError\n-\u00a0 This exception is thrown when the license check is not sufficient.\n+class \u00a0ListEdgeSet<_GR_>\n+\u00a0 Graph using a node set of another digraph or graph and an own edge set.\n More...\n \u00a0\n-class \u00a0CplexBase\n-\u00a0 Base interface for the CPLEX LP and MIP solver. More...\n+class \u00a0SmartArcSet<_GR_>\n+\u00a0 Digraph using a node set of another digraph or graph and an own arc\n+ set. More...\n \u00a0\n-class \u00a0CplexLp\n-\u00a0 Interface for the CPLEX LP solver. More...\n-\u00a0\n-class \u00a0CplexMip\n-\u00a0 Interface for the CPLEX MIP solver. More...\n+class \u00a0SmartEdgeSet<_GR_>\n+\u00a0 Graph using a node set of another digraph or graph and an own edge set.\n+ More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00410.html", "source2": "./usr/share/doc/lemon/html/a00410.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/opt2_tsp.h File Reference\n+My Project: lemon/nearest_neighbor_tsp.h File Reference\n \n \n \n \n \n \n \n@@ -72,24 +72,27 @@\n
  • lemon
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    opt2_tsp.h File Reference
    Algorithms » Traveling Salesman Problem
    \n+
    nearest_neighbor_tsp.h File Reference
    Algorithms » Traveling Salesman Problem
    \n
    \n
    \n-
    #include <vector>
    \n-#include <lemon/full_graph.h>
    \n+
    #include <deque>
    \n+#include <vector>
    \n+#include <limits>
    \n+#include <lemon/full_graph.h>
    \n+#include <lemon/maps.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n+\n+\n \n

    \n Classes

    class  Opt2Tsp< CM >
     2-opt algorithm for symmetric TSP. More...
    class  NearestNeighborTsp< CM >
     Nearest neighbor algorithm for symmetric TSP. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,21 +6,24 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-opt2_tsp.h File Reference\n+nearest_neighbor_tsp.h File Reference\n Algorithms \u00bb Traveling_Salesman_Problem\n+#include \n #include \n+#include \n #include \n+#include \n Classes\n-class \u00a0Opt2Tsp<_CM_>\n-\u00a0 2-opt algorithm for symmetric TSP. More...\n+class \u00a0NearestNeighborTsp<_CM_>\n+\u00a0 Nearest neighbor algorithm for symmetric TSP. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00413.html", "source2": "./usr/share/doc/lemon/html/a00413.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/euler.h File Reference\n+My Project: lemon/preflow.h File Reference\n \n \n \n \n \n \n \n@@ -71,47 +71,44 @@\n \n \n \n
    \n
    \n Classes |\n-Namespaces |\n-Functions
    \n-
    euler.h File Reference
    Algorithms » Connectivity and Other Graph Properties
    \n+Namespaces
    \n+
    preflow.h File Reference
    Algorithms » Maximum Flow Algorithms
    \n \n
    \n-

    Detailed Description

    \n-

    This file provides Euler tour iterators and a function to check if a (di)graph is Eulerian.

    \n-
    #include <lemon/core.h>
    \n-#include <lemon/adaptors.h>
    \n-#include <lemon/connectivity.h>
    \n-#include <list>
    \n+
    #include <lemon/tolerance.h>
    \n+#include <lemon/elevator.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  DiEulerIt< GR >
     Euler tour iterator for digraphs. More...
    struct  PreflowDefaultTraits< GR, CAP >
     Default traits class of Preflow class. More...
     
    class  EulerIt< GR >
     Euler tour iterator for graphs. More...
    class  Preflow< GR, CAP, TR >
     Preflow algorithm class. More...
     
    struct  Preflow< GR, CAP, TR >::SetFlowMap< T >
     Named parameter for setting FlowMap type More...
     
    struct  Preflow< GR, CAP, TR >::SetElevator< T >
     Named parameter for setting Elevator type More...
     
    struct  Preflow< GR, CAP, TR >::SetStandardElevator< T >
     Named parameter for setting Elevator type with automatic allocation More...
     
    \n \n \n \n \n-

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n

    \n-Functions

    template<typename GR >
    bool eulerian (const GR &g)
     Check if the given graph is Eulerian.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,37 +5,37 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces | Functions\n-euler.h File Reference\n-Algorithms \u00bb Connectivity_and_Other_Graph_Properties\n-***** Detailed Description *****\n-This file provides Euler tour iterators and a function to check if a (di)graph\n-is Eulerian.\n-#include \n-#include \n-#include \n-#include \n+Classes | Namespaces\n+preflow.h File Reference\n+Algorithms \u00bb Maximum_Flow_Algorithms\n+#include \n+#include \n Classes\n-class \u00a0DiEulerIt<_GR_>\n-\u00a0 Euler tour iterator for digraphs. More...\n+struct \u00a0PreflowDefaultTraits<_GR,_CAP_>\n+\u00a0 Default traits class of Preflow class. More...\n \u00a0\n-class \u00a0EulerIt<_GR_>\n-\u00a0 Euler tour iterator for graphs. More...\n+ class \u00a0Preflow<_GR,_CAP,_TR_>\n+\u00a0 Preflow algorithm class. More...\n+\u00a0\n+struct \u00a0Preflow<_GR,_CAP,_TR_>::SetFlowMap<_T_>\n+\u00a0 Named_parameter for setting FlowMap type More...\n+\u00a0\n+struct \u00a0Preflow<_GR,_CAP,_TR_>::SetElevator<_T_>\n+\u00a0 Named_parameter for setting Elevator type More...\n+\u00a0\n+struct \u00a0Preflow<_GR,_CAP,_TR_>::SetStandardElevator<_T_>\n+\u00a0 Named_parameter for setting Elevator type with automatic allocation\n+ More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n- Functions\n-template\n-bool\u00a0eulerian (const GR &g)\n-\u00a0 Check if the given graph is Eulerian.\n-\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00416.html", "source2": "./usr/share/doc/lemon/html/a00416.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/network_simplex.h File Reference\n+My Project: lemon/binomial_heap.h File Reference\n \n \n \n \n \n \n \n@@ -72,27 +72,27 @@\n
  • lemon
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    network_simplex.h File Reference
    Algorithms » Minimum Cost Flow Algorithms
    \n+
    binomial_heap.h File Reference
    Data Structures » Heap Structures
    \n
    \n
    \n
    #include <vector>
    \n-#include <limits>
    \n-#include <algorithm>
    \n-#include <lemon/core.h>
    \n-#include <lemon/math.h>
    \n+#include <utility>
    \n+#include <functional>
    \n+#include <lemon/math.h>
    \n+#include <lemon/counter.h>
    \n
    \n \n-\n-\n+\n+\n \n

    \n Classes

    class  NetworkSimplex< GR, V, C >
     Implementation of the primal Network Simplex algorithm for finding a minimum cost flow. More...
    class  BinomialHeap< PR, IM, CMP >
     Binomial heap data structure. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,25 +6,24 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-network_simplex.h File Reference\n-Algorithms \u00bb Minimum_Cost_Flow_Algorithms\n+binomial_heap.h File Reference\n+Data_Structures \u00bb Heap_Structures\n #include \n-#include \n-#include \n-#include \n+#include \n+#include \n #include \n+#include \n Classes\n-class \u00a0NetworkSimplex<_GR,_V,_C_>\n-\u00a0 Implementation of the primal Network Simplex algorithm for finding a\n- minimum_cost_flow. More...\n+class \u00a0BinomialHeap<_PR,_IM,_CMP_>\n+\u00a0 Binomial heap data structure. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00419.html", "source2": "./usr/share/doc/lemon/html/a00419.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/karp_mmc.h File Reference\n+My Project: lemon/lp_skeleton.h File Reference\n \n \n \n \n \n \n \n@@ -72,37 +72,31 @@\n
  • lemon
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    karp_mmc.h File Reference
    Algorithms » Minimum Mean Cycle Algorithms
    \n+
    lp_skeleton.h File Reference
    \n
    \n
    \n-
    #include <vector>
    \n-#include <limits>
    \n-#include <lemon/core.h>
    \n-#include <lemon/path.h>
    \n-#include <lemon/tolerance.h>
    \n-#include <lemon/connectivity.h>
    \n+

    Detailed Description

    \n+

    The classes in this file do nothing, but they can serve as skeletons when implementing an interface to new solvers.

    \n+
    #include <lemon/lp_base.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    struct  KarpMmcDefaultTraits< GR, CM >
     Default traits class of KarpMmc class. More...
    class  SkeletonSolverBase
     A skeleton class to implement LP/MIP solver base interface. More...
     
    class  KarpMmc< GR, CM, TR >
     Implementation of Karp's algorithm for finding a minimum mean cycle. More...
    class  LpSkeleton
     Skeleton class for an LP solver interface. More...
     
    struct  KarpMmc< GR, CM, TR >::SetLargeCost< T >
     Named parameter for setting LargeCost type. More...
     
    struct  KarpMmc< GR, CM, TR >::SetPath< T >
     Named parameter for setting Path type. More...
    class  MipSkeleton
     Skeleton class for a MIP solver interface. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,35 +6,28 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-karp_mmc.h File Reference\n-Algorithms \u00bb Minimum_Mean_Cycle_Algorithms\n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n+lp_skeleton.h File Reference\n+***** Detailed Description *****\n+The classes in this file do nothing, but they can serve as skeletons when\n+implementing an interface to new solvers.\n+#include \n Classes\n-struct \u00a0KarpMmcDefaultTraits<_GR,_CM_>\n-\u00a0 Default traits class of KarpMmc class. More...\n+class \u00a0SkeletonSolverBase\n+\u00a0 A skeleton class to implement LP/MIP solver base interface. More...\n \u00a0\n- class \u00a0KarpMmc<_GR,_CM,_TR_>\n-\u00a0 Implementation of Karp's algorithm for finding a minimum mean cycle.\n- More...\n+class \u00a0LpSkeleton\n+\u00a0 Skeleton class for an LP solver interface. More...\n \u00a0\n-struct \u00a0KarpMmc<_GR,_CM,_TR_>::SetLargeCost<_T_>\n-\u00a0 Named_parameter for setting LargeCost type. More...\n-\u00a0\n-struct \u00a0KarpMmc<_GR,_CM,_TR_>::SetPath<_T_>\n-\u00a0 Named_parameter for setting Path type. More...\n+class \u00a0MipSkeleton\n+\u00a0 Skeleton class for a MIP solver interface. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00422.html", "source2": "./usr/share/doc/lemon/html/a00422.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/max_cardinality_search.h File Reference\n+My Project: lemon/math.h File Reference\n \n \n \n \n \n \n \n@@ -70,54 +70,83 @@\n
    \n \n
    \n \n
    \n
    \n-Classes |\n-Namespaces
    \n-
    max_cardinality_search.h File Reference
    Algorithms » Graph Search
    \n+Namespaces |\n+Functions |\n+Variables
    \n+
    math.h File Reference
    Tools and Utilities » Miscellaneous Tools
    \n \n
    \n-
    #include <lemon/bin_heap.h>
    \n-#include <lemon/bucket_heap.h>
    \n-#include <lemon/error.h>
    \n-#include <lemon/maps.h>
    \n-#include <functional>
    \n+

    Detailed Description

    \n+

    Some extensions to the standard cmath library.

    \n+

    This file includes the standard math library (cmath).

    \n+
    #include <cmath>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-

    \n-Classes

    struct  MaxCardinalitySearchDefaultTraits< GR, CAP >
     Default traits class of MaxCardinalitySearch class. More...
     
    class  MaxCardinalitySearch< GR, CAP, TR >
     Maximum Cardinality Search algorithm class. More...
     
    struct  MaxCardinalitySearch< GR, CAP, TR >::SetCapacityMap< T >
     Named parameter for setting CapacityMap type More...
     
    struct  MaxCardinalitySearch< GR, CAP, TR >::SetCardinalityMap< T >
     Named parameter for setting CardinalityMap type More...
     
    struct  MaxCardinalitySearch< GR, CAP, TR >::SetProcessedMap< T >
     Named parameter for setting ProcessedMap type More...
     
    struct  MaxCardinalitySearch< GR, CAP, TR >::SetHeap< H, CR >
     Named parameter for setting heap and cross reference type More...
     
    struct  MaxCardinalitySearch< GR, CAP, TR >::SetStandardHeap< H, CR >
     Named parameter for setting heap and cross reference type with automatic allocation More...
     
    \n \n \n \n \n+

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n+\n+\n+\n+\n+\n+\n+\n+

    \n+Functions

    bool isNaN (double v)
     Check whether the parameter is NaN or not.
     
    \n+double round (double r)
     Round a value to its closest integer.
     
    \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n

    \n+Variables

    \n+const long double E = 2.7182818284590452353602874713526625L
     The Euler constant.
     
    \n+const long double LOG2E = 1.4426950408889634073599246810018921L
     log_2(e)
     
    \n+const long double LOG10E = 0.4342944819032518276511289189166051L
     log_10(e)
     
    \n+const long double LN2 = 0.6931471805599453094172321214581766L
     ln(2)
     
    \n+const long double LN10 = 2.3025850929940456840179914546843642L
     ln(10)
     
    \n+const long double PI = 3.1415926535897932384626433832795029L
     pi
     
    \n+const long double PI_2 = 1.5707963267948966192313216916397514L
     pi/2
     
    \n+const long double PI_4 = 0.7853981633974483096156608458198757L
     pi/4
     
    \n+const long double SQRT2 = 1.4142135623730950488016887242096981L
     sqrt(2)
     
    \n+const long double SQRT1_2 = 0.7071067811865475244008443621048490L
     1/sqrt(2)
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,46 +5,60 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces\n-max_cardinality_search.h File Reference\n-Algorithms \u00bb Graph_Search\n-#include \n-#include \n-#include \n-#include \n-#include \n- Classes\n-struct \u00a0MaxCardinalitySearchDefaultTraits<_GR,_CAP_>\n-\u00a0 Default traits class of MaxCardinalitySearch class. More...\n-\u00a0\n- class \u00a0MaxCardinalitySearch<_GR,_CAP,_TR_>\n-\u00a0 Maximum Cardinality Search algorithm class. More...\n-\u00a0\n-struct \u00a0MaxCardinalitySearch<_GR,_CAP,_TR_>::SetCapacityMap<_T_>\n-\u00a0 Named_parameter for setting CapacityMap type More...\n-\u00a0\n-struct \u00a0MaxCardinalitySearch<_GR,_CAP,_TR_>::SetCardinalityMap<_T_>\n-\u00a0 Named_parameter for setting CardinalityMap type More...\n-\u00a0\n-struct \u00a0MaxCardinalitySearch<_GR,_CAP,_TR_>::SetProcessedMap<_T_>\n-\u00a0 Named_parameter for setting ProcessedMap type More...\n-\u00a0\n-struct \u00a0MaxCardinalitySearch<_GR,_CAP,_TR_>::SetHeap<_H,_CR_>\n-\u00a0 Named_parameter for setting heap and cross reference type More...\n-\u00a0\n-struct \u00a0MaxCardinalitySearch<_GR,_CAP,_TR_>::SetStandardHeap<_H,_CR_>\n-\u00a0 Named_parameter for setting heap and cross reference type with\n- automatic allocation More...\n-\u00a0\n+Namespaces | Functions | Variables\n+math.h File Reference\n+Tools_and_Utilities \u00bb Miscellaneous_Tools\n+***** Detailed Description *****\n+Some extensions to the standard cmath library.\n+This file includes the standard math library (cmath).\n+#include \n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n+ Functions\n+ bool\u00a0isNaN (double v)\n+\u00a0 Check whether the parameter is NaN or not.\n+\u00a0\n+double\u00a0round (double r)\n+\u00a0 Round a value to its closest integer.\n+\u00a0\n+ Variables\n+const long double\u00a0E = 2.7182818284590452353602874713526625L\n+\u00a0 The Euler constant.\n+\u00a0\n+const long double\u00a0LOG2E = 1.4426950408889634073599246810018921L\n+\u00a0 log_2(e)\n+\u00a0\n+const long double\u00a0LOG10E = 0.4342944819032518276511289189166051L\n+\u00a0 log_10(e)\n+\u00a0\n+const long double\u00a0LN2 = 0.6931471805599453094172321214581766L\n+\u00a0 ln(2)\n+\u00a0\n+const long double\u00a0LN10 = 2.3025850929940456840179914546843642L\n+\u00a0 ln(10)\n+\u00a0\n+const long double\u00a0PI = 3.1415926535897932384626433832795029L\n+\u00a0 pi\n+\u00a0\n+const long double\u00a0PI_2 = 1.5707963267948966192313216916397514L\n+\u00a0 pi/2\n+\u00a0\n+const long double\u00a0PI_4 = 0.7853981633974483096156608458198757L\n+\u00a0 pi/4\n+\u00a0\n+const long double\u00a0SQRT2 = 1.4142135623730950488016887242096981L\n+\u00a0 sqrt(2)\n+\u00a0\n+const long double\u00a0SQRT1_2 = 0.7071067811865475244008443621048490L\n+\u00a0 1/sqrt(2)\n+\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00425.html", "source2": "./usr/share/doc/lemon/html/a00425.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/suurballe.h File Reference\n+My Project: lemon/color.cc File Reference\n \n \n \n \n \n \n \n@@ -70,53 +70,89 @@\n
    \n \n
    \n \n
    \n
    \n-Classes |\n-Namespaces
    \n-
    suurballe.h File Reference
    Algorithms » Shortest Path Algorithms
    \n+Namespaces |\n+Variables
    \n+
    color.cc File Reference
    \n \n
    \n-
    #include <vector>
    \n-#include <limits>
    \n-#include <lemon/bin_heap.h>
    \n-#include <lemon/path.h>
    \n-#include <lemon/list_graph.h>
    \n-#include <lemon/dijkstra.h>
    \n-#include <lemon/maps.h>
    \n+
    #include <lemon/color.h>
    \n
    \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-

    \n-Classes

    struct  SuurballeDefaultTraits< GR, LEN >
     Default traits class of Suurballe algorithm. More...
     
    class  Suurballe< GR, LEN, TR >
     Algorithm for finding arc-disjoint paths between two nodes having minimum total length. More...
     
    struct  Suurballe< GR, LEN, TR >::SetFlowMap< T >
     Named parameter for setting FlowMap type. More...
     
    struct  Suurballe< GR, LEN, TR >::SetPotentialMap< T >
     Named parameter for setting PotentialMap type. More...
     
    struct  Suurballe< GR, LEN, TR >::SetPath< T >
     Named parameter for setting Path type. More...
     
    struct  Suurballe< GR, LEN, TR >::SetHeap< H, CR >
     Named parameter for setting Heap and HeapCrossRef types. More...
     
    \n \n \n \n \n+

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n

    \n+Variables

    \n+const Color WHITE (1, 1, 1)
     White color constant.
     
    \n+const Color BLACK (0, 0, 0)
     Black color constant.
     
    \n+const Color RED (1, 0, 0)
     Red color constant.
     
    \n+const Color GREEN (0, 1, 0)
     Green color constant.
     
    \n+const Color BLUE (0, 0, 1)
     Blue color constant.
     
    \n+const Color YELLOW (1, 1, 0)
     Yellow color constant.
     
    \n+const Color MAGENTA (1, 0, 1)
     Magenta color constant.
     
    \n+const Color CYAN (0, 1, 1)
     Cyan color constant.
     
    \n+const Color GREY (0, 0, 0)
     Grey color constant.
     
    \n+const Color DARK_RED (.5, 0, 0)
     Dark red color constant.
     
    \n+const Color DARK_GREEN (0,.5, 0)
     Dark green color constant.
     
    \n+const Color DARK_BLUE (0, 0,.5)
     Drak blue color constant.
     
    \n+const Color DARK_YELLOW (.5,.5, 0)
     Dark yellow color constant.
     
    \n+const Color DARK_MAGENTA (.5, 0,.5)
     Dark magenta color constant.
     
    \n+const Color DARK_CYAN (0,.5,.5)
     Dark cyan color constant.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,45 +5,64 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces\n-suurballe.h File Reference\n-Algorithms \u00bb Shortest_Path_Algorithms\n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n-#include \n- Classes\n-struct \u00a0SuurballeDefaultTraits<_GR,_LEN_>\n-\u00a0 Default traits class of Suurballe algorithm. More...\n-\u00a0\n- class \u00a0Suurballe<_GR,_LEN,_TR_>\n-\u00a0 Algorithm for finding arc-disjoint paths between two nodes having\n- minimum total length. More...\n-\u00a0\n-struct \u00a0Suurballe<_GR,_LEN,_TR_>::SetFlowMap<_T_>\n-\u00a0 Named_parameter for setting FlowMap type. More...\n+Namespaces | Variables\n+color.cc File Reference\n+#include \n+ Namespaces\n+namespace \u00a0lemon\n+\u00a0 The namespace of LEMON.\n \u00a0\n-struct \u00a0Suurballe<_GR,_LEN,_TR_>::SetPotentialMap<_T_>\n-\u00a0 Named_parameter for setting PotentialMap type. More...\n+ Variables\n+const Color\u00a0WHITE (1, 1, 1)\n+\u00a0 White color constant.\n \u00a0\n-struct \u00a0Suurballe<_GR,_LEN,_TR_>::SetPath<_T_>\n-\u00a0 Named_parameter for setting Path type. More...\n+const Color\u00a0BLACK (0, 0, 0)\n+\u00a0 Black color constant.\n \u00a0\n-struct \u00a0Suurballe<_GR,_LEN,_TR_>::SetHeap<_H,_CR_>\n-\u00a0 Named_parameter for setting Heap and HeapCrossRef types. More...\n+const Color\u00a0RED (1, 0, 0)\n+\u00a0 Red color constant.\n \u00a0\n- Namespaces\n-namespace \u00a0lemon\n-\u00a0 The namespace of LEMON.\n+const Color\u00a0GREEN (0, 1, 0)\n+\u00a0 Green color constant.\n+\u00a0\n+const Color\u00a0BLUE (0, 0, 1)\n+\u00a0 Blue color constant.\n+\u00a0\n+const Color\u00a0YELLOW (1, 1, 0)\n+\u00a0 Yellow color constant.\n+\u00a0\n+const Color\u00a0MAGENTA (1, 0, 1)\n+\u00a0 Magenta color constant.\n+\u00a0\n+const Color\u00a0CYAN (0, 1, 1)\n+\u00a0 Cyan color constant.\n+\u00a0\n+const Color\u00a0GREY (0, 0, 0)\n+\u00a0 Grey color constant.\n+\u00a0\n+const Color\u00a0DARK_RED (.5, 0, 0)\n+\u00a0 Dark red color constant.\n+\u00a0\n+const Color\u00a0DARK_GREEN (0,.5, 0)\n+\u00a0 Dark green color constant.\n+\u00a0\n+const Color\u00a0DARK_BLUE (0, 0,.5)\n+\u00a0 Drak blue color constant.\n+\u00a0\n+const Color\u00a0DARK_YELLOW (.5,.5, 0)\n+\u00a0 Dark yellow color constant.\n+\u00a0\n+const Color\u00a0DARK_MAGENTA (.5, 0,.5)\n+\u00a0 Dark magenta color constant.\n+\u00a0\n+const Color\u00a0DARK_CYAN (0,.5,.5)\n+\u00a0 Dark cyan color constant.\n \u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00428.html", "source2": "./usr/share/doc/lemon/html/a00428.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/full_graph.h File Reference\n+My Project: lemon/cbc.h File Reference\n \n \n \n \n \n \n \n@@ -72,30 +72,23 @@\n
  • lemon
    • \n
    \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    full_graph.h File Reference
    Data Structures » Graph Structures
    \n+
    cbc.h File Reference
    General Optimization Tools » LP and MIP Solvers
    \n
    \n
    \n-
    #include <lemon/core.h>
    \n-#include <lemon/bits/graph_extender.h>
    \n+
    #include <lemon/lp_base.h>
    \n
    \n \n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    class  FullDigraph
     A directed full graph class. More...
     
    class  FullGraph
     An undirected full graph class. More...
     
    class  FullBpGraph
     An undirected full bipartite graph class. More...
    class  CbcMip
     Interface for the CBC MIP solver. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -6,27 +6,20 @@\n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n Classes | Namespaces\n-full_graph.h File Reference\n-Data_Structures \u00bb Graph_Structures\n-#include \n-#include \n+cbc.h File Reference\n+General_Optimization_Tools \u00bb LP_and_MIP_Solvers\n+#include \n Classes\n-class \u00a0FullDigraph\n-\u00a0 A directed full graph class. More...\n-\u00a0\n-class \u00a0FullGraph\n-\u00a0 An undirected full graph class. More...\n-\u00a0\n-class \u00a0FullBpGraph\n-\u00a0 An undirected full bipartite graph class. More...\n+class \u00a0CbcMip\n+\u00a0 Interface for the CBC MIP solver. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n \n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00482.html", "source2": "./usr/share/doc/lemon/html/a00482.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/concepts/graph.h File Reference\n+My Project: lemon/concepts/bpgraph.h File Reference\n \n \n \n \n \n \n \n@@ -72,62 +72,80 @@\n
  • lemon
  • concepts
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    graph.h File Reference
    Concepts » Graph Structure Concepts
    \n+
    bpgraph.h File Reference
    Concepts » Graph Structure Concepts
    \n
    \n
    \n-
    #include <lemon/concepts/graph_components.h>
    \n+
    #include <lemon/concepts/graph_components.h>
    \n #include <lemon/concepts/maps.h>
    \n-#include <lemon/concept_check.h>
    \n-#include <lemon/core.h>
    \n+#include <lemon/concept_check.h>
    \n+#include <lemon/core.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  Graph
     Class describing the concept of undirected graphs. More...
    class  BpGraph
     Class describing the concept of undirected bipartite graphs. More...
     
    class  Graph::Node
     The node type of the graph. More...
    class  BpGraph::Node
     The node type of the graph. More...
     
    class  Graph::NodeIt
     Iterator class for the nodes. More...
    class  BpGraph::RedNode
     Class to represent red nodes. More...
     
    class  Graph::Edge
     The edge type of the graph. More...
    class  BpGraph::BlueNode
     Class to represent blue nodes. More...
     
    class  Graph::EdgeIt
     Iterator class for the edges. More...
    class  BpGraph::RedNodeIt
     Iterator class for the red nodes. More...
     
    class  Graph::IncEdgeIt
     Iterator class for the incident edges of a node. More...
    class  BpGraph::BlueNodeIt
     Iterator class for the blue nodes. More...
     
    class  Graph::Arc
     The arc type of the graph. More...
    class  BpGraph::NodeIt
     Iterator class for the nodes. More...
     
    class  Graph::ArcIt
     Iterator class for the arcs. More...
    class  BpGraph::Edge
     The edge type of the graph. More...
     
    class  Graph::OutArcIt
     Iterator class for the outgoing arcs of a node. More...
    class  BpGraph::EdgeIt
     Iterator class for the edges. More...
     
    class  Graph::InArcIt
     Iterator class for the incoming arcs of a node. More...
    class  BpGraph::IncEdgeIt
     Iterator class for the incident edges of a node. More...
     
    class  Graph::NodeMap< T >
     Standard graph map type for the nodes. More...
    class  BpGraph::Arc
     The arc type of the graph. More...
     
    class  Graph::ArcMap< T >
     Standard graph map type for the arcs. More...
    class  BpGraph::ArcIt
     Iterator class for the arcs. More...
     
    class  Graph::EdgeMap< T >
     Standard graph map type for the edges. More...
    class  BpGraph::OutArcIt
     Iterator class for the outgoing arcs of a node. More...
     
    class  BpGraph::InArcIt
     Iterator class for the incoming arcs of a node. More...
     
    class  BpGraph::NodeMap< T >
     Standard graph map type for the nodes. More...
     
    class  BpGraph::RedNodeMap< T >
     Standard graph map type for the red nodes. More...
     
    class  BpGraph::BlueNodeMap< T >
     Standard graph map type for the blue nodes. More...
     
    class  BpGraph::ArcMap< T >
     Standard graph map type for the arcs. More...
     
    class  BpGraph::EdgeMap< T >
     Standard graph map type for the edges. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -7,58 +7,76 @@\n \n Loading...\n Searching...\n No Matches\n * lemon\n * concepts\n Classes | Namespaces\n-graph.h File Reference\n+bpgraph.h File Reference\n Concepts \u00bb Graph_Structure_Concepts\n #include \n #include \n #include \n #include \n Classes\n-class \u00a0Graph\n-\u00a0 Class describing the concept of undirected graphs. More...\n+class \u00a0BpGraph\n+\u00a0 Class describing the concept of undirected bipartite graphs. More...\n \u00a0\n-class \u00a0Graph::Node\n+class \u00a0BpGraph::Node\n \u00a0 The node type of the graph. More...\n \u00a0\n-class \u00a0Graph::NodeIt\n+class \u00a0BpGraph::RedNode\n+\u00a0 Class to represent red nodes. More...\n+\u00a0\n+class \u00a0BpGraph::BlueNode\n+\u00a0 Class to represent blue nodes. More...\n+\u00a0\n+class \u00a0BpGraph::RedNodeIt\n+\u00a0 Iterator class for the red nodes. More...\n+\u00a0\n+class \u00a0BpGraph::BlueNodeIt\n+\u00a0 Iterator class for the blue nodes. More...\n+\u00a0\n+class \u00a0BpGraph::NodeIt\n \u00a0 Iterator class for the nodes. More...\n \u00a0\n-class \u00a0Graph::Edge\n+class \u00a0BpGraph::Edge\n \u00a0 The edge type of the graph. More...\n \u00a0\n-class \u00a0Graph::EdgeIt\n+class \u00a0BpGraph::EdgeIt\n \u00a0 Iterator class for the edges. More...\n \u00a0\n-class \u00a0Graph::IncEdgeIt\n+class \u00a0BpGraph::IncEdgeIt\n \u00a0 Iterator class for the incident edges of a node. More...\n \u00a0\n-class \u00a0Graph::Arc\n+class \u00a0BpGraph::Arc\n \u00a0 The arc type of the graph. More...\n \u00a0\n-class \u00a0Graph::ArcIt\n+class \u00a0BpGraph::ArcIt\n \u00a0 Iterator class for the arcs. More...\n \u00a0\n-class \u00a0Graph::OutArcIt\n+class \u00a0BpGraph::OutArcIt\n \u00a0 Iterator class for the outgoing arcs of a node. More...\n \u00a0\n-class \u00a0Graph::InArcIt\n+class \u00a0BpGraph::InArcIt\n \u00a0 Iterator class for the incoming arcs of a node. More...\n \u00a0\n-class \u00a0Graph::NodeMap<_T_>\n+class \u00a0BpGraph::NodeMap<_T_>\n \u00a0 Standard graph map type for the nodes. More...\n \u00a0\n-class \u00a0Graph::ArcMap<_T_>\n+class \u00a0BpGraph::RedNodeMap<_T_>\n+\u00a0 Standard graph map type for the red nodes. More...\n+\u00a0\n+class \u00a0BpGraph::BlueNodeMap<_T_>\n+\u00a0 Standard graph map type for the blue nodes. More...\n+\u00a0\n+class \u00a0BpGraph::ArcMap<_T_>\n \u00a0 Standard graph map type for the arcs. More...\n \u00a0\n-class \u00a0Graph::EdgeMap<_T_>\n+class \u00a0BpGraph::EdgeMap<_T_>\n \u00a0 Standard graph map type for the edges. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n namespace \u00a0lemon::concepts\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00485.html", "source2": "./usr/share/doc/lemon/html/a00485.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/concepts/digraph.h File Reference\n+My Project: lemon/concepts/heap.h File Reference\n \n \n \n \n \n \n \n@@ -72,50 +72,24 @@\n
  • lemon
  • concepts
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    digraph.h File Reference
    Concepts » Graph Structure Concepts
    \n+
    heap.h File Reference
    Concepts
    \n
    \n
    \n-
    #include <lemon/core.h>
    \n-#include <lemon/concepts/maps.h>
    \n-#include <lemon/concept_check.h>
    \n-#include <lemon/concepts/graph_components.h>
    \n+
    #include <lemon/core.h>
    \n+#include <lemon/concept_check.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    class  Digraph
     Class describing the concept of directed graphs. More...
     
    class  Digraph::Node
     The node type of the digraph. More...
     
    class  Digraph::NodeIt
     Iterator class for the nodes. More...
     
    class  Digraph::Arc
     The arc type of the digraph. More...
     
    class  Digraph::OutArcIt
     Iterator class for the outgoing arcs of a node. More...
     
    class  Digraph::InArcIt
     Iterator class for the incoming arcs of a node. More...
     
    class  Digraph::ArcIt
     Iterator class for the arcs. More...
     
    class  Digraph::NodeMap< T >
     Standard graph map type for the nodes. More...
     
    class  Digraph::ArcMap< T >
     Standard graph map type for the arcs. More...
    class  Heap< PR, IM, CMP >
     The heap concept. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -7,47 +7,21 @@\n \n Loading...\n Searching...\n No Matches\n * lemon\n * concepts\n Classes | Namespaces\n-digraph.h File Reference\n-Concepts \u00bb Graph_Structure_Concepts\n+heap.h File Reference\n+Concepts\n #include \n-#include \n #include \n-#include \n Classes\n-class \u00a0Digraph\n-\u00a0 Class describing the concept of directed graphs. More...\n-\u00a0\n-class \u00a0Digraph::Node\n-\u00a0 The node type of the digraph. More...\n-\u00a0\n-class \u00a0Digraph::NodeIt\n-\u00a0 Iterator class for the nodes. More...\n-\u00a0\n-class \u00a0Digraph::Arc\n-\u00a0 The arc type of the digraph. More...\n-\u00a0\n-class \u00a0Digraph::OutArcIt\n-\u00a0 Iterator class for the outgoing arcs of a node. More...\n-\u00a0\n-class \u00a0Digraph::InArcIt\n-\u00a0 Iterator class for the incoming arcs of a node. More...\n-\u00a0\n-class \u00a0Digraph::ArcIt\n-\u00a0 Iterator class for the arcs. More...\n-\u00a0\n-class \u00a0Digraph::NodeMap<_T_>\n-\u00a0 Standard graph map type for the nodes. More...\n-\u00a0\n-class \u00a0Digraph::ArcMap<_T_>\n-\u00a0 Standard graph map type for the arcs. More...\n+class \u00a0Heap<_PR,_IM,_CMP_>\n+\u00a0 The heap concept. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n namespace \u00a0lemon::concepts\n \u00a0 The namespace of LEMON concepts and concept checking classes.\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00488.html", "source2": "./usr/share/doc/lemon/html/a00488.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/concepts/graph_components.h File Reference\n+My Project: lemon/concepts/graph.h File Reference\n \n \n \n \n \n \n \n@@ -72,130 +72,62 @@\n
  • lemon
  • concepts
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    graph_components.h File Reference
    Concepts » Graph Structure Concepts
    \n+
    graph.h File Reference
    Concepts » Graph Structure Concepts
    \n
    \n
    \n-
    #include <lemon/core.h>
    \n+
    #include <lemon/concepts/graph_components.h>
    \n #include <lemon/concepts/maps.h>
    \n-#include <lemon/bits/alteration_notifier.h>
    \n+#include <lemon/concept_check.h>
    \n+#include <lemon/core.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    class  GraphItem
     Concept class for Node, Arc and Edge types. More...
    class  Graph
     Class describing the concept of undirected graphs. More...
     
    class  BaseDigraphComponent
     Base skeleton class for directed graphs. More...
    class  Graph::Node
     The node type of the graph. More...
     
    class  BaseGraphComponent
     Base skeleton class for undirected graphs. More...
    class  Graph::NodeIt
     Iterator class for the nodes. More...
     
    class  BaseGraphComponent::Edge
     Undirected edge class of the graph. More...
    class  Graph::Edge
     The edge type of the graph. More...
     
    class  BaseBpGraphComponent
     Base skeleton class for undirected bipartite graphs. More...
    class  Graph::EdgeIt
     Iterator class for the edges. More...
     
    class  BaseBpGraphComponent::RedNode
     Class to represent red nodes. More...
    class  Graph::IncEdgeIt
     Iterator class for the incident edges of a node. More...
     
    class  BaseBpGraphComponent::BlueNode
     Class to represent blue nodes. More...
    class  Graph::Arc
     The arc type of the graph. More...
     
    class  IDableDigraphComponent< BAS >
     Skeleton class for idable directed graphs. More...
    class  Graph::ArcIt
     Iterator class for the arcs. More...
     
    class  IDableGraphComponent< BAS >
     Skeleton class for idable undirected graphs. More...
    class  Graph::OutArcIt
     Iterator class for the outgoing arcs of a node. More...
     
    class  IDableBpGraphComponent< BAS >
     Skeleton class for idable undirected bipartite graphs. More...
    class  Graph::InArcIt
     Iterator class for the incoming arcs of a node. More...
     
    class  GraphItemIt< GR, Item >
     Concept class for NodeIt, ArcIt and EdgeIt types. More...
    class  Graph::NodeMap< T >
     Standard graph map type for the nodes. More...
     
    class  GraphIncIt< GR, Item, Base, sel >
     Concept class for InArcIt, OutArcIt and IncEdgeIt types. More...
    class  Graph::ArcMap< T >
     Standard graph map type for the arcs. More...
     
    class  IterableDigraphComponent< BAS >
     Skeleton class for iterable directed graphs. More...
     
    class  IterableGraphComponent< BAS >
     Skeleton class for iterable undirected graphs. More...
     
    class  IterableBpGraphComponent< BAS >
     Skeleton class for iterable undirected bipartite graphs. More...
     
    class  AlterableDigraphComponent< BAS >
     Skeleton class for alterable directed graphs. More...
     
    class  AlterableGraphComponent< BAS >
     Skeleton class for alterable undirected graphs. More...
     
    class  AlterableBpGraphComponent< BAS >
     Skeleton class for alterable undirected bipartite graphs. More...
     
    class  GraphMap< GR, K, V >
     Concept class for standard graph maps. More...
     
    class  MappableDigraphComponent< BAS >
     Skeleton class for mappable directed graphs. More...
     
    class  MappableDigraphComponent< BAS >::NodeMap< V >
     Standard graph map for the nodes. More...
     
    class  MappableDigraphComponent< BAS >::ArcMap< V >
     Standard graph map for the arcs. More...
     
    class  MappableGraphComponent< BAS >
     Skeleton class for mappable undirected graphs. More...
     
    class  MappableGraphComponent< BAS >::EdgeMap< V >
     Standard graph map for the edges. More...
     
    class  MappableBpGraphComponent< BAS >
     Skeleton class for mappable undirected bipartite graphs. More...
     
    class  MappableBpGraphComponent< BAS >::RedNodeMap< V >
     Standard graph map for the red nodes. More...
     
    class  MappableBpGraphComponent< BAS >::BlueNodeMap< V >
     Standard graph map for the blue nodes. More...
     
    class  ExtendableDigraphComponent< BAS >
     Skeleton class for extendable directed graphs. More...
     
    class  ExtendableGraphComponent< BAS >
     Skeleton class for extendable undirected graphs. More...
     
    class  ExtendableBpGraphComponent< BAS >
     Skeleton class for extendable undirected bipartite graphs. More...
     
    class  ErasableDigraphComponent< BAS >
     Skeleton class for erasable directed graphs. More...
     
    class  ErasableGraphComponent< BAS >
     Skeleton class for erasable undirected graphs. More...
     
    class  ErasableBpGraphComponent< BAS >
     Skeleton class for erasable undirected graphs. More...
     
    class  ClearableDigraphComponent< BAS >
     Skeleton class for clearable directed graphs. More...
     
    class  ClearableGraphComponent< BAS >
     Skeleton class for clearable undirected graphs. More...
     
    class  ClearableBpGraphComponent< BAS >
     Skeleton class for clearable undirected biparite graphs. More...
    class  Graph::EdgeMap< T >
     Standard graph map type for the edges. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -7,127 +7,59 @@\n \n Loading...\n Searching...\n No Matches\n * lemon\n * concepts\n Classes | Namespaces\n-graph_components.h File Reference\n+graph.h File Reference\n Concepts \u00bb Graph_Structure_Concepts\n-#include \n+#include \n #include \n-#include \n+#include \n+#include \n Classes\n-class \u00a0GraphItem\n-\u00a0 Concept class for Node, Arc and Edge types. More...\n-\u00a0\n-class \u00a0BaseDigraphComponent\n-\u00a0 Base skeleton class for directed graphs. More...\n-\u00a0\n-class \u00a0BaseGraphComponent\n-\u00a0 Base skeleton class for undirected graphs. More...\n-\u00a0\n-class \u00a0BaseGraphComponent::Edge\n-\u00a0 Undirected edge class of the graph. More...\n-\u00a0\n-class \u00a0BaseBpGraphComponent\n-\u00a0 Base skeleton class for undirected bipartite graphs. More...\n-\u00a0\n-class \u00a0BaseBpGraphComponent::RedNode\n-\u00a0 Class to represent red nodes. More...\n-\u00a0\n-class \u00a0BaseBpGraphComponent::BlueNode\n-\u00a0 Class to represent blue nodes. More...\n-\u00a0\n-class \u00a0IDableDigraphComponent<_BAS_>\n-\u00a0 Skeleton class for idable directed graphs. More...\n-\u00a0\n-class \u00a0IDableGraphComponent<_BAS_>\n-\u00a0 Skeleton class for idable undirected graphs. More...\n-\u00a0\n-class \u00a0IDableBpGraphComponent<_BAS_>\n-\u00a0 Skeleton class for idable undirected bipartite graphs. More...\n-\u00a0\n-class \u00a0GraphItemIt<_GR,_Item_>\n-\u00a0 Concept class for NodeIt, ArcIt and EdgeIt types. More...\n-\u00a0\n-class \u00a0GraphIncIt<_GR,_Item,_Base,_sel_>\n-\u00a0 Concept class for InArcIt, OutArcIt and IncEdgeIt types. More...\n-\u00a0\n-class \u00a0IterableDigraphComponent<_BAS_>\n-\u00a0 Skeleton class for iterable directed graphs. More...\n-\u00a0\n-class \u00a0IterableGraphComponent<_BAS_>\n-\u00a0 Skeleton class for iterable undirected graphs. More...\n-\u00a0\n-class \u00a0IterableBpGraphComponent<_BAS_>\n-\u00a0 Skeleton class for iterable undirected bipartite graphs. More...\n-\u00a0\n-class \u00a0AlterableDigraphComponent<_BAS_>\n-\u00a0 Skeleton class for alterable directed graphs. More...\n-\u00a0\n-class \u00a0AlterableGraphComponent<_BAS_>\n-\u00a0 Skeleton class for alterable undirected graphs. More...\n-\u00a0\n-class \u00a0AlterableBpGraphComponent<_BAS_>\n-\u00a0 Skeleton class for alterable undirected bipartite graphs. More...\n-\u00a0\n-class \u00a0GraphMap<_GR,_K,_V_>\n-\u00a0 Concept class for standard graph maps. More...\n-\u00a0\n-class \u00a0MappableDigraphComponent<_BAS_>\n-\u00a0 Skeleton class for mappable directed graphs. More...\n-\u00a0\n-class \u00a0MappableDigraphComponent<_BAS_>::NodeMap<_V_>\n-\u00a0 Standard graph map for the nodes. More...\n-\u00a0\n-class \u00a0MappableDigraphComponent<_BAS_>::ArcMap<_V_>\n-\u00a0 Standard graph map for the arcs. More...\n-\u00a0\n-class \u00a0MappableGraphComponent<_BAS_>\n-\u00a0 Skeleton class for mappable undirected graphs. More...\n-\u00a0\n-class \u00a0MappableGraphComponent<_BAS_>::EdgeMap<_V_>\n-\u00a0 Standard graph map for the edges. More...\n+class \u00a0Graph\n+\u00a0 Class describing the concept of undirected graphs. More...\n \u00a0\n-class \u00a0MappableBpGraphComponent<_BAS_>\n-\u00a0 Skeleton class for mappable undirected bipartite graphs. More...\n+class \u00a0Graph::Node\n+\u00a0 The node type of the graph. More...\n \u00a0\n-class \u00a0MappableBpGraphComponent<_BAS_>::RedNodeMap<_V_>\n-\u00a0 Standard graph map for the red nodes. More...\n+class \u00a0Graph::NodeIt\n+\u00a0 Iterator class for the nodes. More...\n \u00a0\n-class \u00a0MappableBpGraphComponent<_BAS_>::BlueNodeMap<_V_>\n-\u00a0 Standard graph map for the blue nodes. More...\n+class \u00a0Graph::Edge\n+\u00a0 The edge type of the graph. More...\n \u00a0\n-class \u00a0ExtendableDigraphComponent<_BAS_>\n-\u00a0 Skeleton class for extendable directed graphs. More...\n+class \u00a0Graph::EdgeIt\n+\u00a0 Iterator class for the edges. More...\n \u00a0\n-class \u00a0ExtendableGraphComponent<_BAS_>\n-\u00a0 Skeleton class for extendable undirected graphs. More...\n+class \u00a0Graph::IncEdgeIt\n+\u00a0 Iterator class for the incident edges of a node. More...\n \u00a0\n-class \u00a0ExtendableBpGraphComponent<_BAS_>\n-\u00a0 Skeleton class for extendable undirected bipartite graphs. More...\n+class \u00a0Graph::Arc\n+\u00a0 The arc type of the graph. More...\n \u00a0\n-class \u00a0ErasableDigraphComponent<_BAS_>\n-\u00a0 Skeleton class for erasable directed graphs. More...\n+class \u00a0Graph::ArcIt\n+\u00a0 Iterator class for the arcs. More...\n \u00a0\n-class \u00a0ErasableGraphComponent<_BAS_>\n-\u00a0 Skeleton class for erasable undirected graphs. More...\n+class \u00a0Graph::OutArcIt\n+\u00a0 Iterator class for the outgoing arcs of a node. More...\n \u00a0\n-class \u00a0ErasableBpGraphComponent<_BAS_>\n-\u00a0 Skeleton class for erasable undirected graphs. More...\n+class \u00a0Graph::InArcIt\n+\u00a0 Iterator class for the incoming arcs of a node. More...\n \u00a0\n-class \u00a0ClearableDigraphComponent<_BAS_>\n-\u00a0 Skeleton class for clearable directed graphs. More...\n+class \u00a0Graph::NodeMap<_T_>\n+\u00a0 Standard graph map type for the nodes. More...\n \u00a0\n-class \u00a0ClearableGraphComponent<_BAS_>\n-\u00a0 Skeleton class for clearable undirected graphs. More...\n+class \u00a0Graph::ArcMap<_T_>\n+\u00a0 Standard graph map type for the arcs. More...\n \u00a0\n-class \u00a0ClearableBpGraphComponent<_BAS_>\n-\u00a0 Skeleton class for clearable undirected biparite graphs. More...\n+class \u00a0Graph::EdgeMap<_T_>\n+\u00a0 Standard graph map type for the edges. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n namespace \u00a0lemon::concepts\n \u00a0 The namespace of LEMON concepts and concept checking classes.\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00491.html", "source2": "./usr/share/doc/lemon/html/a00491.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/concepts/heap.h File Reference\n+My Project: lemon/concepts/graph_components.h File Reference\n \n \n \n \n \n \n \n@@ -72,24 +72,130 @@\n
  • lemon
  • concepts
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    heap.h File Reference
    Concepts
    \n+
    graph_components.h File Reference
    Concepts » Graph Structure Concepts
    \n
    \n
    \n-
    #include <lemon/core.h>
    \n-#include <lemon/concept_check.h>
    \n+
    #include <lemon/core.h>
    \n+#include <lemon/concepts/maps.h>
    \n+#include <lemon/bits/alteration_notifier.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

    \n Classes

    class  Heap< PR, IM, CMP >
     The heap concept. More...
    class  GraphItem
     Concept class for Node, Arc and Edge types. More...
     
    class  BaseDigraphComponent
     Base skeleton class for directed graphs. More...
     
    class  BaseGraphComponent
     Base skeleton class for undirected graphs. More...
     
    class  BaseGraphComponent::Edge
     Undirected edge class of the graph. More...
     
    class  BaseBpGraphComponent
     Base skeleton class for undirected bipartite graphs. More...
     
    class  BaseBpGraphComponent::RedNode
     Class to represent red nodes. More...
     
    class  BaseBpGraphComponent::BlueNode
     Class to represent blue nodes. More...
     
    class  IDableDigraphComponent< BAS >
     Skeleton class for idable directed graphs. More...
     
    class  IDableGraphComponent< BAS >
     Skeleton class for idable undirected graphs. More...
     
    class  IDableBpGraphComponent< BAS >
     Skeleton class for idable undirected bipartite graphs. More...
     
    class  GraphItemIt< GR, Item >
     Concept class for NodeIt, ArcIt and EdgeIt types. More...
     
    class  GraphIncIt< GR, Item, Base, sel >
     Concept class for InArcIt, OutArcIt and IncEdgeIt types. More...
     
    class  IterableDigraphComponent< BAS >
     Skeleton class for iterable directed graphs. More...
     
    class  IterableGraphComponent< BAS >
     Skeleton class for iterable undirected graphs. More...
     
    class  IterableBpGraphComponent< BAS >
     Skeleton class for iterable undirected bipartite graphs. More...
     
    class  AlterableDigraphComponent< BAS >
     Skeleton class for alterable directed graphs. More...
     
    class  AlterableGraphComponent< BAS >
     Skeleton class for alterable undirected graphs. More...
     
    class  AlterableBpGraphComponent< BAS >
     Skeleton class for alterable undirected bipartite graphs. More...
     
    class  GraphMap< GR, K, V >
     Concept class for standard graph maps. More...
     
    class  MappableDigraphComponent< BAS >
     Skeleton class for mappable directed graphs. More...
     
    class  MappableDigraphComponent< BAS >::NodeMap< V >
     Standard graph map for the nodes. More...
     
    class  MappableDigraphComponent< BAS >::ArcMap< V >
     Standard graph map for the arcs. More...
     
    class  MappableGraphComponent< BAS >
     Skeleton class for mappable undirected graphs. More...
     
    class  MappableGraphComponent< BAS >::EdgeMap< V >
     Standard graph map for the edges. More...
     
    class  MappableBpGraphComponent< BAS >
     Skeleton class for mappable undirected bipartite graphs. More...
     
    class  MappableBpGraphComponent< BAS >::RedNodeMap< V >
     Standard graph map for the red nodes. More...
     
    class  MappableBpGraphComponent< BAS >::BlueNodeMap< V >
     Standard graph map for the blue nodes. More...
     
    class  ExtendableDigraphComponent< BAS >
     Skeleton class for extendable directed graphs. More...
     
    class  ExtendableGraphComponent< BAS >
     Skeleton class for extendable undirected graphs. More...
     
    class  ExtendableBpGraphComponent< BAS >
     Skeleton class for extendable undirected bipartite graphs. More...
     
    class  ErasableDigraphComponent< BAS >
     Skeleton class for erasable directed graphs. More...
     
    class  ErasableGraphComponent< BAS >
     Skeleton class for erasable undirected graphs. More...
     
    class  ErasableBpGraphComponent< BAS >
     Skeleton class for erasable undirected graphs. More...
     
    class  ClearableDigraphComponent< BAS >
     Skeleton class for clearable directed graphs. More...
     
    class  ClearableGraphComponent< BAS >
     Skeleton class for clearable undirected graphs. More...
     
    class  ClearableBpGraphComponent< BAS >
     Skeleton class for clearable undirected biparite graphs. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -7,21 +7,127 @@\n \n Loading...\n Searching...\n No Matches\n * lemon\n * concepts\n Classes | Namespaces\n-heap.h File Reference\n-Concepts\n+graph_components.h File Reference\n+Concepts \u00bb Graph_Structure_Concepts\n #include \n-#include \n+#include \n+#include \n Classes\n-class \u00a0Heap<_PR,_IM,_CMP_>\n-\u00a0 The heap concept. More...\n+class \u00a0GraphItem\n+\u00a0 Concept class for Node, Arc and Edge types. More...\n+\u00a0\n+class \u00a0BaseDigraphComponent\n+\u00a0 Base skeleton class for directed graphs. More...\n+\u00a0\n+class \u00a0BaseGraphComponent\n+\u00a0 Base skeleton class for undirected graphs. More...\n+\u00a0\n+class \u00a0BaseGraphComponent::Edge\n+\u00a0 Undirected edge class of the graph. More...\n+\u00a0\n+class \u00a0BaseBpGraphComponent\n+\u00a0 Base skeleton class for undirected bipartite graphs. More...\n+\u00a0\n+class \u00a0BaseBpGraphComponent::RedNode\n+\u00a0 Class to represent red nodes. More...\n+\u00a0\n+class \u00a0BaseBpGraphComponent::BlueNode\n+\u00a0 Class to represent blue nodes. More...\n+\u00a0\n+class \u00a0IDableDigraphComponent<_BAS_>\n+\u00a0 Skeleton class for idable directed graphs. More...\n+\u00a0\n+class \u00a0IDableGraphComponent<_BAS_>\n+\u00a0 Skeleton class for idable undirected graphs. More...\n+\u00a0\n+class \u00a0IDableBpGraphComponent<_BAS_>\n+\u00a0 Skeleton class for idable undirected bipartite graphs. More...\n+\u00a0\n+class \u00a0GraphItemIt<_GR,_Item_>\n+\u00a0 Concept class for NodeIt, ArcIt and EdgeIt types. More...\n+\u00a0\n+class \u00a0GraphIncIt<_GR,_Item,_Base,_sel_>\n+\u00a0 Concept class for InArcIt, OutArcIt and IncEdgeIt types. More...\n+\u00a0\n+class \u00a0IterableDigraphComponent<_BAS_>\n+\u00a0 Skeleton class for iterable directed graphs. More...\n+\u00a0\n+class \u00a0IterableGraphComponent<_BAS_>\n+\u00a0 Skeleton class for iterable undirected graphs. More...\n+\u00a0\n+class \u00a0IterableBpGraphComponent<_BAS_>\n+\u00a0 Skeleton class for iterable undirected bipartite graphs. More...\n+\u00a0\n+class \u00a0AlterableDigraphComponent<_BAS_>\n+\u00a0 Skeleton class for alterable directed graphs. More...\n+\u00a0\n+class \u00a0AlterableGraphComponent<_BAS_>\n+\u00a0 Skeleton class for alterable undirected graphs. More...\n+\u00a0\n+class \u00a0AlterableBpGraphComponent<_BAS_>\n+\u00a0 Skeleton class for alterable undirected bipartite graphs. More...\n+\u00a0\n+class \u00a0GraphMap<_GR,_K,_V_>\n+\u00a0 Concept class for standard graph maps. More...\n+\u00a0\n+class \u00a0MappableDigraphComponent<_BAS_>\n+\u00a0 Skeleton class for mappable directed graphs. More...\n+\u00a0\n+class \u00a0MappableDigraphComponent<_BAS_>::NodeMap<_V_>\n+\u00a0 Standard graph map for the nodes. More...\n+\u00a0\n+class \u00a0MappableDigraphComponent<_BAS_>::ArcMap<_V_>\n+\u00a0 Standard graph map for the arcs. More...\n+\u00a0\n+class \u00a0MappableGraphComponent<_BAS_>\n+\u00a0 Skeleton class for mappable undirected graphs. More...\n+\u00a0\n+class \u00a0MappableGraphComponent<_BAS_>::EdgeMap<_V_>\n+\u00a0 Standard graph map for the edges. More...\n+\u00a0\n+class \u00a0MappableBpGraphComponent<_BAS_>\n+\u00a0 Skeleton class for mappable undirected bipartite graphs. More...\n+\u00a0\n+class \u00a0MappableBpGraphComponent<_BAS_>::RedNodeMap<_V_>\n+\u00a0 Standard graph map for the red nodes. More...\n+\u00a0\n+class \u00a0MappableBpGraphComponent<_BAS_>::BlueNodeMap<_V_>\n+\u00a0 Standard graph map for the blue nodes. More...\n+\u00a0\n+class \u00a0ExtendableDigraphComponent<_BAS_>\n+\u00a0 Skeleton class for extendable directed graphs. More...\n+\u00a0\n+class \u00a0ExtendableGraphComponent<_BAS_>\n+\u00a0 Skeleton class for extendable undirected graphs. More...\n+\u00a0\n+class \u00a0ExtendableBpGraphComponent<_BAS_>\n+\u00a0 Skeleton class for extendable undirected bipartite graphs. More...\n+\u00a0\n+class \u00a0ErasableDigraphComponent<_BAS_>\n+\u00a0 Skeleton class for erasable directed graphs. More...\n+\u00a0\n+class \u00a0ErasableGraphComponent<_BAS_>\n+\u00a0 Skeleton class for erasable undirected graphs. More...\n+\u00a0\n+class \u00a0ErasableBpGraphComponent<_BAS_>\n+\u00a0 Skeleton class for erasable undirected graphs. More...\n+\u00a0\n+class \u00a0ClearableDigraphComponent<_BAS_>\n+\u00a0 Skeleton class for clearable directed graphs. More...\n+\u00a0\n+class \u00a0ClearableGraphComponent<_BAS_>\n+\u00a0 Skeleton class for clearable undirected graphs. More...\n+\u00a0\n+class \u00a0ClearableBpGraphComponent<_BAS_>\n+\u00a0 Skeleton class for clearable undirected biparite graphs. More...\n \u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n namespace \u00a0lemon::concepts\n \u00a0 The namespace of LEMON concepts and concept checking classes.\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00494.html", "source2": "./usr/share/doc/lemon/html/a00494.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/concepts/bpgraph.h File Reference\n+My Project: lemon/concepts/digraph.h File Reference\n \n \n \n \n \n \n \n@@ -72,80 +72,50 @@\n
  • lemon
  • concepts
    • \n \n \n
    \n
    \n Classes |\n Namespaces
    \n-
    bpgraph.h File Reference
    Concepts » Graph Structure Concepts
    \n+
    digraph.h File Reference
    Concepts » Graph Structure Concepts
    \n
    \n
    \n-
    #include <lemon/concepts/graph_components.h>
    \n+
    #include <lemon/core.h>
    \n #include <lemon/concepts/maps.h>
    \n-#include <lemon/concept_check.h>
    \n-#include <lemon/core.h>
    \n+#include <lemon/concept_check.h>
    \n+#include <lemon/concepts/graph_components.h>
    \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

    \n Classes

    class  BpGraph
     Class describing the concept of undirected bipartite graphs. More...
    class  Digraph
     Class describing the concept of directed graphs. More...
     
    class  BpGraph::Node
     The node type of the graph. More...
    class  Digraph::Node
     The node type of the digraph. More...
     
    class  BpGraph::RedNode
     Class to represent red nodes. More...
    class  Digraph::NodeIt
     Iterator class for the nodes. More...
     
    class  BpGraph::BlueNode
     Class to represent blue nodes. More...
    class  Digraph::Arc
     The arc type of the digraph. More...
     
    class  BpGraph::RedNodeIt
     Iterator class for the red nodes. More...
    class  Digraph::OutArcIt
     Iterator class for the outgoing arcs of a node. More...
     
    class  BpGraph::BlueNodeIt
     Iterator class for the blue nodes. More...
    class  Digraph::InArcIt
     Iterator class for the incoming arcs of a node. More...
     
    class  BpGraph::NodeIt
     Iterator class for the nodes. More...
    class  Digraph::ArcIt
     Iterator class for the arcs. More...
     
    class  BpGraph::Edge
     The edge type of the graph. More...
    class  Digraph::NodeMap< T >
     Standard graph map type for the nodes. More...
     
    class  BpGraph::EdgeIt
     Iterator class for the edges. More...
     
    class  BpGraph::IncEdgeIt
     Iterator class for the incident edges of a node. More...
     
    class  BpGraph::Arc
     The arc type of the graph. More...
     
    class  BpGraph::ArcIt
     Iterator class for the arcs. More...
     
    class  BpGraph::OutArcIt
     Iterator class for the outgoing arcs of a node. More...
     
    class  BpGraph::InArcIt
     Iterator class for the incoming arcs of a node. More...
     
    class  BpGraph::NodeMap< T >
     Standard graph map type for the nodes. More...
     
    class  BpGraph::RedNodeMap< T >
     Standard graph map type for the red nodes. More...
     
    class  BpGraph::BlueNodeMap< T >
     Standard graph map type for the blue nodes. More...
     
    class  BpGraph::ArcMap< T >
     Standard graph map type for the arcs. More...
     
    class  BpGraph::EdgeMap< T >
     Standard graph map type for the edges. More...
    class  Digraph::ArcMap< T >
     Standard graph map type for the arcs. More...
     
    \n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -7,78 +7,48 @@\n \n Loading...\n Searching...\n No Matches\n * lemon\n * concepts\n Classes | Namespaces\n-bpgraph.h File Reference\n+digraph.h File Reference\n Concepts \u00bb Graph_Structure_Concepts\n-#include \n+#include \n #include \n #include \n-#include \n+#include \n Classes\n-class \u00a0BpGraph\n-\u00a0 Class describing the concept of undirected bipartite graphs. More...\n-\u00a0\n-class \u00a0BpGraph::Node\n-\u00a0 The node type of the graph. More...\n+class \u00a0Digraph\n+\u00a0 Class describing the concept of directed graphs. More...\n \u00a0\n-class \u00a0BpGraph::RedNode\n-\u00a0 Class to represent red nodes. More...\n+class \u00a0Digraph::Node\n+\u00a0 The node type of the digraph. More...\n \u00a0\n-class \u00a0BpGraph::BlueNode\n-\u00a0 Class to represent blue nodes. More...\n-\u00a0\n-class \u00a0BpGraph::RedNodeIt\n-\u00a0 Iterator class for the red nodes. More...\n-\u00a0\n-class \u00a0BpGraph::BlueNodeIt\n-\u00a0 Iterator class for the blue nodes. More...\n-\u00a0\n-class \u00a0BpGraph::NodeIt\n+class \u00a0Digraph::NodeIt\n \u00a0 Iterator class for the nodes. More...\n \u00a0\n-class \u00a0BpGraph::Edge\n-\u00a0 The edge type of the graph. More...\n-\u00a0\n-class \u00a0BpGraph::EdgeIt\n-\u00a0 Iterator class for the edges. More...\n+class \u00a0Digraph::Arc\n+\u00a0 The arc type of the digraph. More...\n \u00a0\n-class \u00a0BpGraph::IncEdgeIt\n-\u00a0 Iterator class for the incident edges of a node. More...\n-\u00a0\n-class \u00a0BpGraph::Arc\n-\u00a0 The arc type of the graph. More...\n-\u00a0\n-class \u00a0BpGraph::ArcIt\n-\u00a0 Iterator class for the arcs. More...\n-\u00a0\n-class \u00a0BpGraph::OutArcIt\n+class \u00a0Digraph::OutArcIt\n \u00a0 Iterator class for the outgoing arcs of a node. More...\n \u00a0\n-class \u00a0BpGraph::InArcIt\n+class \u00a0Digraph::InArcIt\n \u00a0 Iterator class for the incoming arcs of a node. More...\n \u00a0\n-class \u00a0BpGraph::NodeMap<_T_>\n-\u00a0 Standard graph map type for the nodes. More...\n-\u00a0\n-class \u00a0BpGraph::RedNodeMap<_T_>\n-\u00a0 Standard graph map type for the red nodes. More...\n+class \u00a0Digraph::ArcIt\n+\u00a0 Iterator class for the arcs. More...\n \u00a0\n-class \u00a0BpGraph::BlueNodeMap<_T_>\n-\u00a0 Standard graph map type for the blue nodes. More...\n+class \u00a0Digraph::NodeMap<_T_>\n+\u00a0 Standard graph map type for the nodes. More...\n \u00a0\n-class \u00a0BpGraph::ArcMap<_T_>\n+class \u00a0Digraph::ArcMap<_T_>\n \u00a0 Standard graph map type for the arcs. More...\n \u00a0\n-class \u00a0BpGraph::EdgeMap<_T_>\n-\u00a0 Standard graph map type for the edges. More...\n-\u00a0\n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n namespace \u00a0lemon::concepts\n \u00a0 The namespace of LEMON concepts and concept checking classes.\n \u00a0\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00497.html", "source2": "./usr/share/doc/lemon/html/a00497.html", "unified_diff": "@@ -79,27 +79,27 @@\n

    Detailed Description

    \n

    Graph generator application for various types of plane graphs.

    \n

    See

    lgf-gen --help
    \n

    for more information on the usage.

    \n
    #include <algorithm>
    \n #include <set>
    \n #include <ctime>
    \n-#include <lemon/list_graph.h>
    \n-#include <lemon/random.h>
    \n-#include <lemon/dim2.h>
    \n-#include <lemon/bfs.h>
    \n-#include <lemon/counter.h>
    \n-#include <lemon/suurballe.h>
    \n-#include <lemon/graph_to_eps.h>
    \n+#include <lemon/list_graph.h>
    \n+#include <lemon/random.h>
    \n+#include <lemon/dim2.h>
    \n+#include <lemon/bfs.h>
    \n+#include <lemon/counter.h>
    \n+#include <lemon/suurballe.h>
    \n+#include <lemon/graph_to_eps.h>
    \n #include <lemon/lgf_writer.h>
    \n-#include <lemon/arg_parser.h>
    \n-#include <lemon/euler.h>
    \n-#include <lemon/math.h>
    \n-#include <lemon/kruskal.h>
    \n-#include <lemon/time_measure.h>
    \n+#include <lemon/arg_parser.h>
    \n+#include <lemon/euler.h>
    \n+#include <lemon/math.h>
    \n+#include <lemon/kruskal.h>
    \n+#include <lemon/time_measure.h>
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00500.html", "source2": "./usr/share/doc/lemon/html/a00500.html", "unified_diff": "@@ -79,19 +79,19 @@\n

    Detailed Description

    \n

    This program converts various DIMACS formats to the LEMON Digraph Format (LGF).

    \n

    See

    dimacs-to-lgf --help
    \n

    for more info on the usage.

    \n
    #include <iostream>
    \n #include <fstream>
    \n #include <cstring>
    \n-#include <lemon/smart_graph.h>
    \n-#include <lemon/dimacs.h>
    \n+#include <lemon/smart_graph.h>
    \n+#include <lemon/dimacs.h>
    \n #include <lemon/lgf_writer.h>
    \n-#include <lemon/arg_parser.h>
    \n-#include <lemon/error.h>
    \n+#include <lemon/arg_parser.h>
    \n+#include <lemon/error.h>
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00503.html", "source2": "./usr/share/doc/lemon/html/a00503.html", "unified_diff": "@@ -79,24 +79,24 @@\n

    Detailed Description

    \n

    This program solves various problems given in DIMACS format.

    \n

    See

    dimacs-solver --help
    \n

    for more info on usage.

    \n
    #include <iostream>
    \n #include <fstream>
    \n #include <cstring>
    \n-#include <lemon/smart_graph.h>
    \n-#include <lemon/dimacs.h>
    \n+#include <lemon/smart_graph.h>
    \n+#include <lemon/dimacs.h>
    \n #include <lemon/lgf_writer.h>
    \n-#include <lemon/time_measure.h>
    \n-#include <lemon/arg_parser.h>
    \n-#include <lemon/error.h>
    \n-#include <lemon/dijkstra.h>
    \n-#include <lemon/preflow.h>
    \n-#include <lemon/matching.h>
    \n-#include <lemon/network_simplex.h>
    \n+#include <lemon/time_measure.h>
    \n+#include <lemon/arg_parser.h>
    \n+#include <lemon/error.h>
    \n+#include <lemon/dijkstra.h>
    \n+#include <lemon/preflow.h>
    \n+#include <lemon/matching.h>
    \n+#include <lemon/network_simplex.h>
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00513.html", "source2": "./usr/share/doc/lemon/html/a00513.html", "unified_diff": "@@ -138,34 +138,34 @@\n Modules\n     \n \n \n

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
     Adaptor Classes for Graphs
     Adaptor classes for digraphs and graphs.
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Files

    file  edge_set.h
     ArcSet and EdgeSet classes.
    file  edge_set.h
     ArcSet and EdgeSet classes.
     
    file  full_graph.h
     FullDigraph and FullGraph classes.
    file  full_graph.h
     FullDigraph and FullGraph classes.
     
    file  grid_graph.h
     GridGraph class.
    file  grid_graph.h
     GridGraph class.
     
    file  hypercube_graph.h
     HypercubeGraph class.
    file  hypercube_graph.h
     HypercubeGraph class.
     
    file  list_graph.h
     ListDigraph and ListGraph classes.
    file  list_graph.h
     ListDigraph and ListGraph classes.
     
    file  smart_graph.h
     SmartDigraph and SmartGraph classes.
    file  smart_graph.h
     SmartDigraph and SmartGraph classes.
     
    file  static_graph.h
     StaticDigraph class.
    file  static_graph.h
     StaticDigraph class.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n"}, {"source1": "./usr/share/doc/lemon/html/a00514.html", "source2": "./usr/share/doc/lemon/html/a00514.html", "unified_diff": "@@ -129,16 +129,16 @@\n  \n class  SplitNodes< DGR >\n  Adaptor class for splitting the nodes of a digraph. More...
    \n  \n \n \n-\n-\n+\n+\n \n

    \n Files

    file  adaptors.h
     Adaptor classes for digraphs and graphs.
    file  adaptors.h
     Adaptor classes for digraphs and graphs.
     
    \n \n \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00515.html", "source2": "./usr/share/doc/lemon/html/a00515.html", "unified_diff": "@@ -122,16 +122,16 @@\n \n \n \n \n

    \n Functions

    template<typename DGR >
    ReverseDigraph< const DGR > reverseDigraph (const DGR &digraph)
     Returns a read-only ReverseDigraph adaptor.
     
     Map Adaptors
     Tools to create new maps from existing ones.
     
    \n \n-\n-\n+\n+\n \n

    \n Files

    file  maps.h
     Miscellaneous property maps.
    file  maps.h
     Miscellaneous property maps.
     
    \n \n \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00518.html", "source2": "./usr/share/doc/lemon/html/a00518.html", "unified_diff": "@@ -97,16 +97,16 @@\n \n \n \n \n

    \n Functions

    template<typename K , typename V >
    NullMap< K, V > nullMap ()
     Returns a NullMap class.
     
    class  PathNodeIt< Path >
     Class which helps to iterate through the nodes of a path. More...
     
    \n \n-\n-\n+\n+\n \n

    \n Files

    file  path.h
     Classes for representing paths in digraphs.
    file  path.h
     Classes for representing paths in digraphs.
     
    \n \n \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00519.html", "source2": "./usr/share/doc/lemon/html/a00519.html", "unified_diff": "@@ -109,37 +109,37 @@\n \n \n \n \n

    \n Functions

    template<typename From , typename To >
    void pathCopy (const From &from, To &to)
     Make a copy of a path.
     
    class  RadixHeap< IM >
     Radix heap data structure. More...
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Files

    file  bin_heap.h
     Binary heap implementation.
    file  bin_heap.h
     Binary heap implementation.
     
    file  binomial_heap.h
     Binomial Heap implementation.
    file  binomial_heap.h
     Binomial Heap implementation.
     
    file  bucket_heap.h
     Bucket heap implementation.
    file  bucket_heap.h
     Bucket heap implementation.
     
    file  dheap.h
     D-ary heap implementation.
    file  dheap.h
     D-ary heap implementation.
     
    file  fib_heap.h
     Fibonacci heap implementation.
    file  fib_heap.h
     Fibonacci heap implementation.
     
    file  pairing_heap.h
     Pairing heap implementation.
    file  pairing_heap.h
     Pairing heap implementation.
     
    file  quad_heap.h
     Fourary (quaternary) heap implementation.
    file  quad_heap.h
     Fourary (quaternary) heap implementation.
     
    file  radix_heap.h
     Radix heap implementation.
    file  radix_heap.h
     Radix heap implementation.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n"}, {"source1": "./usr/share/doc/lemon/html/a00520.html", "source2": "./usr/share/doc/lemon/html/a00520.html", "unified_diff": "@@ -104,19 +104,19 @@\n Modules\n  Geometric Data Structures\n  Geometric data structures implemented in LEMON.
    \n  \n \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Files

    file  elevator.h
     Elevator class.
    file  elevator.h
     Elevator class.
     
    file  unionfind.h
     Union-Find data structures.
    file  unionfind.h
     Union-Find data structures.
     
    \n \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n"}, {"source1": "./usr/share/doc/lemon/html/a00521.html", "source2": "./usr/share/doc/lemon/html/a00521.html", "unified_diff": "@@ -105,16 +105,16 @@\n  \n class  NormSquareMap< M >\n  Map of the normSquare() of a Point-map. More...
    \n  \n \n \n-\n-\n+\n+\n \n

    \n Files

    file  dim2.h
     A simple two dimensional vector and a bounding box implementation.
    file  dim2.h
     A simple two dimensional vector and a bounding box implementation.
     
    \n \n \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00523.html", "source2": "./usr/share/doc/lemon/html/a00523.html", "unified_diff": "@@ -95,22 +95,22 @@\n \n \n \n \n

    \n Functions

    template<typename T >
    Point< T > makePoint (const T &x, const T &y)
     Return a Point.
     
    class  MaxCardinalitySearch< GR, CAP, TR >
     Maximum Cardinality Search algorithm class. More...
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Files

    file  bfs.h
     BFS algorithm.
    file  bfs.h
     BFS algorithm.
     
    file  dfs.h
     DFS algorithm.
    file  dfs.h
     DFS algorithm.
     
    file  max_cardinality_search.h
     Maximum cardinality search in undirected digraphs.
    file  max_cardinality_search.h
     Maximum cardinality search in undirected digraphs.
     
    \n \n \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00524.html", "source2": "./usr/share/doc/lemon/html/a00524.html", "unified_diff": "@@ -94,22 +94,22 @@\n \n \n \n \n

    \n Functions

    template<class GR >
    BfsWizard< BfsWizardBase< GR > > bfs (const GR &digraph)
     Function-type interface for BFS algorithm.
     
    class  Suurballe< GR, LEN, TR >
     Algorithm for finding arc-disjoint paths between two nodes having minimum total length. More...
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Files

    file  bellman_ford.h
     Bellman-Ford algorithm.
    file  bellman_ford.h
     Bellman-Ford algorithm.
     
    file  dijkstra.h
     Dijkstra algorithm.
    file  dijkstra.h
     Dijkstra algorithm.
     
    file  suurballe.h
     An algorithm for finding arc-disjoint paths between two nodes having minimum total length.
    file  suurballe.h
     An algorithm for finding arc-disjoint paths between two nodes having minimum total length.
     
    \n \n \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00525.html", "source2": "./usr/share/doc/lemon/html/a00525.html", "unified_diff": "@@ -83,19 +83,19 @@\n Classes\n \n \n \n

    \n Functions

    template<typename GR , typename LEN >
    BellmanFordWizard< BellmanFordWizardBase< GR, LEN > > bellmanFord (const GR &digraph, const LEN &length)
     Function type interface for the Bellman-Ford algorithm.
    class  MinCostArborescence< GR, CM, TR >
     Minimum Cost Arborescence algorithm class. More...
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Files

    file  kruskal.h
     Kruskal's algorithm to compute a minimum cost spanning tree.
    file  kruskal.h
     Kruskal's algorithm to compute a minimum cost spanning tree.
     
    file  min_cost_arborescence.h
     Minimum Cost Arborescence algorithm.
    file  min_cost_arborescence.h
     Minimum Cost Arborescence algorithm.
     
    \n \n \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00526.html", "source2": "./usr/share/doc/lemon/html/a00526.html", "unified_diff": "@@ -101,22 +101,22 @@\n \n \n \n \n

    \n Functions

    template<typename Graph , typename In , typename Out >
    Value kruskal (const Graph &g, const In &in, Out &out)
     Kruskal's algorithm for finding a minimum cost spanning tree of a graph.
     
    class  Preflow< GR, CAP, TR >
     Preflow algorithm class. More...
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Files

    file  circulation.h
     Push-relabel algorithm for finding a feasible circulation.
    file  circulation.h
     Push-relabel algorithm for finding a feasible circulation.
     
    file  edmonds_karp.h
     Implementation of the Edmonds-Karp algorithm.
    file  edmonds_karp.h
     Implementation of the Edmonds-Karp algorithm.
     
    file  preflow.h
     Implementation of the preflow algorithm.
    file  preflow.h
     Implementation of the preflow algorithm.
     
    \n \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n"}, {"source1": "./usr/share/doc/lemon/html/a00527.html", "source2": "./usr/share/doc/lemon/html/a00527.html", "unified_diff": "@@ -100,25 +100,25 @@\n  \n class  NetworkSimplex< GR, V, C >\n  Implementation of the primal Network Simplex algorithm for finding a minimum cost flow. More...
    \n  \n \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Files

    file  capacity_scaling.h
     Capacity Scaling algorithm for finding a minimum cost flow.
    file  capacity_scaling.h
     Capacity Scaling algorithm for finding a minimum cost flow.
     
    file  cost_scaling.h
     Cost scaling algorithm for finding a minimum cost flow.
    file  cost_scaling.h
     Cost scaling algorithm for finding a minimum cost flow.
     
    file  cycle_canceling.h
     Cycle-canceling algorithms for finding a minimum cost flow.
    file  cycle_canceling.h
     Cycle-canceling algorithms for finding a minimum cost flow.
     
    file  network_simplex.h
     Network Simplex algorithm for finding a minimum cost flow.
    file  network_simplex.h
     Network Simplex algorithm for finding a minimum cost flow.
     
    \n \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n"}, {"source1": "./usr/share/doc/lemon/html/a00528.html", "source2": "./usr/share/doc/lemon/html/a00528.html", "unified_diff": "@@ -100,22 +100,22 @@\n  \n class  NagamochiIbaraki< GR, CM, TR >\n  Calculates the minimum cut in an undirected graph. More...
    \n  \n \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Files

    file  gomory_hu.h
     Gomory-Hu cut tree in graphs.
    file  gomory_hu.h
     Gomory-Hu cut tree in graphs.
     
    file  hao_orlin.h
     Implementation of the Hao-Orlin algorithm.
    file  hao_orlin.h
     Implementation of the Hao-Orlin algorithm.
     
    file  nagamochi_ibaraki.h
     Implementation of the Nagamochi-Ibaraki algorithm.
    file  nagamochi_ibaraki.h
     Implementation of the Nagamochi-Ibaraki algorithm.
     
    \n \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n"}, {"source1": "./usr/share/doc/lemon/html/a00529.html", "source2": "./usr/share/doc/lemon/html/a00529.html", "unified_diff": "@@ -96,22 +96,22 @@\n  \n class  KarpMmc< GR, CM, TR >\n  Implementation of Karp's algorithm for finding a minimum mean cycle. More...
    \n  \n \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Files

    file  hartmann_orlin_mmc.h
     Hartmann-Orlin's algorithm for finding a minimum mean cycle.
    file  hartmann_orlin_mmc.h
     Hartmann-Orlin's algorithm for finding a minimum mean cycle.
     
    file  howard_mmc.h
     Howard's algorithm for finding a minimum mean cycle.
    file  howard_mmc.h
     Howard's algorithm for finding a minimum mean cycle.
     
    file  karp_mmc.h
     Karp's algorithm for finding a minimum mean cycle.
    file  karp_mmc.h
     Karp's algorithm for finding a minimum mean cycle.
     
    \n \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n"}, {"source1": "./usr/share/doc/lemon/html/a00530.html", "source2": "./usr/share/doc/lemon/html/a00530.html", "unified_diff": "@@ -109,19 +109,19 @@\n  \n class  MaxWeightedPerfectMatching< GR, WM >\n  Weighted perfect matching in general graphs. More...
    \n  \n \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Files

    file  fractional_matching.h
     Fractional matching algorithms in general graphs.
    file  fractional_matching.h
     Fractional matching algorithms in general graphs.
     
    file  matching.h
     Maximum matching algorithms in general graphs.
    file  matching.h
     Maximum matching algorithms in general graphs.
     
    \n \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n"}, {"source1": "./usr/share/doc/lemon/html/a00531.html", "source2": "./usr/share/doc/lemon/html/a00531.html", "unified_diff": "@@ -89,19 +89,19 @@\n  \n class  EulerIt< GR >\n  Euler tour iterator for graphs. More...
    \n  \n \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Files

    file  connectivity.h
     Connectivity algorithms.
    file  connectivity.h
     Connectivity algorithms.
     
    file  euler.h
     Euler tour iterators and a function for checking the Eulerian property.
    file  euler.h
     Euler tour iterators and a function for checking the Eulerian property.
     
    \n \n \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00532.html", "source2": "./usr/share/doc/lemon/html/a00532.html", "unified_diff": "@@ -92,16 +92,16 @@\n \n \n \n \n

    \n Functions

    template<typename Graph >
    bool connected (const Graph &graph)
     Check whether an undirected graph is connected.
     
    class  PlanarColoring< Graph >
     Coloring planar graphs. More...
     
    \n \n-\n-\n+\n+\n \n

    \n Files

    file  planarity.h
     Planarity checking, embedding, drawing and coloring.
    file  planarity.h
     Planarity checking, embedding, drawing and coloring.
     
    \n \n \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00533.html", "source2": "./usr/share/doc/lemon/html/a00533.html", "unified_diff": "@@ -108,28 +108,28 @@\n \n \n \n \n

    \n Functions

    template<typename GR >
    bool checkPlanarity (const GR &graph)
     Planarity checking of an undirected simple graph.
     
    class  Opt2Tsp< CM >
     2-opt algorithm for symmetric TSP. More...
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Files

    file  christofides_tsp.h
     Christofides algorithm for symmetric TSP.
    file  christofides_tsp.h
     Christofides algorithm for symmetric TSP.
     
    file  greedy_tsp.h
     Greedy algorithm for symmetric TSP.
    file  greedy_tsp.h
     Greedy algorithm for symmetric TSP.
     
    file  insertion_tsp.h
     Insertion algorithm for symmetric TSP.
    file  insertion_tsp.h
     Insertion algorithm for symmetric TSP.
     
    file  nearest_neighbor_tsp.h
     Nearest neighbor algorithm for symmetric TSP.
    file  nearest_neighbor_tsp.h
     Nearest neighbor algorithm for symmetric TSP.
     
    file  opt2_tsp.h
     2-opt algorithm for symmetric TSP.
    file  opt2_tsp.h
     2-opt algorithm for symmetric TSP.
     
    \n \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n"}, {"source1": "./usr/share/doc/lemon/html/a00534.html", "source2": "./usr/share/doc/lemon/html/a00534.html", "unified_diff": "@@ -85,16 +85,16 @@\n Classes\n class  GrossoLocatelliPullanMc< GR >\n  Implementation of the iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem. More...
    \n  \n \n \n-\n-\n+\n+\n \n

    \n Files

    file  grosso_locatelli_pullan_mc.h
     The iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem.
    file  grosso_locatelli_pullan_mc.h
     The iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem.
     
    \n \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n"}, {"source1": "./usr/share/doc/lemon/html/a00535.html", "source2": "./usr/share/doc/lemon/html/a00535.html", "unified_diff": "@@ -76,16 +76,16 @@\n \n
    \n

    Detailed Description

    \n

    This group contains some algorithms implemented in LEMON in order to make it easier to implement complex algorithms.

    \n \n \n-\n-\n+\n+\n \n

    \n Files

    file  radix_sort.h
     Radix sort.
    file  radix_sort.h
     Radix sort.
     
    \n \n \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00537.html", "source2": "./usr/share/doc/lemon/html/a00537.html", "unified_diff": "@@ -124,25 +124,25 @@\n \n \n \n \n

    \n Functions

    template<typename Iterator , typename Functor >
    void radixSort (Iterator first, Iterator last, Functor functor)
     Sorts the STL compatible range into ascending order.
     
    class  SoplexLp
     Interface for the SOPLEX solver. More...
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Files

    file  cbc.h
     Header of the LEMON-CBC mip solver interface.
    file  cbc.h
     Header of the LEMON-CBC mip solver interface.
     
    file  glpk.h
     Header of the LEMON-GLPK lp solver interface.
    file  glpk.h
     Header of the LEMON-GLPK lp solver interface.
     
    file  lp.h
     Defines a default LP solver.
    file  lp.h
     Defines a default LP solver.
     
    file  lp_base.h
     The interface of the LP solver interface.
    file  lp_base.h
     The interface of the LP solver interface.
     
    \n \n \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00540.html", "source2": "./usr/share/doc/lemon/html/a00540.html", "unified_diff": "@@ -112,28 +112,28 @@\n Modules\n \n \n \n

    \n Macros

    #define LEMON_DEFAULT_LP   SOLVER
     The default LP solver identifier.
     
     Time Measuring and Counting
     Simple tools for measuring the performance of algorithms.
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n \n \n \n

    \n Files

    file  arg_parser.h
     A tool to parse command line arguments.
    file  arg_parser.h
     A tool to parse command line arguments.
     
    file  color.h
     Tools to manage RGB colors.
    file  color.h
     Tools to manage RGB colors.
     
    file  math.h
     Some extensions to the standard cmath library.
    file  math.h
     Some extensions to the standard cmath library.
     
    file  random.h
     Mersenne Twister random number generator.
    file  random.h
     Mersenne Twister random number generator.
     
    file  tolerance.h
     A basic tool to handle the anomalies of calculation with floating point numbers.
    file  tolerance.h
     A basic tool to handle the anomalies of calculation with floating point numbers.
     
    file  test_tools.h
     Some utilities to write test programs.
     
    \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00541.html", "source2": "./usr/share/doc/lemon/html/a00541.html", "unified_diff": "@@ -98,19 +98,19 @@\n \n \n \n \n

    \n Functions

     
    class  NoTimeReport
     'Do nothing' version of TimeReport More...
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Files

    file  counter.h
     Tools for counting steps and events.
    file  counter.h
     Tools for counting steps and events.
     
    file  time_measure.h
     Tools for measuring cpu usage.
    file  time_measure.h
     Tools for measuring cpu usage.
     
    \n \n \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00542.html", "source2": "./usr/share/doc/lemon/html/a00542.html", "unified_diff": "@@ -89,19 +89,19 @@\n \n \n \n \n

    \n Functions

    template<class F >
    TimeStamp runningTimeTest (F f, double min_time=10, unsigned int *num=NULL, TimeStamp *full_time=NULL)
     Tool to measure the running time more exactly.
     
    class  FormatError
     Format error. More...
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Files

    file  assert.h
     Extended assertion handling.
    file  assert.h
     Extended assertion handling.
     
    file  error.h
     Basic exception classes and error handling.
    file  error.h
     Basic exception classes and error handling.
     
    \n \n \n \n \n@@ -156,15 +156,15 @@\n
  • LEMON_ASSERT_ABORT The failed assertion prints a short log message to the standard error and aborts the program. It is the default behaviour.
    • \n
  • LEMON_ASSERT_CUSTOM The user can define own assertion handler function.
    void custom_assert_handler(const char* file, int line,
    \n
    const char* function, const char* message,
    \n
    const char* assertion);
    \n
    The name of the function should be defined as the LEMON_CUSTOM_ASSERT_HANDLER macro name.
    #define LEMON_CUSTOM_ASSERT_HANDLER custom_assert_handler
    \n
    Whenever an assertion is occured, the custom assertion handler is called with appropiate parameters.
    • \n \n-

    The assertion mode can also be changed within one compilation unit. If the macros are redefined with other settings and the assert.h file is reincluded, then the behaviour is changed appropiately to the new settings.

    \n+

    The assertion mode can also be changed within one compilation unit. If the macros are redefined with other settings and the assert.h file is reincluded, then the behaviour is changed appropiately to the new settings.

    \n \n \n \n \n

    ◆ LEMON_DEBUG

    \n \n
    \n"}, {"source1": "./usr/share/doc/lemon/html/a00544.html", "source2": "./usr/share/doc/lemon/html/a00544.html", "unified_diff": "@@ -107,16 +107,16 @@\n
    \n \n \n \n

    \n Macros

    #define LEMON_ASSERT(exp, msg)
     Macro for assertion with customizable message.
     
     
    class  SectionWriter
     Section writer class. More...
     
    \n \n-\n-\n+\n+\n \n \n \n \n

    \n Files

    file  lgf_reader.h
     LEMON Graph Format reader.
    file  lgf_reader.h
     LEMON Graph Format reader.
     
    file  lgf_writer.h
     LEMON Graph Format writer.
     
    \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00545.html", "source2": "./usr/share/doc/lemon/html/a00545.html", "unified_diff": "@@ -79,16 +79,16 @@\n

    This group contains general EPS drawing methods and special graph exporting tools.

    \n
    \n \"\"/\n
    \n

    \n Functions

    \n \n-\n-\n+\n+\n \n

    \n Files

    file  graph_to_eps.h
     A well configurable tool for visualizing graphs.
    file  graph_to_eps.h
     A well configurable tool for visualizing graphs.
     
    \n \n \n \n \n@@ -137,15 +137,15 @@\n

    \n Functions

    template<class GR >
    GraphToEps< DefaultGraphToEpsTraits< GR > > graphToEps (GR &g, std::ostream &os=std::cout)
     Generates an EPS file from a graph.
    \n \n \n

    This function also has a lot of named parameters, they are declared as the members of class GraphToEps. The following example shows how to use these parameters.

    graphToEps(g,os).scale(10).coords(coords)
    \n
    .nodeScale(2).nodeSizes(sizes)
    \n
    .arcWidthScale(.4).run();
    \n
    lemon::graphToEps
    GraphToEps< DefaultGraphToEpsTraits< GR > > graphToEps(GR &g, std::ostream &os=std::cout)
    Generates an EPS file from a graph.
    Definition graph_to_eps.h:1136
    \n-

    For more detailed examples, see the graph_to_eps_demo.cc demo file.

    \n+

    For more detailed examples, see the graph_to_eps_demo.cc demo file.

    \n
    Warning
    Don't forget to put the run() to the end of the parameter list.
    \n
    See also
    GraphToEps
    \n
    \n graphToEps(GR &g, const char *file_name)
    \n \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00546.html", "source2": "./usr/share/doc/lemon/html/a00546.html", "unified_diff": "@@ -83,16 +83,16 @@\n Classes\n struct  DimacsDescriptor\n  DIMACS file type descriptor. More...
    \n  \n \n \n-\n-\n+\n+\n \n

    \n Files

    file  dimacs.h
     DIMACS file format reader.
    file  dimacs.h
     DIMACS file format reader.
     
    \n \n \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00547.html", "source2": "./usr/share/doc/lemon/html/a00547.html", "unified_diff": "@@ -76,16 +76,16 @@\n \n
    \n

    Detailed Description

    \n

    Tool to read graphs from Nauty format data.

    \n

    \n Functions

    DimacsDescriptor dimacsType (std::istream &is)
     Discover the type of a DIMACS file.
     
    \n \n-\n-\n+\n+\n \n

    \n Files

    file  nauty_reader.h
     Nauty file reader.
    file  nauty_reader.h
     Nauty file reader.
     
    \n \n \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00548.html", "source2": "./usr/share/doc/lemon/html/a00548.html", "unified_diff": "@@ -105,16 +105,16 @@\n \n \n \n \n

    \n Functions

    template<typename Graph >
    std::istream & readNautyGraph (Graph &graph, std::istream &is=std::cin)
     Nauty file reader.
     
     Map Concepts
     Skeleton and concept checking classes for maps.
     
    \n \n-\n-\n+\n+\n \n \n \n \n

    \n Files

    file  heap.h
     The concept of heaps.
    file  heap.h
     The concept of heaps.
     
    file  path.h
     The concept of paths.
     
    \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a00549.html", "source2": "./usr/share/doc/lemon/html/a00549.html", "unified_diff": "@@ -88,25 +88,25 @@\n  \n class  Graph\n  Class describing the concept of undirected graphs. More...
    \n  \n \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Files

    file  bpgraph.h
     The concept of undirected graphs.
    file  bpgraph.h
     The concept of undirected graphs.
     
    file  digraph.h
     The concept of directed graphs.
    file  digraph.h
     The concept of directed graphs.
     
    file  graph.h
     The concept of undirected graphs.
    file  graph.h
     The concept of undirected graphs.
     
    file  graph_components.h
     The concepts of graph components.
    file  graph_components.h
     The concepts of graph components.
     
    \n \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n"}, {"source1": "./usr/share/doc/lemon/html/a00552.html", "source2": "./usr/share/doc/lemon/html/a00552.html", "unified_diff": "@@ -80,19 +80,19 @@\n

    In order to compile them, use the make demo or the make check commands.

    \n \n \n \n \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Files

    file  arg_parser_demo.cc
     Argument parser demo.
     
    file  graph_to_eps_demo.cc
     Demo of the graph drawing function graphToEps()
    file  graph_to_eps_demo.cc
     Demo of the graph drawing function graphToEps()
     
    file  lgf_demo.cc
     Demonstrating graph input and output.
    file  lgf_demo.cc
     Demonstrating graph input and output.
     
    \n \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n"}, {"source1": "./usr/share/doc/lemon/html/a02745.html", "source2": "./usr/share/doc/lemon/html/a02745.html", "unified_diff": "@@ -79,15 +79,15 @@\n Public Member Functions \n
    GraphToEps< T > Class Template Reference
    \n \n
    \n

    Detailed Description

    \n
    template<class T>
    \n class lemon::GraphToEps< T >

    Auxiliary class to implement the named parameters of graphToEps().

    \n-

    For detailed examples see the graph_to_eps_demo.cc demo file.

    \n+

    For detailed examples see the graph_to_eps_demo.cc demo file.

    \n
    \n

    #include <lemon/graph_to_eps.h>

    \n \n

    Inherits T.

    \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a04329.html", "source2": "./usr/share/doc/lemon/html/a04329.html", "unified_diff": "@@ -76,15 +76,15 @@\n
    \n List of all members |\n Public Member Functions
    \n
    Timer Class Reference
    Tools and Utilities » Miscellaneous Tools » Time Measuring and Counting
    \n \n
    \n

    Detailed Description

    \n-

    Class for measuring the cpu time and real time usage of the process. It is quite easy-to-use, here is a short example.

    #include<lemon/time_measure.h>
    \n+

    Class for measuring the cpu time and real time usage of the process. It is quite easy-to-use, here is a short example.

    #include<lemon/time_measure.h>
    \n
    #include<iostream>
    \n
    \n
    int main()
    \n
    {
    \n
    \n
    ...
    \n
    \n@@ -94,15 +94,15 @@\n
    t.restart();
    \n
    doSomethingElse();
    \n
    std::cout << t << '\\n';
    \n
    \n
    ...
    \n
    \n
    }
    \n-
    time_measure.h
    Tools for measuring cpu usage.
    \n+
    time_measure.h
    Tools for measuring cpu usage.
    \n
    lemon::Timer
    Class for measuring the cpu time and real time usage of the process.
    Definition time_measure.h:319
    \n
    lemon::Timer::restart
    void restart()
    Restart the time counters.
    Definition time_measure.h:433
    \n

    The Timer can also be stopped and started again, so it is possible to compute collected running times.

    \n
    Warning
    Depending on the operation system and its actual configuration the time counters have a certain (10ms on a typical Linux system) granularity. Therefore this tool is not appropriate to measure very short times. Also, if you start and stop the timer very frequently, it could lead to distorted results.
    \n
    Note
    If you want to measure the running time of the execution of a certain function, consider the usage of TimeReport instead.
    \n
    See also
    TimeReport
    \n
    \n"}, {"source1": "./usr/share/doc/lemon/html/a11513.html", "source2": "./usr/share/doc/lemon/html/a11513.html", "unified_diff": "@@ -125,15 +125,15 @@\n

    \n Exceptions and Debug tools

    \n

    The class hierarchy of exceptions has largely been simplified. Now, only the i/o related tools may throw exceptions. All other exceptions have been replaced with either the LEMON_ASSERT or the LEMON_DEBUG macros.

    \n

    On the other hand, the parameter order of constructors of the exceptions has been changed. See IoError and FormatError for more details.

    \n

    \n Others

    \n
      \n-
    • The contents of graph_utils.h are moved to core.h and maps.h. core.h is included by all graph types, therefore it usually do not have to be included directly.
      • \n+
    • The contents of graph_utils.h are moved to core.h and maps.h. core.h is included by all graph types, therefore it usually do not have to be included directly.
      • \n
    • path_utils.h is merged to path.h.
      • \n
    • The semantic of the assignment operations and copy constructors of maps are still under discussion. So, you must copy them by hand (i.e. copy each entry one-by-one)
      • \n
    • The parameters of the graph copying tools (i.e. GraphCopy, DigraphCopy) have to be given in the from-to order.
      • \n
    • copyDigraph() and copyGraph() are renamed to digraphCopy() and graphCopy(), respectively.
      • \n
    • The interface of DynArcLookUp has changed. It is now the same as of ArcLookUp and AllArcLookUp
      • \n
    • Some map types should also been renamed. Namely,
        \n
      • IntegerMap -> RangeMap
        • \n"}, {"source1": "./usr/share/doc/lemon/html/a11515.html", "source2": "./usr/share/doc/lemon/html/a11515.html", "unified_diff": "@@ -99,15 +99,15 @@\n

    The trick is obvious, each \"named parameter\" changes one component of the underlying class, then gives back a reference to it. Finally, run() executes the algorithm itself.

    \n
    Note
    Although it is a class, namedFn is used pretty much like as it were a function. That it why we called it namedFn instead of NamedFn.
    \n
    \n In fact, the final .run() could be made unnecessary, because the algorithm could also be implemented in the destructor of namedFn instead. This however would make it impossible to implement functions with return values, and would also cause serious problems when implementing named template parameters. Therefore, by convention, .run() must be used explicitly to execute a function having named parameters everywhere in LEMON.
    \n

    \n Named Function Template Parameters

    \n

    A named parameter can also be a template function. The usage is exactly the same, but the implementation behind is a kind of black magic and they are the dirtiest part of the LEMON code.

    \n-

    You will probably never need to know how it works, but if you really committed, have a look at lemon/graph_to_eps.h for an example.

    \n+

    You will probably never need to know how it works, but if you really committed, have a look at lemon/graph_to_eps.h for an example.

    \n

    \n Traits Classes

    \n

    A similar game can also be played when defining classes. In this case the type of the class attributes can be changed. Initially we have to define a special class called Traits Class defining the default type of the attributes. Then the types of these attributes can be changed in the same way as described in the next section.

    \n

    See lemon::DijkstraDefaultTraits for an example how a traits class implementation looks like.

    \n

    \n Named Class Template Parameters

    \n

    If we would like to change the type of an attribute in a class that was instantiated by using a traits class as a template parameter, and the class contains named parameters, we do not have to instantiate again the class with new traits class, but instead adaptor classes can be used as shown in the following example.

    \n"}, {"source1": "./usr/share/doc/lemon/html/a11517.html", "source2": "./usr/share/doc/lemon/html/a11517.html", "unified_diff": "@@ -75,16 +75,16 @@\n
    \n
    \n Classes |\n Namespaces
    \n
    maps.h File Reference
    Concepts » Map Concepts
    \n
    \n
    \n-
    #include <lemon/core.h>
    \n-#include <lemon/concept_check.h>
    \n+
    #include <lemon/core.h>
    \n+#include <lemon/concept_check.h>
    \n

    \n Public Types

    \n \n \n \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/a11520.html", "source2": "./usr/share/doc/lemon/html/a11520.html", "unified_diff": "@@ -75,16 +75,16 @@\n
    \n
    \n Classes |\n Namespaces
    \n
    path.h File Reference
    Concepts
    \n
    \n
    \n-
    #include <lemon/core.h>
    \n-#include <lemon/concept_check.h>
    \n+
    #include <lemon/core.h>
    \n+#include <lemon/concept_check.h>
    \n

    \n Classes

    class  ReadMap< K, T >
     Readable map concept. More...
     
    class  WriteMap< K, T >
    \n \n \n \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/dir_76709df9bfa39e37f63eb646d4b01cd8.html", "source2": "./usr/share/doc/lemon/html/dir_76709df9bfa39e37f63eb646d4b01cd8.html", "unified_diff": "@@ -87,274 +87,274 @@\n \n \n \n \n

    \n Classes

    class  Path< GR >
     A skeleton structure for representing directed paths in a digraph. More...
     
    class  Path< GR >::ArcIt
     
     concepts
     Concept descriptors and checking classes.
     
    \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n \n \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Files

     adaptors.h
     Adaptor classes for digraphs and graphs.
     adaptors.h
     Adaptor classes for digraphs and graphs.
     
     arg_parser.h
     A tool to parse command line arguments.
     arg_parser.h
     A tool to parse command line arguments.
     
     assert.h
     Extended assertion handling.
     assert.h
     Extended assertion handling.
     
     base.cc
     Some basic non-inline functions and static global data.
     base.cc
     Some basic non-inline functions and static global data.
     
     bellman_ford.h
     Bellman-Ford algorithm.
     bellman_ford.h
     Bellman-Ford algorithm.
     
     bfs.h
     BFS algorithm.
     bfs.h
     BFS algorithm.
     
     bin_heap.h
     Binary heap implementation.
     bin_heap.h
     Binary heap implementation.
     
     binomial_heap.h
     Binomial Heap implementation.
     binomial_heap.h
     Binomial Heap implementation.
     
     bucket_heap.h
     Bucket heap implementation.
     bucket_heap.h
     Bucket heap implementation.
     
     capacity_scaling.h
     Capacity Scaling algorithm for finding a minimum cost flow.
     capacity_scaling.h
     Capacity Scaling algorithm for finding a minimum cost flow.
     
     cbc.cc
     Implementation of the CBC MIP solver interface.
     cbc.cc
     Implementation of the CBC MIP solver interface.
     
     cbc.h
     Header of the LEMON-CBC mip solver interface.
     cbc.h
     Header of the LEMON-CBC mip solver interface.
     
     christofides_tsp.h
     Christofides algorithm for symmetric TSP.
     christofides_tsp.h
     Christofides algorithm for symmetric TSP.
     
     circulation.h
     Push-relabel algorithm for finding a feasible circulation.
     circulation.h
     Push-relabel algorithm for finding a feasible circulation.
     
     clp.h
     Header of the LEMON-CLP lp solver interface.
     clp.h
     Header of the LEMON-CLP lp solver interface.
     
     color.cc
     Color constants.
     color.cc
     Color constants.
     
     color.h
     Tools to manage RGB colors.
     color.h
     Tools to manage RGB colors.
     
     concept_check.h
     Basic utilities for concept checking.
     concept_check.h
     Basic utilities for concept checking.
     
     connectivity.h
     Connectivity algorithms.
     connectivity.h
     Connectivity algorithms.
     
     core.h
     LEMON core utilities.
     core.h
     LEMON core utilities.
     
     cost_scaling.h
     Cost scaling algorithm for finding a minimum cost flow.
     cost_scaling.h
     Cost scaling algorithm for finding a minimum cost flow.
     
     counter.h
     Tools for counting steps and events.
     counter.h
     Tools for counting steps and events.
     
     cplex.cc
     Implementation of the LEMON-CPLEX lp solver interface.
     cplex.cc
     Implementation of the LEMON-CPLEX lp solver interface.
     
     cplex.h
     Header of the LEMON-CPLEX lp solver interface.
     cplex.h
     Header of the LEMON-CPLEX lp solver interface.
     
     cycle_canceling.h
     Cycle-canceling algorithms for finding a minimum cost flow.
     cycle_canceling.h
     Cycle-canceling algorithms for finding a minimum cost flow.
     
     dfs.h
     DFS algorithm.
     dfs.h
     DFS algorithm.
     
     dheap.h
     D-ary heap implementation.
     dheap.h
     D-ary heap implementation.
     
     dijkstra.h
     Dijkstra algorithm.
     dijkstra.h
     Dijkstra algorithm.
     
     dim2.h
     A simple two dimensional vector and a bounding box implementation.
     dim2.h
     A simple two dimensional vector and a bounding box implementation.
     
     dimacs.h
     DIMACS file format reader.
     dimacs.h
     DIMACS file format reader.
     
     edge_set.h
     ArcSet and EdgeSet classes.
     edge_set.h
     ArcSet and EdgeSet classes.
     
     edmonds_karp.h
     Implementation of the Edmonds-Karp algorithm.
     edmonds_karp.h
     Implementation of the Edmonds-Karp algorithm.
     
     elevator.h
     Elevator class.
     elevator.h
     Elevator class.
     
     error.h
     Basic exception classes and error handling.
     error.h
     Basic exception classes and error handling.
     
     euler.h
     Euler tour iterators and a function for checking the Eulerian property.
     euler.h
     Euler tour iterators and a function for checking the Eulerian property.
     
     fib_heap.h
     Fibonacci heap implementation.
     fib_heap.h
     Fibonacci heap implementation.
     
     fractional_matching.h
     Fractional matching algorithms in general graphs.
     fractional_matching.h
     Fractional matching algorithms in general graphs.
     
     full_graph.h
     FullDigraph and FullGraph classes.
     full_graph.h
     FullDigraph and FullGraph classes.
     
     glpk.cc
     Implementation of the LEMON GLPK LP and MIP solver interface.
     glpk.cc
     Implementation of the LEMON GLPK LP and MIP solver interface.
     
     glpk.h
     Header of the LEMON-GLPK lp solver interface.
     glpk.h
     Header of the LEMON-GLPK lp solver interface.
     
     gomory_hu.h
     Gomory-Hu cut tree in graphs.
     gomory_hu.h
     Gomory-Hu cut tree in graphs.
     
     graph_to_eps.h
     A well configurable tool for visualizing graphs.
     graph_to_eps.h
     A well configurable tool for visualizing graphs.
     
     greedy_tsp.h
     Greedy algorithm for symmetric TSP.
     greedy_tsp.h
     Greedy algorithm for symmetric TSP.
     
     grid_graph.h
     GridGraph class.
     grid_graph.h
     GridGraph class.
     
     grosso_locatelli_pullan_mc.h
     The iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem.
     grosso_locatelli_pullan_mc.h
     The iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem.
     
     hao_orlin.h
     Implementation of the Hao-Orlin algorithm.
     hao_orlin.h
     Implementation of the Hao-Orlin algorithm.
     
     hartmann_orlin_mmc.h
     Hartmann-Orlin's algorithm for finding a minimum mean cycle.
     hartmann_orlin_mmc.h
     Hartmann-Orlin's algorithm for finding a minimum mean cycle.
     
     howard_mmc.h
     Howard's algorithm for finding a minimum mean cycle.
     howard_mmc.h
     Howard's algorithm for finding a minimum mean cycle.
     
     hypercube_graph.h
     HypercubeGraph class.
     hypercube_graph.h
     HypercubeGraph class.
     
     insertion_tsp.h
     Insertion algorithm for symmetric TSP.
     insertion_tsp.h
     Insertion algorithm for symmetric TSP.
     
     karp_mmc.h
     Karp's algorithm for finding a minimum mean cycle.
     karp_mmc.h
     Karp's algorithm for finding a minimum mean cycle.
     
     kruskal.h
     Kruskal's algorithm to compute a minimum cost spanning tree.
     kruskal.h
     Kruskal's algorithm to compute a minimum cost spanning tree.
     
     lgf_reader.h
     LEMON Graph Format reader.
     lgf_reader.h
     LEMON Graph Format reader.
     
     lgf_writer.h
     LEMON Graph Format writer.
     
     list_graph.h
     ListDigraph and ListGraph classes.
     list_graph.h
     ListDigraph and ListGraph classes.
     
     lp.h
     Defines a default LP solver.
     lp.h
     Defines a default LP solver.
     
     lp_base.cc
     The implementation of the LP solver interface.
     lp_base.cc
     The implementation of the LP solver interface.
     
     lp_base.h
     The interface of the LP solver interface.
     lp_base.h
     The interface of the LP solver interface.
     
     lp_skeleton.cc
     A skeleton file to implement LP solver interfaces.
     lp_skeleton.cc
     A skeleton file to implement LP solver interfaces.
     
     lp_skeleton.h
     Skeleton file to implement LP/MIP solver interfaces.
     lp_skeleton.h
     Skeleton file to implement LP/MIP solver interfaces.
     
     maps.h
     Miscellaneous property maps.
     maps.h
     Miscellaneous property maps.
     
     matching.h
     Maximum matching algorithms in general graphs.
     matching.h
     Maximum matching algorithms in general graphs.
     
     math.h
     Some extensions to the standard cmath library.
     math.h
     Some extensions to the standard cmath library.
     
     max_cardinality_search.h
     Maximum cardinality search in undirected digraphs.
     max_cardinality_search.h
     Maximum cardinality search in undirected digraphs.
     
     min_cost_arborescence.h
     Minimum Cost Arborescence algorithm.
     min_cost_arborescence.h
     Minimum Cost Arborescence algorithm.
     
     nagamochi_ibaraki.h
     Implementation of the Nagamochi-Ibaraki algorithm.
     nagamochi_ibaraki.h
     Implementation of the Nagamochi-Ibaraki algorithm.
     
     nauty_reader.h
     Nauty file reader.
     nauty_reader.h
     Nauty file reader.
     
     nearest_neighbor_tsp.h
     Nearest neighbor algorithm for symmetric TSP.
     nearest_neighbor_tsp.h
     Nearest neighbor algorithm for symmetric TSP.
     
     network_simplex.h
     Network Simplex algorithm for finding a minimum cost flow.
     network_simplex.h
     Network Simplex algorithm for finding a minimum cost flow.
     
     opt2_tsp.h
     2-opt algorithm for symmetric TSP.
     opt2_tsp.h
     2-opt algorithm for symmetric TSP.
     
     pairing_heap.h
     Pairing heap implementation.
     pairing_heap.h
     Pairing heap implementation.
     
     path.h
     Classes for representing paths in digraphs.
     path.h
     Classes for representing paths in digraphs.
     
     planarity.h
     Planarity checking, embedding, drawing and coloring.
     planarity.h
     Planarity checking, embedding, drawing and coloring.
     
     preflow.h
     Implementation of the preflow algorithm.
     preflow.h
     Implementation of the preflow algorithm.
     
     quad_heap.h
     Fourary (quaternary) heap implementation.
     quad_heap.h
     Fourary (quaternary) heap implementation.
     
     radix_heap.h
     Radix heap implementation.
     radix_heap.h
     Radix heap implementation.
     
     radix_sort.h
     Radix sort.
     radix_sort.h
     Radix sort.
     
     random.cc
     Instantiation of the Random class.
     random.cc
     Instantiation of the Random class.
     
     random.h
     Mersenne Twister random number generator.
     random.h
     Mersenne Twister random number generator.
     
     smart_graph.h
     SmartDigraph and SmartGraph classes.
     smart_graph.h
     SmartDigraph and SmartGraph classes.
     
     soplex.cc
     Implementation of the LEMON-SOPLEX lp solver interface.
     soplex.cc
     Implementation of the LEMON-SOPLEX lp solver interface.
     
     soplex.h
     Header of the LEMON-SOPLEX lp solver interface.
     soplex.h
     Header of the LEMON-SOPLEX lp solver interface.
     
     static_graph.h
     StaticDigraph class.
     static_graph.h
     StaticDigraph class.
     
     suurballe.h
     An algorithm for finding arc-disjoint paths between two nodes having minimum total length.
     suurballe.h
     An algorithm for finding arc-disjoint paths between two nodes having minimum total length.
     
     time_measure.h
     Tools for measuring cpu usage.
     time_measure.h
     Tools for measuring cpu usage.
     
     tolerance.h
     A basic tool to handle the anomalies of calculation with floating point numbers.
     tolerance.h
     A basic tool to handle the anomalies of calculation with floating point numbers.
     
     unionfind.h
     Union-Find data structures.
     unionfind.h
     Union-Find data structures.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n"}, {"source1": "./usr/share/doc/lemon/html/dir_b6a880ca7a9b1fd5587fcf7bef62ae2e.html", "source2": "./usr/share/doc/lemon/html/dir_b6a880ca7a9b1fd5587fcf7bef62ae2e.html", "unified_diff": "@@ -77,16 +77,16 @@\n \n
    \n

    Detailed Description

    \n

    This directory contains some auxiliary classes for implementing graphs, maps and some other classes. As a user you typically don't have to deal with these files.

    \n \n \n-\n-\n+\n+\n \n

    \n Files

     windows.cc
     Some basic non-inline functions and static global data.
     windows.cc
     Some basic non-inline functions and static global data.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n"}, {"source1": "./usr/share/doc/lemon/html/dir_b6c2a257bfab6380ca9b3cb94b12cb25.html", "source2": "./usr/share/doc/lemon/html/dir_b6c2a257bfab6380ca9b3cb94b12cb25.html", "unified_diff": "@@ -80,19 +80,19 @@\n

    This directory contains several simple demo applications, mainly for educational purposes.

    \n \n \n \n \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

    \n Files

     arg_parser_demo.cc
     Argument parser demo.
     
     graph_to_eps_demo.cc
     Demo of the graph drawing function graphToEps()
     graph_to_eps_demo.cc
     Demo of the graph drawing function graphToEps()
     
     lgf_demo.cc
     Demonstrating graph input and output.
     lgf_demo.cc
     Demonstrating graph input and output.
     
    \n \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n"}, {"source1": "./usr/share/doc/lemon/html/dir_dedea193b59082b9146f1dbfd0a8b56a.html", "source2": "./usr/share/doc/lemon/html/dir_dedea193b59082b9146f1dbfd0a8b56a.html", "unified_diff": "@@ -77,28 +77,28 @@\n \n
    \n

    Detailed Description

    \n

    This directory contains the concept descriptors and concept checking tools. For more information see the Concepts module.

    \n \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n \n \n \n \n \n \n"}, {"source1": "./usr/share/doc/lemon/html/files.html", "source2": "./usr/share/doc/lemon/html/files.html", "unified_diff": "@@ -72,115 +72,115 @@\n
    File List
    \n \n
    \n
    Here is a list of all documented files with brief descriptions:
    \n
    [detail level 123]

    \n Files

     bpgraph.h
     The concept of undirected graphs.
     bpgraph.h
     The concept of undirected graphs.
     
     digraph.h
     The concept of directed graphs.
     digraph.h
     The concept of directed graphs.
     
     graph.h
     The concept of undirected graphs.
     graph.h
     The concept of undirected graphs.
     
     graph_components.h
     The concepts of graph components.
     graph_components.h
     The concepts of graph components.
     
     heap.h
     The concept of heaps.
     heap.h
     The concept of heaps.
     
     maps.h
     The concept of maps.
     
     path.h
     The concept of paths.
     
    \n \n \n-\n-\n+\n+\n \n \n \n-\n+\n \n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n \n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n \n \n \n \n \n
     ► demoA collection of demo applications
     arg_parser_demo.ccArgument parser demo
     graph_to_eps_demo.ccDemo of the graph drawing function graphToEps()
     lgf_demo.ccDemonstrating graph input and output
     graph_to_eps_demo.ccDemo of the graph drawing function graphToEps()
     lgf_demo.ccDemonstrating graph input and output
     ► docAuxiliary (and the whole generated) documentation
     ► lemonBase include directory of LEMON
     ► bitsAuxiliary tools for implementation
     windows.ccSome basic non-inline functions and static global data
     windows.ccSome basic non-inline functions and static global data
     ► conceptsConcept descriptors and checking classes
     bpgraph.hThe concept of undirected graphs
     digraph.hThe concept of directed graphs
     graph.hThe concept of undirected graphs
     graph_components.hThe concepts of graph components
     heap.hThe concept of heaps
     bpgraph.hThe concept of undirected graphs
     digraph.hThe concept of directed graphs
     graph.hThe concept of undirected graphs
     graph_components.hThe concepts of graph components
     heap.hThe concept of heaps
     maps.hThe concept of maps
     path.hThe concept of paths
     adaptors.hAdaptor classes for digraphs and graphs
     arg_parser.hA tool to parse command line arguments
     assert.hExtended assertion handling
     base.ccSome basic non-inline functions and static global data
     bellman_ford.hBellman-Ford algorithm
     bfs.hBFS algorithm
     bin_heap.hBinary heap implementation
     binomial_heap.hBinomial Heap implementation
     bucket_heap.hBucket heap implementation
     capacity_scaling.hCapacity Scaling algorithm for finding a minimum cost flow
     cbc.ccImplementation of the CBC MIP solver interface
     cbc.hHeader of the LEMON-CBC mip solver interface
     christofides_tsp.hChristofides algorithm for symmetric TSP
     circulation.hPush-relabel algorithm for finding a feasible circulation
     clp.hHeader of the LEMON-CLP lp solver interface
     color.ccColor constants
     color.hTools to manage RGB colors
     concept_check.hBasic utilities for concept checking
     connectivity.hConnectivity algorithms
     core.hLEMON core utilities
     cost_scaling.hCost scaling algorithm for finding a minimum cost flow
     counter.hTools for counting steps and events
     cplex.ccImplementation of the LEMON-CPLEX lp solver interface
     cplex.hHeader of the LEMON-CPLEX lp solver interface
     cycle_canceling.hCycle-canceling algorithms for finding a minimum cost flow
     dfs.hDFS algorithm
     dheap.hD-ary heap implementation
     dijkstra.hDijkstra algorithm
     dim2.hA simple two dimensional vector and a bounding box implementation
     dimacs.hDIMACS file format reader
     edge_set.hArcSet and EdgeSet classes
     edmonds_karp.hImplementation of the Edmonds-Karp algorithm
     elevator.hElevator class
     error.hBasic exception classes and error handling
     euler.hEuler tour iterators and a function for checking the Eulerian property
     fib_heap.hFibonacci heap implementation
     fractional_matching.hFractional matching algorithms in general graphs
     full_graph.hFullDigraph and FullGraph classes
     glpk.ccImplementation of the LEMON GLPK LP and MIP solver interface
     glpk.hHeader of the LEMON-GLPK lp solver interface
     gomory_hu.hGomory-Hu cut tree in graphs
     graph_to_eps.hA well configurable tool for visualizing graphs
     greedy_tsp.hGreedy algorithm for symmetric TSP
     grid_graph.hGridGraph class
     grosso_locatelli_pullan_mc.hThe iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem
     hao_orlin.hImplementation of the Hao-Orlin algorithm
     hartmann_orlin_mmc.hHartmann-Orlin's algorithm for finding a minimum mean cycle
     howard_mmc.hHoward's algorithm for finding a minimum mean cycle
     hypercube_graph.hHypercubeGraph class
     insertion_tsp.hInsertion algorithm for symmetric TSP
     karp_mmc.hKarp's algorithm for finding a minimum mean cycle
     kruskal.hKruskal's algorithm to compute a minimum cost spanning tree
     lgf_reader.hLEMON Graph Format reader
     adaptors.hAdaptor classes for digraphs and graphs
     arg_parser.hA tool to parse command line arguments
     assert.hExtended assertion handling
     base.ccSome basic non-inline functions and static global data
     bellman_ford.hBellman-Ford algorithm
     bfs.hBFS algorithm
     bin_heap.hBinary heap implementation
     binomial_heap.hBinomial Heap implementation
     bucket_heap.hBucket heap implementation
     capacity_scaling.hCapacity Scaling algorithm for finding a minimum cost flow
     cbc.ccImplementation of the CBC MIP solver interface
     cbc.hHeader of the LEMON-CBC mip solver interface
     christofides_tsp.hChristofides algorithm for symmetric TSP
     circulation.hPush-relabel algorithm for finding a feasible circulation
     clp.hHeader of the LEMON-CLP lp solver interface
     color.ccColor constants
     color.hTools to manage RGB colors
     concept_check.hBasic utilities for concept checking
     connectivity.hConnectivity algorithms
     core.hLEMON core utilities
     cost_scaling.hCost scaling algorithm for finding a minimum cost flow
     counter.hTools for counting steps and events
     cplex.ccImplementation of the LEMON-CPLEX lp solver interface
     cplex.hHeader of the LEMON-CPLEX lp solver interface
     cycle_canceling.hCycle-canceling algorithms for finding a minimum cost flow
     dfs.hDFS algorithm
     dheap.hD-ary heap implementation
     dijkstra.hDijkstra algorithm
     dim2.hA simple two dimensional vector and a bounding box implementation
     dimacs.hDIMACS file format reader
     edge_set.hArcSet and EdgeSet classes
     edmonds_karp.hImplementation of the Edmonds-Karp algorithm
     elevator.hElevator class
     error.hBasic exception classes and error handling
     euler.hEuler tour iterators and a function for checking the Eulerian property
     fib_heap.hFibonacci heap implementation
     fractional_matching.hFractional matching algorithms in general graphs
     full_graph.hFullDigraph and FullGraph classes
     glpk.ccImplementation of the LEMON GLPK LP and MIP solver interface
     glpk.hHeader of the LEMON-GLPK lp solver interface
     gomory_hu.hGomory-Hu cut tree in graphs
     graph_to_eps.hA well configurable tool for visualizing graphs
     greedy_tsp.hGreedy algorithm for symmetric TSP
     grid_graph.hGridGraph class
     grosso_locatelli_pullan_mc.hThe iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem
     hao_orlin.hImplementation of the Hao-Orlin algorithm
     hartmann_orlin_mmc.hHartmann-Orlin's algorithm for finding a minimum mean cycle
     howard_mmc.hHoward's algorithm for finding a minimum mean cycle
     hypercube_graph.hHypercubeGraph class
     insertion_tsp.hInsertion algorithm for symmetric TSP
     karp_mmc.hKarp's algorithm for finding a minimum mean cycle
     kruskal.hKruskal's algorithm to compute a minimum cost spanning tree
     lgf_reader.hLEMON Graph Format reader
     lgf_writer.hLEMON Graph Format writer
     list_graph.hListDigraph and ListGraph classes
     lp.hDefines a default LP solver
     lp_base.ccThe implementation of the LP solver interface
     lp_base.hThe interface of the LP solver interface
     lp_skeleton.ccA skeleton file to implement LP solver interfaces
     lp_skeleton.hSkeleton file to implement LP/MIP solver interfaces
     maps.hMiscellaneous property maps
     matching.hMaximum matching algorithms in general graphs
     math.hSome extensions to the standard cmath library
     max_cardinality_search.hMaximum cardinality search in undirected digraphs
     min_cost_arborescence.hMinimum Cost Arborescence algorithm
     nagamochi_ibaraki.hImplementation of the Nagamochi-Ibaraki algorithm
     nauty_reader.hNauty file reader
     nearest_neighbor_tsp.hNearest neighbor algorithm for symmetric TSP
     network_simplex.hNetwork Simplex algorithm for finding a minimum cost flow
     opt2_tsp.h2-opt algorithm for symmetric TSP
     pairing_heap.hPairing heap implementation
     path.hClasses for representing paths in digraphs
     planarity.hPlanarity checking, embedding, drawing and coloring
     preflow.hImplementation of the preflow algorithm
     quad_heap.hFourary (quaternary) heap implementation
     radix_heap.hRadix heap implementation
     radix_sort.hRadix sort
     random.ccInstantiation of the Random class
     random.hMersenne Twister random number generator
     smart_graph.hSmartDigraph and SmartGraph classes
     soplex.ccImplementation of the LEMON-SOPLEX lp solver interface
     soplex.hHeader of the LEMON-SOPLEX lp solver interface
     static_graph.hStaticDigraph class
     suurballe.hAn algorithm for finding arc-disjoint paths between two nodes having minimum total length
     time_measure.hTools for measuring cpu usage
     tolerance.hA basic tool to handle the anomalies of calculation with floating point numbers
     unionfind.hUnion-Find data structures
     list_graph.hListDigraph and ListGraph classes
     lp.hDefines a default LP solver
     lp_base.ccThe implementation of the LP solver interface
     lp_base.hThe interface of the LP solver interface
     lp_skeleton.ccA skeleton file to implement LP solver interfaces
     lp_skeleton.hSkeleton file to implement LP/MIP solver interfaces
     maps.hMiscellaneous property maps
     matching.hMaximum matching algorithms in general graphs
     math.hSome extensions to the standard cmath library
     max_cardinality_search.hMaximum cardinality search in undirected digraphs
     min_cost_arborescence.hMinimum Cost Arborescence algorithm
     nagamochi_ibaraki.hImplementation of the Nagamochi-Ibaraki algorithm
     nauty_reader.hNauty file reader
     nearest_neighbor_tsp.hNearest neighbor algorithm for symmetric TSP
     network_simplex.hNetwork Simplex algorithm for finding a minimum cost flow
     opt2_tsp.h2-opt algorithm for symmetric TSP
     pairing_heap.hPairing heap implementation
     path.hClasses for representing paths in digraphs
     planarity.hPlanarity checking, embedding, drawing and coloring
     preflow.hImplementation of the preflow algorithm
     quad_heap.hFourary (quaternary) heap implementation
     radix_heap.hRadix heap implementation
     radix_sort.hRadix sort
     random.ccInstantiation of the Random class
     random.hMersenne Twister random number generator
     smart_graph.hSmartDigraph and SmartGraph classes
     soplex.ccImplementation of the LEMON-SOPLEX lp solver interface
     soplex.hHeader of the LEMON-SOPLEX lp solver interface
     static_graph.hStaticDigraph class
     suurballe.hAn algorithm for finding arc-disjoint paths between two nodes having minimum total length
     time_measure.hTools for measuring cpu usage
     tolerance.hA basic tool to handle the anomalies of calculation with floating point numbers
     unionfind.hUnion-Find data structures
     ► testTest programs
     test_tools.hSome utilities to write test programs
     ► toolsSome useful executables
     dimacs-solver.ccDIMACS problem solver
     dimacs-to-lgf.ccDIMACS to LGF converter
     lgf-gen.ccSpecial plane graph generator
    \n"}, {"source1": "./usr/share/doc/lemon/html/lemon.tag.gz", "source2": "./usr/share/doc/lemon/html/lemon.tag.gz", "unified_diff": null, "details": [{"source1": "lemon.tag", "source2": "lemon.tag", "unified_diff": null, "details": [{"source1": "lemon.tag", "source2": "lemon.tag", "unified_diff": "@@ -1,38 +1,38 @@\n \n \n \n arg_parser_demo.cc\n demo/\n a00008.html\n- lemon/arg_parser.h\n+ lemon/arg_parser.h\n \n \n graph_to_eps_demo.cc\n demo/\n- a00005.html\n- lemon/list_graph.h\n- lemon/graph_to_eps.h\n- lemon/math.h\n+ a00014.html\n+ lemon/list_graph.h\n+ lemon/graph_to_eps.h\n+ lemon/math.h\n \n \n lgf_demo.cc\n demo/\n- a00014.html\n- lemon/smart_graph.h\n- lemon/lgf_reader.h\n+ a00002.html\n+ lemon/smart_graph.h\n+ lemon/lgf_reader.h\n lemon/lgf_writer.h\n \n \n adaptors.h\n lemon/\n- a00401.html\n- lemon/core.h\n- lemon/maps.h\n- lemon/tolerance.h\n+ a00290.html\n+ lemon/core.h\n+ lemon/maps.h\n+ lemon/tolerance.h\n lemon::ReverseDigraph\n lemon::SubDigraph\n lemon::SubGraph\n lemon::FilterNodes\n lemon::FilterArcs\n lemon::FilterEdges\n lemon::Undirector\n@@ -44,26 +44,26 @@\n lemon::SplitNodes::CombinedNodeMap\n lemon::SplitNodes::CombinedArcMap\n lemon\n \n \n arg_parser.h\n lemon/\n- a00254.html\n- lemon/assert.h\n+ a00212.html\n+ lemon/assert.h\n lemon::ArgParserException\n lemon::ArgParser\n lemon::ArgParser::RefType\n lemon\n \n \n assert.h\n lemon/\n- a00194.html\n- lemon/error.h\n+ a00359.html\n+ lemon/error.h\n lemon\n \n #define\n LEMON_ASSERT\n a00542.html\n gaf78cf5572d91896ceecdd970f55601bc\n (exp, msg)\n@@ -75,29 +75,29 @@\n gacbefc04b0335938603649e96af183843\n (exp, msg)\n \n \n \n base.cc\n lemon/\n- a00275.html\n- lemon/tolerance.h\n- lemon/core.h\n- lemon/time_measure.h\n+ a00167.html\n+ lemon/tolerance.h\n+ lemon/core.h\n+ lemon/time_measure.h\n lemon\n \n \n bellman_ford.h\n lemon/\n- a00374.html\n- lemon/list_graph.h\n- lemon/core.h\n- lemon/error.h\n- lemon/maps.h\n- lemon/path.h\n+ a00353.html\n+ lemon/list_graph.h\n+ lemon/core.h\n+ lemon/error.h\n+ lemon/maps.h\n+ lemon/path.h\n lemon::BellmanFordDefaultOperationTraits\n lemon::BellmanFordDefaultTraits\n lemon::BellmanFord\n lemon::BellmanFord::SetPredMap\n lemon::BellmanFord::SetDistMap\n lemon::BellmanFord::SetOperationTraits\n lemon::BellmanFord::ActiveIt\n@@ -105,20 +105,20 @@\n lemon::BellmanFordWizardBase\n lemon::BellmanFordWizard\n lemon\n \n \n bfs.h\n lemon/\n- a00359.html\n- lemon/list_graph.h\n- lemon/core.h\n- lemon/error.h\n- lemon/maps.h\n- lemon/path.h\n+ a00230.html\n+ lemon/list_graph.h\n+ lemon/core.h\n+ lemon/error.h\n+ lemon/maps.h\n+ lemon/path.h\n lemon::BfsDefaultTraits\n lemon::Bfs\n lemon::Bfs::SetPredMap\n lemon::Bfs::SetDistMap\n lemon::Bfs::SetReachedMap\n lemon::Bfs::SetProcessedMap\n lemon::Bfs::SetStandardProcessedMap\n@@ -130,132 +130,132 @@\n lemon::BfsVisit\n lemon::BfsVisit::SetReachedMap\n lemon\n \n \n bin_heap.h\n lemon/\n- a00284.html\n+ a00371.html\n lemon::BinHeap\n lemon\n \n \n binomial_heap.h\n lemon/\n- a00365.html\n- lemon/math.h\n- lemon/counter.h\n+ a00416.html\n+ lemon/math.h\n+ lemon/counter.h\n lemon::BinomialHeap\n lemon\n \n \n windows.cc\n lemon/bits/\n- a00479.html\n+ a00461.html\n lemon\n \n \n bucket_heap.h\n lemon/\n- a00326.html\n+ a00215.html\n lemon::BucketHeap\n lemon::SimpleBucketHeap\n lemon\n \n \n capacity_scaling.h\n lemon/\n- a00257.html\n- lemon/core.h\n- lemon/maps.h\n- lemon/bin_heap.h\n+ a00398.html\n+ lemon/core.h\n+ lemon/maps.h\n+ lemon/bin_heap.h\n lemon::CapacityScalingDefaultTraits\n lemon::CapacityScaling\n lemon::CapacityScaling::SetHeap\n lemon\n \n \n cbc.cc\n lemon/\n- a00332.html\n- cbc.h\n+ a00209.html\n+ cbc.h\n lemon\n \n \n cbc.h\n lemon/\n- a00368.html\n- lemon/lp_base.h\n+ a00428.html\n+ lemon/lp_base.h\n lemon::CbcMip\n lemon\n \n \n christofides_tsp.h\n lemon/\n- a00248.html\n- lemon/full_graph.h\n- lemon/smart_graph.h\n- lemon/kruskal.h\n- lemon/matching.h\n- lemon/euler.h\n+ a00386.html\n+ lemon/full_graph.h\n+ lemon/smart_graph.h\n+ lemon/kruskal.h\n+ lemon/matching.h\n+ lemon/euler.h\n lemon::ChristofidesTsp\n lemon\n \n \n circulation.h\n lemon/\n- a00371.html\n- lemon/tolerance.h\n- lemon/elevator.h\n+ a00182.html\n+ lemon/tolerance.h\n+ lemon/elevator.h\n lemon::CirculationDefaultTraits\n lemon::Circulation\n lemon::Circulation::SetFlowMap\n lemon::Circulation::SetElevator\n lemon::Circulation::SetStandardElevator\n lemon\n \n \n clp.h\n lemon/\n- a00179.html\n- lemon/lp_base.h\n+ a00236.html\n+ lemon/lp_base.h\n lemon::ClpLp\n lemon\n \n \n color.cc\n lemon/\n- a00173.html\n- lemon/color.h\n+ a00425.html\n+ lemon/color.h\n lemon\n \n \n color.h\n lemon/\n- a00317.html\n- lemon/math.h\n- lemon/maps.h\n+ a00221.html\n+ lemon/math.h\n+ lemon/maps.h\n lemon::Color\n lemon::Palette\n lemon\n \n \n concept_check.h\n lemon/\n- a00347.html\n+ a00173.html\n lemon\n \n \n bpgraph.h\n lemon/concepts/\n- a00494.html\n- lemon/concepts/graph_components.h\n+ a00482.html\n+ lemon/concepts/graph_components.h\n lemon/concepts/maps.h\n- lemon/concept_check.h\n- lemon/core.h\n+ lemon/concept_check.h\n+ lemon/core.h\n lemon::concepts::BpGraph\n lemon::concepts::BpGraph::Node\n lemon::concepts::BpGraph::RedNode\n lemon::concepts::BpGraph::BlueNode\n lemon::concepts::BpGraph::RedNodeIt\n lemon::concepts::BpGraph::BlueNodeIt\n lemon::concepts::BpGraph::NodeIt\n@@ -273,19 +273,19 @@\n lemon::concepts::BpGraph::EdgeMap\n lemon\n lemon::concepts\n \n \n digraph.h\n lemon/concepts/\n- a00485.html\n- lemon/core.h\n+ a00494.html\n+ lemon/core.h\n lemon/concepts/maps.h\n- lemon/concept_check.h\n- lemon/concepts/graph_components.h\n+ lemon/concept_check.h\n+ lemon/concepts/graph_components.h\n lemon::concepts::Digraph\n lemon::concepts::Digraph::Node\n lemon::concepts::Digraph::NodeIt\n lemon::concepts::Digraph::Arc\n lemon::concepts::Digraph::OutArcIt\n lemon::concepts::Digraph::InArcIt\n lemon::concepts::Digraph::ArcIt\n@@ -293,19 +293,19 @@\n lemon::concepts::Digraph::ArcMap\n lemon\n lemon::concepts\n \n \n graph.h\n lemon/concepts/\n- a00482.html\n- lemon/concepts/graph_components.h\n+ a00488.html\n+ lemon/concepts/graph_components.h\n lemon/concepts/maps.h\n- lemon/concept_check.h\n- lemon/core.h\n+ lemon/concept_check.h\n+ lemon/core.h\n lemon::concepts::Graph\n lemon::concepts::Graph::Node\n lemon::concepts::Graph::NodeIt\n lemon::concepts::Graph::Edge\n lemon::concepts::Graph::EdgeIt\n lemon::concepts::Graph::IncEdgeIt\n lemon::concepts::Graph::Arc\n@@ -317,16 +317,16 @@\n lemon::concepts::Graph::EdgeMap\n lemon\n lemon::concepts\n \n \n graph_components.h\n lemon/concepts/\n- a00488.html\n- lemon/core.h\n+ a00491.html\n+ lemon/core.h\n lemon/concepts/maps.h\n lemon::concepts::GraphItem\n lemon::concepts::BaseDigraphComponent\n lemon::concepts::BaseGraphComponent\n lemon::concepts::BaseGraphComponent::Edge\n lemon::concepts::BaseBpGraphComponent\n lemon::concepts::BaseBpGraphComponent::RedNode\n@@ -362,40 +362,40 @@\n lemon::concepts::ClearableBpGraphComponent\n lemon\n lemon::concepts\n \n \n heap.h\n lemon/concepts/\n- a00491.html\n- lemon/core.h\n- lemon/concept_check.h\n+ a00485.html\n+ lemon/core.h\n+ lemon/concept_check.h\n lemon::concepts::Heap\n lemon\n lemon::concepts\n \n \n connectivity.h\n lemon/\n- a00305.html\n- lemon/dfs.h\n- lemon/bfs.h\n- lemon/core.h\n- lemon/maps.h\n- lemon/adaptors.h\n- lemon/concepts/digraph.h\n- lemon/concepts/graph.h\n- lemon/concept_check.h\n+ a00233.html\n+ lemon/dfs.h\n+ lemon/bfs.h\n+ lemon/core.h\n+ lemon/maps.h\n+ lemon/adaptors.h\n+ lemon/concepts/digraph.h\n+ lemon/concepts/graph.h\n+ lemon/concept_check.h\n lemon\n \n \n core.h\n lemon/\n- a00329.html\n- lemon/assert.h\n+ a00263.html\n+ lemon/assert.h\n lemon::Invalid\n lemon::DigraphCopy\n lemon::GraphCopy\n lemon::BpGraphCopy\n lemon::ConArcIt\n lemon::ConEdgeIt\n lemon::DynArcLookUp\n@@ -444,79 +444,79 @@\n ga1442da4c0ddce15a9a5f651693d7ab57\n (BpGraph)\n \n \n \n cost_scaling.h\n lemon/\n- a00290.html\n- lemon/core.h\n- lemon/maps.h\n- lemon/math.h\n- lemon/static_graph.h\n- lemon/circulation.h\n- lemon/bellman_ford.h\n+ a00260.html\n+ lemon/core.h\n+ lemon/maps.h\n+ lemon/math.h\n+ lemon/static_graph.h\n+ lemon/circulation.h\n+ lemon/bellman_ford.h\n lemon::CostScalingDefaultTraits\n lemon::CostScaling\n lemon::CostScaling::SetLargeCost\n lemon\n \n \n counter.h\n lemon/\n- a00206.html\n+ a00245.html\n lemon::Counter\n lemon::NoCounter\n lemon\n \n \n cplex.cc\n lemon/\n- a00170.html\n- lemon/cplex.h\n+ a00305.html\n+ lemon/cplex.h\n lemon\n \n \n cplex.h\n lemon/\n- a00407.html\n- lemon/lp_base.h\n+ a00350.html\n+ lemon/lp_base.h\n lemon::CplexEnv\n lemon::CplexEnv::LicenseError\n lemon::CplexBase\n lemon::CplexLp\n lemon::CplexMip\n lemon\n \n \n cycle_canceling.h\n lemon/\n- a00311.html\n- lemon/core.h\n- lemon/maps.h\n- lemon/path.h\n- lemon/math.h\n- lemon/static_graph.h\n- lemon/adaptors.h\n- lemon/circulation.h\n- lemon/bellman_ford.h\n- lemon/howard_mmc.h\n- lemon/hartmann_orlin_mmc.h\n+ a00401.html\n+ lemon/core.h\n+ lemon/maps.h\n+ lemon/path.h\n+ lemon/math.h\n+ lemon/static_graph.h\n+ lemon/adaptors.h\n+ lemon/circulation.h\n+ lemon/bellman_ford.h\n+ lemon/howard_mmc.h\n+ lemon/hartmann_orlin_mmc.h\n lemon::CycleCanceling\n lemon\n \n \n dfs.h\n lemon/\n- a00353.html\n- lemon/list_graph.h\n- lemon/core.h\n- lemon/error.h\n- lemon/maps.h\n- lemon/path.h\n+ a00287.html\n+ lemon/list_graph.h\n+ lemon/core.h\n+ lemon/error.h\n+ lemon/maps.h\n+ lemon/path.h\n lemon::DfsDefaultTraits\n lemon::Dfs\n lemon::Dfs::SetPredMap\n lemon::Dfs::SetDistMap\n lemon::Dfs::SetReachedMap\n lemon::Dfs::SetProcessedMap\n lemon::Dfs::SetStandardProcessedMap\n@@ -528,28 +528,28 @@\n lemon::DfsVisit\n lemon::DfsVisit::SetReachedMap\n lemon\n \n \n dheap.h\n lemon/\n- a00302.html\n+ a00284.html\n lemon::DHeap\n lemon\n \n \n dijkstra.h\n lemon/\n- a00242.html\n- lemon/list_graph.h\n- lemon/bin_heap.h\n- lemon/core.h\n- lemon/error.h\n- lemon/maps.h\n- lemon/path.h\n+ a00344.html\n+ lemon/list_graph.h\n+ lemon/bin_heap.h\n+ lemon/core.h\n+ lemon/error.h\n+ lemon/maps.h\n+ lemon/path.h\n lemon::DijkstraDefaultOperationTraits\n lemon::DijkstraDefaultTraits\n lemon::Dijkstra\n lemon::Dijkstra::SetPredMap\n lemon::Dijkstra::SetDistMap\n lemon::Dijkstra::SetProcessedMap\n lemon::Dijkstra::SetStandardProcessedMap\n@@ -560,326 +560,326 @@\n lemon::DijkstraWizardBase\n lemon::DijkstraWizard\n lemon\n \n \n dim2.h\n lemon/\n- a00281.html\n+ a00314.html\n lemon::dim2::Point\n lemon::dim2::Box\n lemon::dim2::XMap\n lemon::dim2::ConstXMap\n lemon::dim2::YMap\n lemon::dim2::ConstYMap\n lemon::dim2::NormSquareMap\n lemon\n lemon::dim2\n \n \n dimacs.h\n lemon/\n- a00251.html\n- lemon/maps.h\n- lemon/error.h\n+ a00197.html\n+ lemon/maps.h\n+ lemon/error.h\n lemon::DimacsDescriptor\n lemon\n \n \n edge_set.h\n lemon/\n- a00191.html\n- lemon/core.h\n+ a00407.html\n+ lemon/core.h\n lemon::ListArcSet\n lemon::ListEdgeSet\n lemon::SmartArcSet\n lemon::SmartEdgeSet\n lemon\n \n \n edmonds_karp.h\n lemon/\n- a00356.html\n- lemon/tolerance.h\n+ a00311.html\n+ lemon/tolerance.h\n lemon::EdmondsKarpDefaultTraits\n lemon::EdmondsKarp\n lemon::EdmondsKarp::SetFlowMap\n lemon\n \n \n elevator.h\n lemon/\n- a00230.html\n- lemon/core.h\n+ a00383.html\n+ lemon/core.h\n lemon::Elevator\n lemon::LinkedElevator\n lemon\n \n \n error.h\n lemon/\n- a00278.html\n+ a00347.html\n lemon::Exception\n lemon::IoError\n lemon::FormatError\n lemon\n \n \n euler.h\n lemon/\n- a00413.html\n- lemon/core.h\n- lemon/adaptors.h\n- lemon/connectivity.h\n+ a00176.html\n+ lemon/core.h\n+ lemon/adaptors.h\n+ lemon/connectivity.h\n lemon::DiEulerIt\n lemon::EulerIt\n lemon\n \n \n fib_heap.h\n lemon/\n- a00398.html\n- lemon/math.h\n+ a00296.html\n+ lemon/math.h\n lemon::FibHeap\n lemon\n \n \n fractional_matching.h\n lemon/\n- a00224.html\n- lemon/core.h\n- lemon/unionfind.h\n- lemon/bin_heap.h\n- lemon/maps.h\n- lemon/assert.h\n- lemon/elevator.h\n+ a00242.html\n+ lemon/core.h\n+ lemon/unionfind.h\n+ lemon/bin_heap.h\n+ lemon/maps.h\n+ lemon/assert.h\n+ lemon/elevator.h\n lemon::MaxFractionalMatchingDefaultTraits\n lemon::MaxFractionalMatching\n lemon::MaxFractionalMatching::SetMatchingMap\n lemon::MaxFractionalMatching::SetElevator\n lemon::MaxFractionalMatching::SetStandardElevator\n lemon::MaxWeightedFractionalMatching\n lemon::MaxWeightedPerfectFractionalMatching\n lemon\n \n \n full_graph.h\n lemon/\n- a00428.html\n- lemon/core.h\n+ a00272.html\n+ lemon/core.h\n lemon::FullDigraph\n lemon::FullGraph\n lemon::FullBpGraph\n lemon\n \n \n glpk.cc\n lemon/\n- a00320.html\n- lemon/glpk.h\n- lemon/assert.h\n+ a00308.html\n+ lemon/glpk.h\n+ lemon/assert.h\n lemon\n \n \n glpk.h\n lemon/\n- a00314.html\n- lemon/lp_base.h\n+ a00320.html\n+ lemon/lp_base.h\n lemon::GlpkBase\n lemon::GlpkLp\n lemon::GlpkMip\n lemon\n \n \n gomory_hu.h\n lemon/\n- a00380.html\n- lemon/core.h\n- lemon/preflow.h\n- lemon/concept_check.h\n+ a00254.html\n+ lemon/core.h\n+ lemon/preflow.h\n+ lemon/concept_check.h\n lemon/concepts/maps.h\n lemon::GomoryHu\n lemon::GomoryHu::MinCutNodeIt\n lemon::GomoryHu::MinCutEdgeIt\n lemon\n \n \n graph_to_eps.h\n lemon/\n- a00263.html\n- lemon/math.h\n- lemon/core.h\n- lemon/dim2.h\n- lemon/maps.h\n- lemon/color.h\n- lemon/error.h\n+ a00299.html\n+ lemon/math.h\n+ lemon/core.h\n+ lemon/dim2.h\n+ lemon/maps.h\n+ lemon/color.h\n+ lemon/error.h\n lemon::DefaultGraphToEpsTraits\n lemon::GraphToEps\n lemon\n \n \n greedy_tsp.h\n lemon/\n- a00323.html\n- lemon/full_graph.h\n- lemon/unionfind.h\n+ a00269.html\n+ lemon/full_graph.h\n+ lemon/unionfind.h\n lemon::GreedyTsp\n lemon\n \n \n grid_graph.h\n lemon/\n- a00392.html\n- lemon/core.h\n- lemon/dim2.h\n- lemon/assert.h\n+ a00368.html\n+ lemon/core.h\n+ lemon/dim2.h\n+ lemon/assert.h\n lemon::GridGraph\n lemon::GridGraph::IndexMap\n lemon::GridGraph::ColMap\n lemon::GridGraph::RowMap\n lemon\n \n \n grosso_locatelli_pullan_mc.h\n lemon/\n- a00335.html\n- lemon/core.h\n- lemon/random.h\n+ a00203.html\n+ lemon/core.h\n+ lemon/random.h\n lemon::GrossoLocatelliPullanMc\n lemon::GrossoLocatelliPullanMc::CliqueNodeIt\n lemon\n \n \n hao_orlin.h\n lemon/\n- a00338.html\n- lemon/maps.h\n- lemon/core.h\n- lemon/tolerance.h\n+ a00341.html\n+ lemon/maps.h\n+ lemon/core.h\n+ lemon/tolerance.h\n lemon::HaoOrlin\n lemon\n \n \n hartmann_orlin_mmc.h\n lemon/\n- a00389.html\n- lemon/core.h\n- lemon/path.h\n- lemon/tolerance.h\n- lemon/connectivity.h\n+ a00323.html\n+ lemon/core.h\n+ lemon/path.h\n+ lemon/tolerance.h\n+ lemon/connectivity.h\n lemon::HartmannOrlinMmcDefaultTraits\n lemon::HartmannOrlinMmc\n lemon::HartmannOrlinMmc::SetLargeCost\n lemon::HartmannOrlinMmc::SetPath\n lemon\n \n \n howard_mmc.h\n lemon/\n- a00344.html\n- lemon/core.h\n- lemon/path.h\n- lemon/tolerance.h\n- lemon/connectivity.h\n+ a00404.html\n+ lemon/core.h\n+ lemon/path.h\n+ lemon/tolerance.h\n+ lemon/connectivity.h\n lemon::HowardMmcDefaultTraits\n lemon::HowardMmc\n lemon::HowardMmc::SetLargeCost\n lemon::HowardMmc::SetPath\n lemon\n \n \n hypercube_graph.h\n lemon/\n- a00182.html\n- lemon/core.h\n- lemon/assert.h\n+ a00266.html\n+ lemon/core.h\n+ lemon/assert.h\n lemon::HypercubeGraph\n lemon::HypercubeGraph::HyperMap\n lemon\n \n \n insertion_tsp.h\n lemon/\n- a00221.html\n- lemon/full_graph.h\n- lemon/maps.h\n- lemon/random.h\n+ a00380.html\n+ lemon/full_graph.h\n+ lemon/maps.h\n+ lemon/random.h\n lemon::InsertionTsp\n lemon\n \n \n karp_mmc.h\n lemon/\n- a00419.html\n- lemon/core.h\n- lemon/path.h\n- lemon/tolerance.h\n- lemon/connectivity.h\n+ a00356.html\n+ lemon/core.h\n+ lemon/path.h\n+ lemon/tolerance.h\n+ lemon/connectivity.h\n lemon::KarpMmcDefaultTraits\n lemon::KarpMmc\n lemon::KarpMmc::SetLargeCost\n lemon::KarpMmc::SetPath\n lemon\n \n \n kruskal.h\n lemon/\n- a00176.html\n- lemon/unionfind.h\n- lemon/maps.h\n- lemon/core.h\n+ a00395.html\n+ lemon/unionfind.h\n+ lemon/maps.h\n+ lemon/core.h\n lemon\n \n \n lgf_reader.h\n lemon/\n- a00350.html\n- lemon/core.h\n+ a00392.html\n+ lemon/core.h\n lemon/lgf_writer.h\n- lemon/concept_check.h\n+ lemon/concept_check.h\n lemon/concepts/maps.h\n lemon::DigraphReader\n lemon::GraphReader\n lemon::BpGraphReader\n lemon::SectionReader\n lemon::LgfContents\n lemon\n \n \n lgf_writer.h\n lemon/\n a00164.html\n- lemon/core.h\n- lemon/maps.h\n- lemon/concept_check.h\n+ lemon/core.h\n+ lemon/maps.h\n+ lemon/concept_check.h\n lemon/concepts/maps.h\n lemon::DigraphWriter\n lemon::GraphWriter\n lemon::BpGraphWriter\n lemon::SectionWriter\n lemon\n \n \n list_graph.h\n lemon/\n- a00386.html\n- lemon/core.h\n- lemon/error.h\n+ a00206.html\n+ lemon/core.h\n+ lemon/error.h\n lemon::ListDigraph\n lemon::ListDigraph::Snapshot\n lemon::ListGraph\n lemon::ListGraph::Snapshot\n lemon::ListBpGraph\n lemon::ListBpGraph::Snapshot\n lemon\n \n \n lp.h\n lemon/\n- a00212.html\n+ a00188.html\n lemon\n \n #define\n LEMON_DEFAULT_LP\n a00537.html\n ga459ae538832b3817b7692a81de79d744\n \n@@ -891,26 +891,26 @@\n gae4ce37e43b0032f13b3efa0e0b0af640\n \n \n \n \n lp_base.cc\n lemon/\n- a00215.html\n- lemon/lp_base.h\n+ a00224.html\n+ lemon/lp_base.h\n lemon\n \n \n lp_base.h\n lemon/\n- a00299.html\n- lemon/math.h\n- lemon/error.h\n- lemon/assert.h\n- lemon/core.h\n+ a00377.html\n+ lemon/math.h\n+ lemon/error.h\n+ lemon/assert.h\n+ lemon/core.h\n lemon::LpBase\n lemon::LpBase::Col\n lemon::LpBase::ColIt\n lemon::LpBase::Row\n lemon::LpBase::RowIt\n lemon::LpBase::Expr\n lemon::LpBase::Expr::CoeffIt\n@@ -923,46 +923,46 @@\n lemon::LpSolver\n lemon::MipSolver\n lemon\n \n \n lp_skeleton.cc\n lemon/\n- a00341.html\n- lemon/lp_skeleton.h\n+ a00374.html\n+ lemon/lp_skeleton.h\n lemon\n \n \n lp_skeleton.h\n lemon/\n- a00269.html\n- lemon/lp_base.h\n+ a00419.html\n+ lemon/lp_base.h\n lemon::SkeletonSolverBase\n lemon::LpSkeleton\n lemon::MipSkeleton\n lemon\n \n \n maps.h\n lemon/concepts/\n a11517.html\n- lemon/core.h\n- lemon/concept_check.h\n+ lemon/core.h\n+ lemon/concept_check.h\n lemon::concepts::ReadMap\n lemon::concepts::WriteMap\n lemon::concepts::ReadWriteMap\n lemon::concepts::ReferenceMap\n lemon\n lemon::concepts\n \n \n maps.h\n lemon/\n- a00383.html\n- lemon/core.h\n+ a00389.html\n+ lemon/core.h\n lemon::MapBase\n lemon::NullMap\n lemon::ConstMap\n lemon::ConstMap< K, Const< V, v > >\n lemon::IdentityMap\n lemon::RangeMap\n lemon::SparseMap\n@@ -1018,141 +1018,141 @@\n lemon::OutDegMap\n lemon::PotentialDifferenceMap\n lemon\n \n \n matching.h\n lemon/\n- a00377.html\n- lemon/core.h\n- lemon/unionfind.h\n- lemon/bin_heap.h\n- lemon/maps.h\n- lemon/fractional_matching.h\n+ a00170.html\n+ lemon/core.h\n+ lemon/unionfind.h\n+ lemon/bin_heap.h\n+ lemon/maps.h\n+ lemon/fractional_matching.h\n lemon::MaxMatching\n lemon::MaxWeightedMatching\n lemon::MaxWeightedMatching::BlossomIt\n lemon::MaxWeightedPerfectMatching\n lemon::MaxWeightedPerfectMatching::BlossomIt\n lemon\n \n \n math.h\n lemon/\n- a00245.html\n+ a00422.html\n lemon\n \n \n max_cardinality_search.h\n lemon/\n- a00422.html\n- lemon/bin_heap.h\n- lemon/bucket_heap.h\n- lemon/error.h\n- lemon/maps.h\n+ a00179.html\n+ lemon/bin_heap.h\n+ lemon/bucket_heap.h\n+ lemon/error.h\n+ lemon/maps.h\n lemon::MaxCardinalitySearchDefaultTraits\n lemon::MaxCardinalitySearch\n lemon::MaxCardinalitySearch::SetCapacityMap\n lemon::MaxCardinalitySearch::SetCardinalityMap\n lemon::MaxCardinalitySearch::SetProcessedMap\n lemon::MaxCardinalitySearch::SetHeap\n lemon::MaxCardinalitySearch::SetStandardHeap\n lemon\n \n \n min_cost_arborescence.h\n lemon/\n- a00200.html\n- lemon/list_graph.h\n- lemon/bin_heap.h\n- lemon/assert.h\n+ a00239.html\n+ lemon/list_graph.h\n+ lemon/bin_heap.h\n+ lemon/assert.h\n lemon::MinCostArborescenceDefaultTraits\n lemon::MinCostArborescence\n lemon::MinCostArborescence::SetArborescenceMap\n lemon::MinCostArborescence::SetPredMap\n lemon::MinCostArborescence::DualIt\n lemon\n \n \n nagamochi_ibaraki.h\n lemon/\n- a00293.html\n- lemon/core.h\n- lemon/bin_heap.h\n- lemon/bucket_heap.h\n- lemon/maps.h\n- lemon/radix_sort.h\n- lemon/unionfind.h\n+ a00278.html\n+ lemon/core.h\n+ lemon/bin_heap.h\n+ lemon/bucket_heap.h\n+ lemon/maps.h\n+ lemon/radix_sort.h\n+ lemon/unionfind.h\n lemon::NagamochiIbarakiDefaultTraits\n lemon::NagamochiIbaraki\n lemon::NagamochiIbaraki::SetUnitCapacity\n lemon::NagamochiIbaraki::SetHeap\n lemon::NagamochiIbaraki::SetStandardHeap\n lemon\n \n \n nauty_reader.h\n lemon/\n- a00308.html\n+ a00218.html\n lemon\n \n \n nearest_neighbor_tsp.h\n lemon/\n- a00188.html\n- lemon/full_graph.h\n- lemon/maps.h\n+ a00410.html\n+ lemon/full_graph.h\n+ lemon/maps.h\n lemon::NearestNeighborTsp\n lemon\n \n \n network_simplex.h\n lemon/\n- a00416.html\n- lemon/core.h\n- lemon/math.h\n+ a00332.html\n+ lemon/core.h\n+ lemon/math.h\n lemon::NetworkSimplex\n lemon\n \n \n opt2_tsp.h\n lemon/\n- a00410.html\n- lemon/full_graph.h\n+ a00335.html\n+ lemon/full_graph.h\n lemon::Opt2Tsp\n lemon\n \n \n pairing_heap.h\n lemon/\n- a00227.html\n- lemon/math.h\n+ a00251.html\n+ lemon/math.h\n lemon::PairingHeap\n lemon\n \n \n path.h\n lemon/concepts/\n a11520.html\n- lemon/core.h\n- lemon/concept_check.h\n+ lemon/core.h\n+ lemon/concept_check.h\n lemon::concepts::Path\n lemon::concepts::Path::ArcIt\n lemon::concepts::PathDumper\n lemon::concepts::PathDumper::ArcIt\n lemon::concepts::PathDumper::RevArcIt\n lemon\n lemon::concepts\n \n \n path.h\n lemon/\n- a00266.html\n- lemon/error.h\n- lemon/core.h\n+ a00338.html\n+ lemon/error.h\n+ lemon/core.h\n lemon/concepts/path.h\n lemon::Path\n lemon::Path::ArcIt\n lemon::SimplePath\n lemon::SimplePath::ArcIt\n lemon::ListPath\n lemon::ListPath::ArcIt\n@@ -1160,161 +1160,161 @@\n lemon::StaticPath::ArcIt\n lemon::PathNodeIt\n lemon\n \n \n planarity.h\n lemon/\n- a00185.html\n- lemon/dfs.h\n- lemon/bfs.h\n- lemon/radix_sort.h\n- lemon/maps.h\n- lemon/path.h\n- lemon/bucket_heap.h\n- lemon/adaptors.h\n- lemon/edge_set.h\n- lemon/color.h\n- lemon/dim2.h\n+ a00227.html\n+ lemon/dfs.h\n+ lemon/bfs.h\n+ lemon/radix_sort.h\n+ lemon/maps.h\n+ lemon/path.h\n+ lemon/bucket_heap.h\n+ lemon/adaptors.h\n+ lemon/edge_set.h\n+ lemon/color.h\n+ lemon/dim2.h\n lemon::PlanarEmbedding\n lemon::PlanarDrawing\n lemon::PlanarColoring\n lemon\n \n \n preflow.h\n lemon/\n- a00404.html\n- lemon/tolerance.h\n- lemon/elevator.h\n+ a00413.html\n+ lemon/tolerance.h\n+ lemon/elevator.h\n lemon::PreflowDefaultTraits\n lemon::Preflow\n lemon::Preflow::SetFlowMap\n lemon::Preflow::SetElevator\n lemon::Preflow::SetStandardElevator\n lemon\n \n \n quad_heap.h\n lemon/\n- a00203.html\n+ a00329.html\n lemon::QuadHeap\n lemon\n \n \n radix_heap.h\n lemon/\n- a00395.html\n- lemon/error.h\n+ a00293.html\n+ lemon/error.h\n lemon::RadixHeap\n lemon::RadixHeap::PriorityUnderflowError\n lemon\n \n \n radix_sort.h\n lemon/\n- a00272.html\n+ a00317.html\n lemon\n \n \n random.cc\n lemon/\n- a00239.html\n- lemon/random.h\n+ a00185.html\n+ lemon/random.h\n lemon\n \n \n random.h\n lemon/\n- a00296.html\n- lemon/math.h\n- lemon/dim2.h\n+ a00275.html\n+ lemon/math.h\n+ lemon/dim2.h\n lemon::Random\n lemon\n \n \n smart_graph.h\n lemon/\n- a00197.html\n- lemon/core.h\n- lemon/error.h\n+ a00191.html\n+ lemon/core.h\n+ lemon/error.h\n lemon::SmartDigraph\n lemon::SmartDigraph::Snapshot\n lemon::SmartGraph\n lemon::SmartGraph::Snapshot\n lemon::SmartBpGraph\n lemon::SmartBpGraph::Snapshot\n lemon\n \n \n soplex.cc\n lemon/\n- a00260.html\n- lemon/soplex.h\n+ a00326.html\n+ lemon/soplex.h\n lemon\n \n \n soplex.h\n lemon/\n- a00236.html\n- lemon/lp_base.h\n+ a00281.html\n+ lemon/lp_base.h\n lemon::SoplexLp\n lemon\n \n \n static_graph.h\n lemon/\n- a00287.html\n- lemon/core.h\n+ a00257.html\n+ lemon/core.h\n lemon::StaticDigraph\n lemon\n \n \n suurballe.h\n lemon/\n- a00425.html\n- lemon/bin_heap.h\n- lemon/path.h\n- lemon/list_graph.h\n- lemon/dijkstra.h\n- lemon/maps.h\n+ a00302.html\n+ lemon/bin_heap.h\n+ lemon/path.h\n+ lemon/list_graph.h\n+ lemon/dijkstra.h\n+ lemon/maps.h\n lemon::SuurballeDefaultTraits\n lemon::Suurballe\n lemon::Suurballe::SetFlowMap\n lemon::Suurballe::SetPotentialMap\n lemon::Suurballe::SetPath\n lemon::Suurballe::SetHeap\n lemon\n \n \n time_measure.h\n lemon/\n- a00233.html\n- lemon/math.h\n+ a00248.html\n+ lemon/math.h\n lemon::TimeStamp\n lemon::Timer\n lemon::TimeReport\n lemon::NoTimeReport\n lemon\n \n \n tolerance.h\n lemon/\n- a00218.html\n+ a00200.html\n lemon::Tolerance\n lemon::Tolerance< float >\n lemon::Tolerance< double >\n lemon::Tolerance< long double >\n lemon\n \n \n unionfind.h\n lemon/\n- a00209.html\n- lemon/core.h\n+ a00194.html\n+ lemon/core.h\n lemon::UnionFind\n lemon::UnionFindEnum\n lemon::UnionFindEnum::ClassIt\n lemon::UnionFindEnum::ItemIt\n lemon::ExtendFindEnum\n lemon::ExtendFindEnum::ClassIt\n lemon::ExtendFindEnum::ItemIt\n@@ -1335,52 +1335,52 @@\n (rc, msg)\n \n \n \n dimacs-solver.cc\n tools/\n a00503.html\n- lemon/smart_graph.h\n- lemon/dimacs.h\n+ lemon/smart_graph.h\n+ lemon/dimacs.h\n lemon/lgf_writer.h\n- lemon/time_measure.h\n- lemon/arg_parser.h\n- lemon/error.h\n- lemon/dijkstra.h\n- lemon/preflow.h\n- lemon/matching.h\n- lemon/network_simplex.h\n+ lemon/time_measure.h\n+ lemon/arg_parser.h\n+ lemon/error.h\n+ lemon/dijkstra.h\n+ lemon/preflow.h\n+ lemon/matching.h\n+ lemon/network_simplex.h\n \n \n dimacs-to-lgf.cc\n tools/\n a00500.html\n- lemon/smart_graph.h\n- lemon/dimacs.h\n+ lemon/smart_graph.h\n+ lemon/dimacs.h\n lemon/lgf_writer.h\n- lemon/arg_parser.h\n- lemon/error.h\n+ lemon/arg_parser.h\n+ lemon/error.h\n \n \n lgf-gen.cc\n tools/\n a00497.html\n- lemon/list_graph.h\n- lemon/random.h\n- lemon/dim2.h\n- lemon/bfs.h\n- lemon/counter.h\n- lemon/suurballe.h\n- lemon/graph_to_eps.h\n+ lemon/list_graph.h\n+ lemon/random.h\n+ lemon/dim2.h\n+ lemon/bfs.h\n+ lemon/counter.h\n+ lemon/suurballe.h\n+ lemon/graph_to_eps.h\n lemon/lgf_writer.h\n- lemon/arg_parser.h\n- lemon/euler.h\n- lemon/math.h\n- lemon/kruskal.h\n- lemon/time_measure.h\n+ lemon/arg_parser.h\n+ lemon/euler.h\n+ lemon/math.h\n+ lemon/kruskal.h\n+ lemon/time_measure.h\n \n \n lemon::AbsMap\n a03521.html\n typename M\n MapBase< M::Key, M::Value >\n \n"}]}]}, {"source1": "./usr/share/doc/lemon/html/search/all_10.js", "source2": "./usr/share/doc/lemon/html/search/all_10.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -59,15 +59,15 @@\n ['mappabledigraphcomponent_3c_20basebpgraphcomponent_20_3e_49', ['MappableDigraphComponent< BaseBpGraphComponent >', ['../a05417.html', 1, 'lemon::concepts']]],\n ['mappabledigraphcomponent_3c_20basegraphcomponent_20_3e_50', ['MappableDigraphComponent< BaseGraphComponent >', ['../a05417.html', 1, 'lemon::concepts']]],\n ['mappablegraphcomponent_51', ['MappableGraphComponent', ['../a05437.html', 1, 'lemon::concepts']]],\n ['mappablegraphcomponent_3c_20basebpgraphcomponent_20_3e_52', ['MappableGraphComponent< BaseBpGraphComponent >', ['../a05437.html', 1, 'lemon::concepts']]],\n ['maps_53', ['maps', ['../a00516.html', 1, 'Graph Maps'],\n ['../a00515.html', 1, 'Maps']\n ]],\n- ['maps_2eh_54', ['maps.h', ['../a00383.html', 1, '(Global Namespace)'],\n+ ['maps_2eh_54', ['maps.h', ['../a00389.html', 1, '(Global Namespace)'],\n ['../a11517.html', 1, '(Global Namespace)']\n ]],\n ['maptofunctor_55', ['maptofunctor', ['../a03469.html#a33bd2b0fdb3a620641e9f9870b418107', 1, 'lemon::MapToFunctor::MapToFunctor(const M &m)'],\n ['../a00517.html#ga0a68bad2e29c1486f3cc8d7a0cf056e1', 1, 'lemon::MapToFunctor::mapToFunctor(const M &m)'],\n ['../a03469.html', 1, 'MapToFunctor< M >']\n ]],\n ['mat_56', ['MAT', ['../a02425.html#a1d1cfd8ffb84e947f82999c682b666a7abeed243a6ffb8f4f203ba3fb934ab3b5', 1, 'lemon::DimacsDescriptor']]],\n@@ -82,15 +82,15 @@\n ['../a03685.html#affc11fd07a5a277d4e9f939bf18ad590', 1, 'lemon::MaxMatching::matching(const Edge &edge) const'],\n ['../a03685.html#a8d2ab2a2a895ad3acb2b12a1be30fdbd', 1, 'lemon::MaxMatching::matching(const Node &n) const'],\n ['../a03689.html#affc11fd07a5a277d4e9f939bf18ad590', 1, 'lemon::MaxWeightedMatching::matching(const Edge &edge) const'],\n ['../a03689.html#a0ec3673b5dbe00b5d53ca67a66c83986', 1, 'lemon::MaxWeightedMatching::matching(const Node &node) const'],\n ['../a03709.html#affc11fd07a5a277d4e9f939bf18ad590', 1, 'lemon::MaxWeightedPerfectMatching::matching()']\n ]],\n ['matching_20algorithms_59', ['Matching Algorithms', ['../a00530.html', 1, '']]],\n- ['matching_2eh_60', ['matching.h', ['../a00377.html', 1, '']]],\n+ ['matching_2eh_60', ['matching.h', ['../a00170.html', 1, '']]],\n ['matchinginit_61', ['matchingInit', ['../a03685.html#a2db9e08af7f1c09cc29fb16f642b1246', 1, 'lemon::MaxMatching']]],\n ['matchingmap_62', ['matchingmap', ['../a02601.html#a033d9deccd1a06be1a62f8e9bc74c0d4', 1, 'lemon::MaxFractionalMatchingDefaultTraits::MatchingMap'],\n ['../a02605.html#a6c009184144ce191f502a9828343c88d', 1, 'lemon::MaxFractionalMatching::matchingMap() const'],\n ['../a02605.html#a0f28a0743c1f1404a9c625ae507a5743', 1, 'lemon::MaxFractionalMatching::matchingMap(MatchingMap &map)'],\n ['../a03709.html#a5e14c7d4f5b49a6771fef21bece0139c', 1, 'lemon::MaxWeightedPerfectMatching::MatchingMap'],\n ['../a03689.html#a5e14c7d4f5b49a6771fef21bece0139c', 1, 'lemon::MaxWeightedMatching::MatchingMap'],\n ['../a03685.html#a5e14c7d4f5b49a6771fef21bece0139c', 1, 'lemon::MaxMatching::MatchingMap'],\n@@ -114,20 +114,20 @@\n ['../a03709.html#abb81b1f445e7ebcd23a19345b7b229cc', 1, 'lemon::MaxWeightedPerfectMatching::matchingWeight()'],\n ['../a02633.html#abb81b1f445e7ebcd23a19345b7b229cc', 1, 'lemon::MaxWeightedFractionalMatching::matchingWeight()']\n ]],\n ['mate_65', ['mate', ['../a03685.html#ad62aa49f04d01e23c41d4940a3b39ddc', 1, 'lemon::MaxMatching::mate()'],\n ['../a03689.html#a73165a48630fbba60e5bdb7b07db7433', 1, 'lemon::MaxWeightedMatching::mate()'],\n ['../a03709.html#a73165a48630fbba60e5bdb7b07db7433', 1, 'lemon::MaxWeightedPerfectMatching::mate()']\n ]],\n- ['math_2eh_66', ['math.h', ['../a00245.html', 1, '']]],\n+ ['math_2eh_66', ['math.h', ['../a00422.html', 1, '']]],\n ['max_67', ['max', ['../a02425.html#a1d1cfd8ffb84e947f82999c682b666a7ad7e097bda6d981de2520f49fe74c25b7', 1, 'lemon::DimacsDescriptor::MAX'],\n ['../a03341.html#ac56a6b1edba1f6deaff6fae135e6fd9ead7e097bda6d981de2520f49fe74c25b7', 1, 'lemon::LpBase::MAX'],\n ['../a03341.html#a6a360455761dfb54fa2567a5c2e46b70', 1, 'lemon::LpBase::max()']\n ]],\n- ['max_5fcardinality_5fsearch_2eh_68', ['max_cardinality_search.h', ['../a00422.html', 1, '']]],\n+ ['max_5fcardinality_5fsearch_2eh_68', ['max_cardinality_search.h', ['../a00179.html', 1, '']]],\n ['maxarcid_69', ['maxarcid', ['../a05321.html#a40414a15ee291ba518da15d6996ab61d', 1, 'lemon::concepts::IDableDigraphComponent::maxArcId()'],\n ['../a05221.html#a40414a15ee291ba518da15d6996ab61d', 1, 'lemon::concepts::Graph::maxArcId()'],\n ['../a05181.html#a40414a15ee291ba518da15d6996ab61d', 1, 'lemon::concepts::Digraph::maxArcId()'],\n ['../a05101.html#a40414a15ee291ba518da15d6996ab61d', 1, 'lemon::concepts::BpGraph::maxArcId()']\n ]],\n ['maxblueid_70', ['maxblueid', ['../a05337.html#a1725b6e9d1848f04dc580a127e97b76d', 1, 'lemon::concepts::IDableBpGraphComponent::maxBlueId()'],\n ['../a05101.html#a1725b6e9d1848f04dc580a127e97b76d', 1, 'lemon::concepts::BpGraph::maxBlueId()']\n@@ -204,15 +204,15 @@\n ]],\n ['methods_20and_20other_20functions_105', ['Methods and other functions', ['../a11510.html#cs-func', 1, '']]],\n ['migration_20from_20the_200_20x_20series_106', ['Migration from the 0.x Series', ['../a11513.html', 1, '']]],\n ['min_107', ['min', ['../a03341.html#a0ea60e842310906e02cac7ba70cfb591', 1, 'lemon::LpBase::min()'],\n ['../a02425.html#a1d1cfd8ffb84e947f82999c682b666a7a957e8250f68e7b5677b22397c2c1b51e', 1, 'lemon::DimacsDescriptor::MIN'],\n ['../a03341.html#ac56a6b1edba1f6deaff6fae135e6fd9ea957e8250f68e7b5677b22397c2c1b51e', 1, 'lemon::LpBase::MIN']\n ]],\n- ['min_5fcost_5farborescence_2eh_108', ['min_cost_arborescence.h', ['../a00200.html', 1, '']]],\n+ ['min_5fcost_5farborescence_2eh_108', ['min_cost_arborescence.h', ['../a00239.html', 1, '']]],\n ['mincostarborescence_109', ['mincostarborescence', ['../a03805.html', 1, 'MinCostArborescence< GR, CM, TR >'],\n ['../a03805.html#a7e8813f46384642dc4348622a966461a', 1, 'lemon::MinCostArborescence::MinCostArborescence()'],\n ['../a00525.html#ga7cecfde93b5636af02514554181a7d01', 1, 'lemon::minCostArborescence(const Digraph &digraph, const CostMap &cost, typename Digraph::Node source, ArborescenceMap &arborescence)']\n ]],\n ['mincostarborescence_3c_20digraph_2c_20costmap_2c_20setarborescencemaptraits_3c_20t_20_3e_20_3e_110', ['MinCostArborescence< Digraph, CostMap, SetArborescenceMapTraits< T > >', ['../a03805.html', 1, 'lemon']]],\n ['mincostarborescence_3c_20digraph_2c_20costmap_2c_20setpredmaptraits_3c_20t_20_3e_20_3e_111', ['MinCostArborescence< Digraph, CostMap, SetPredMapTraits< T > >', ['../a03805.html', 1, 'lemon']]],\n ['mincostarborescencedefaulttraits_112', ['MinCostArborescenceDefaultTraits', ['../a03801.html', 1, 'lemon']]],\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/all_11.js", "source2": "./usr/share/doc/lemon/html/search/all_11.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,9 +1,9 @@\n var searchData = [\n- ['nagamochi_5fibaraki_2eh_0', ['nagamochi_ibaraki.h', ['../a00293.html', 1, '']]],\n+ ['nagamochi_5fibaraki_2eh_0', ['nagamochi_ibaraki.h', ['../a00278.html', 1, '']]],\n ['nagamochiibaraki_1', ['nagamochiibaraki', ['../a03845.html', 1, 'NagamochiIbaraki< GR, CM, TR >'],\n ['../a03845.html#a3e6c64516d45918b7b493c5ffa95346c', 1, 'lemon::NagamochiIbaraki::NagamochiIbaraki(const Graph &graph)'],\n ['../a03845.html#acda2c978e5e687a4d5e4383aaf4edebd', 1, 'lemon::NagamochiIbaraki::NagamochiIbaraki(const Graph &graph, const CapacityMap &capacity)']\n ]],\n ['nagamochiibaraki_3c_20graph_2c_20capacitymap_2c_20setheaptraits_3c_20h_2c_20rangemap_3c_20int_20_3e_20_3e_20_3e_2', ['NagamochiIbaraki< Graph, CapacityMap, SetHeapTraits< H, RangeMap< int > > >', ['../a03845.html', 1, 'lemon']]],\n ['nagamochiibaraki_3c_20graph_2c_20capacitymap_2c_20setstandardheaptraits_3c_20h_2c_20rangemap_3c_20int_20_3e_20_3e_20_3e_3', ['NagamochiIbaraki< Graph, CapacityMap, SetStandardHeapTraits< H, RangeMap< int > > >', ['../a03845.html', 1, 'lemon']]],\n ['nagamochiibaraki_3c_20graph_2c_20capacitymap_2c_20setunitcapacitytraits_20_3e_4', ['NagamochiIbaraki< Graph, CapacityMap, SetUnitCapacityTraits >', ['../a03845.html', 1, 'lemon']]],\n@@ -13,17 +13,17 @@\n ['named_20function_20parameters_8', ['Named Function Parameters', ['../a11515.html#named-func-param', 1, '']]],\n ['named_20function_20template_20parameters_9', ['Named Function Template Parameters', ['../a11515.html#named-templ-func-param', 1, '']]],\n ['named_20parameters_10', ['Named Parameters', ['../a11515.html', 1, '']]],\n ['names_11', ['File Names', ['../a11510.html#cs-files', 1, '']]],\n ['naming_20conventions_12', ['Naming Conventions', ['../a11510.html#naming_conv', 1, '']]],\n ['nan_13', ['NaN', ['../a03341.html#a7c8e1716b1e4ce72db4eb41902a0cf2d', 1, 'lemon::LpBase']]],\n ['nauty_20format_14', ['NAUTY Format', ['../a00547.html', 1, '']]],\n- ['nauty_5freader_2eh_15', ['nauty_reader.h', ['../a00308.html', 1, '']]],\n+ ['nauty_5freader_2eh_15', ['nauty_reader.h', ['../a00218.html', 1, '']]],\n ['nearest_16', ['NEAREST', ['../a02937.html#a434cb6429f314a1e6ea1c4f2d262708ea32bf899c26ebe34101c3c9d15e41b77e', 1, 'lemon::InsertionTsp']]],\n- ['nearest_5fneighbor_5ftsp_2eh_17', ['nearest_neighbor_tsp.h', ['../a00188.html', 1, '']]],\n+ ['nearest_5fneighbor_5ftsp_2eh_17', ['nearest_neighbor_tsp.h', ['../a00410.html', 1, '']]],\n ['nearestneighbortsp_18', ['nearestneighbortsp', ['../a03885.html', 1, 'NearestNeighborTsp< CM >'],\n ['../a03885.html#a92cd0b9a46a7aac11273f130dd7a7813', 1, 'lemon::NearestNeighborTsp::NearestNeighborTsp()']\n ]],\n ['negatey_19', ['negateY', ['../a02745.html#a34a6257c54cae7ad7d2af843c6b77a3a', 1, 'lemon::GraphToEps']]],\n ['negative_20', ['negative', ['../a04341.html#a0f3a83e592e31a91b5ae73b221180c25', 1, 'lemon::Tolerance::negative()'],\n ['../a04345.html#a229faaac80e37278e8f3f93c69577e6f', 1, 'lemon::Tolerance< float >::negative()'],\n ['../a04349.html#a229faaac80e37278e8f3f93c69577e6f', 1, 'lemon::Tolerance< double >::negative()'],\n@@ -34,15 +34,15 @@\n ['../a03513.html#a77e1df4d3a894decde69bbeb33fb1512', 1, 'lemon::NegMap::NegMap(const M &m)'],\n ['../a03513.html', 1, 'NegMap< M >']\n ]],\n ['negwritemap_23', ['negwritemap', ['../a03517.html', 1, 'NegWriteMap< M >'],\n ['../a00517.html#gaacce5676587f1d1e7c7d810cfd2e7ff1', 1, 'lemon::NegWriteMap::negWriteMap(M &m)'],\n ['../a03517.html#aded98ea981ece293ceb6acd2909cc4c6', 1, 'lemon::NegWriteMap::NegWriteMap(M &m)']\n ]],\n- ['network_5fsimplex_2eh_24', ['network_simplex.h', ['../a00416.html', 1, '']]],\n+ ['network_5fsimplex_2eh_24', ['network_simplex.h', ['../a00332.html', 1, '']]],\n ['networksimplex_25', ['networksimplex', ['../a03889.html#aadcbd3709a402a8ba8d06b8c3d6504d4', 1, 'lemon::NetworkSimplex::NetworkSimplex()'],\n ['../a03889.html', 1, 'NetworkSimplex< GR, V, C >']\n ]],\n ['newsolver_26', ['newsolver', ['../a03405.html#af9d4d0b5e70f9de7d8ae50bf4f1bd0de', 1, 'lemon::LpSolver::newSolver()'],\n ['../a04253.html#a1f6c621f6814f9534bad1ad736c84066', 1, 'lemon::SoplexLp::newSolver()'],\n ['../a03421.html#a71415c216b75fde7f6cfc7d9ef103af2', 1, 'lemon::MipSkeleton::newSolver()'],\n ['../a03417.html#a3e9aef59182b540b41eb4606dff7d536', 1, 'lemon::LpSkeleton::newSolver()'],\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/all_12.js", "source2": "./usr/share/doc/lemon/html/search/all_12.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -468,15 +468,15 @@\n ['../a05221.html#ac7ff65c85b654367c9e41571ccbb830f', 1, 'lemon::concepts::Graph::oppositeArc()']\n ]],\n ['oppositenode_45', ['oppositenode', ['../a05285.html#a2d60b10e6b44602796829ff16993bc8b', 1, 'lemon::concepts::BaseDigraphComponent::oppositeNode()'],\n ['../a05221.html#a881246d96f8f757f23490c8c30016869', 1, 'lemon::concepts::Graph::oppositeNode()'],\n ['../a05181.html#a146d6f0a22cdcef424ffcc4d90ad6921', 1, 'lemon::concepts::Digraph::oppositeNode()'],\n ['../a05101.html#a881246d96f8f757f23490c8c30016869', 1, 'lemon::concepts::BpGraph::oppositeNode()']\n ]],\n- ['opt2_5ftsp_2eh_46', ['opt2_tsp.h', ['../a00410.html', 1, '']]],\n+ ['opt2_5ftsp_2eh_46', ['opt2_tsp.h', ['../a00335.html', 1, '']]],\n ['opt2tsp_47', ['opt2tsp', ['../a03917.html#a599e51b10a8dbbeab4d200827ffc1d27', 1, 'lemon::Opt2Tsp::Opt2Tsp()'],\n ['../a03917.html', 1, 'Opt2Tsp< CM >']\n ]],\n ['optimal_48', ['optimal', ['../a03405.html#a4c669cb1cb4d98dfea944e9ceec7d33ea2579881e7c83261bc21bafb5a5c92cad', 1, 'lemon::LpSolver::OPTIMAL'],\n ['../a03889.html#a4c669cb1cb4d98dfea944e9ceec7d33ea2579881e7c83261bc21bafb5a5c92cad', 1, 'lemon::NetworkSimplex::OPTIMAL'],\n ['../a03409.html#a4c669cb1cb4d98dfea944e9ceec7d33ea2579881e7c83261bc21bafb5a5c92cad', 1, 'lemon::MipSolver::OPTIMAL'],\n ['../a02893.html#a70e8fb7e2e48605883db4d1109a5f79fa2579881e7c83261bc21bafb5a5c92cad', 1, 'lemon::HowardMmc::OPTIMAL'],\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/all_13.js", "source2": "./usr/share/doc/lemon/html/search/all_13.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -2,15 +2,15 @@\n ['pair_0', ['pair', ['../a04085.html#a616fe456bc4c8eddf813c4f5665e1180', 1, 'lemon::QuadHeap::Pair'],\n ['../a02593.html#a616fe456bc4c8eddf813c4f5665e1180', 1, 'lemon::FibHeap::Pair'],\n ['../a02297.html#a616fe456bc4c8eddf813c4f5665e1180', 1, 'lemon::DHeap::Pair'],\n ['../a01841.html#a616fe456bc4c8eddf813c4f5665e1180', 1, 'lemon::SimpleBucketHeap::Pair'],\n ['../a01833.html#a616fe456bc4c8eddf813c4f5665e1180', 1, 'lemon::BucketHeap::Pair'],\n ['../a01813.html#a616fe456bc4c8eddf813c4f5665e1180', 1, 'lemon::BinHeap::Pair']\n ]],\n- ['pairing_5fheap_2eh_1', ['pairing_heap.h', ['../a00227.html', 1, '']]],\n+ ['pairing_5fheap_2eh_1', ['pairing_heap.h', ['../a00251.html', 1, '']]],\n ['pairingheap_2', ['pairingheap', ['../a03925.html', 1, 'PairingHeap< PR, IM, CMP >'],\n ['../a03925.html#a2463e9bc4129fd30fbee90a748d7cffa', 1, 'lemon::PairingHeap::PairingHeap(ItemIntMap &map, const Compare &comp)'],\n ['../a03925.html#a35e0a0d3dae0346c0bc15e833855467d', 1, 'lemon::PairingHeap::PairingHeap(ItemIntMap &map)']\n ]],\n ['palette_3', ['palette', ['../a01917.html', 1, 'Palette'],\n ['../a01917.html#a0e6feeba9d414592568f3e816b62f280', 1, 'lemon::Palette::Palette()']\n ]],\n@@ -57,15 +57,15 @@\n ['../a01657.html#af772b441cd00f8c67ae1e57a51f16c9a', 1, 'lemon::BellmanFord::path()'],\n ['../a03933.html', 1, 'Path< GR >'],\n ['../a02377.html#afb51131e9cb3b8ab7e3316755088eca6', 1, 'lemon::DijkstraWizard::path()']\n ]],\n ['path_20algorithms_12', ['Shortest Path Algorithms', ['../a00524.html', 1, '']]],\n ['path_20structures_13', ['Path Structures', ['../a00518.html', 1, '']]],\n ['path_2eh_14', ['path.h', ['../a11520.html', 1, '(Global Namespace)'],\n- ['../a00266.html', 1, '(Global Namespace)']\n+ ['../a00338.html', 1, '(Global Namespace)']\n ]],\n ['pathcopy_15', ['pathCopy', ['../a00518.html#ga990094109c0d40f830d4a0fbda176d96', 1, 'lemon']]],\n ['pathdumper_16', ['PathDumper', ['../a05593.html', 1, 'lemon::concepts']]],\n ['pathnodeit_17', ['pathnodeit', ['../a04009.html#acf9a6360e9a9397a59a790ce851e2c18', 1, 'lemon::PathNodeIt::PathNodeIt(const Digraph &digraph, const Path &path, const Node &src)'],\n ['../a04009.html#a0885125d0105b43832ff3b92dee6ff16', 1, 'lemon::PathNodeIt::PathNodeIt(const Digraph &digraph, const Path &path)'],\n ['../a04009.html#a6fb8b1bcfaec0fc9824717bf51e01acc', 1, 'lemon::PathNodeIt::PathNodeIt(Invalid)'],\n ['../a04009.html#acec47d873e115073fc9745d186ff012f', 1, 'lemon::PathNodeIt::PathNodeIt()'],\n@@ -85,15 +85,15 @@\n ]],\n ['planardrawing_28', ['planardrawing', ['../a04041.html#a1dcbfde15c25c8d7afc843af77656a0b', 1, 'lemon::PlanarDrawing::PlanarDrawing()'],\n ['../a04041.html', 1, 'PlanarDrawing< Graph >']\n ]],\n ['planarembedding_29', ['planarembedding', ['../a04037.html#ae983a6e43cc2f7ffc5f2fa6e8451cbb9', 1, 'lemon::PlanarEmbedding::PlanarEmbedding()'],\n ['../a04037.html', 1, 'PlanarEmbedding< Graph >']\n ]],\n- ['planarity_2eh_30', ['planarity.h', ['../a00185.html', 1, '']]],\n+ ['planarity_2eh_30', ['planarity.h', ['../a00227.html', 1, '']]],\n ['plus_31', ['plus', ['../a02301.html#acce469a9728bdb4c09c015dc31a3eb3c', 1, 'lemon::DijkstraDefaultOperationTraits::plus()'],\n ['../a01645.html#acce469a9728bdb4c09c015dc31a3eb3c', 1, 'lemon::BellmanFordDefaultOperationTraits::plus()']\n ]],\n ['point_32', ['point', ['../a02397.html#abe96c88c6e71f75951fd3625cb5bcde7', 1, 'lemon::dim2::Point::Point(const Point< TT > &p)'],\n ['../a02397.html#a3162fb50e7b7cd26fe1d2800525779f3', 1, 'lemon::dim2::Point::Point(T a, T b)'],\n ['../a02397.html#ae08c5f0c5b4c75a3e0f33dada5f2fcba', 1, 'lemon::dim2::Point::Point()'],\n ['../a04041.html#ad0e38dcc5f660513182d58fef5759546', 1, 'lemon::PlanarDrawing::Point'],\n@@ -202,15 +202,15 @@\n ['../a01657.html#a441bf8455b4819ae156933ab1370c91f', 1, 'lemon::BellmanFord::predNode()'],\n ['../a01717.html#a441bf8455b4819ae156933ab1370c91f', 1, 'lemon::Bfs::predNode()']\n ]],\n ['predvalue_49', ['predValue', ['../a02725.html#aa24e286feb497fddd0e43d38b63d97e4', 1, 'lemon::GomoryHu']]],\n ['preflow_50', ['preflow', ['../a04057.html', 1, 'Preflow< GR, CAP, TR >'],\n ['../a04057.html#abb9534957b62032a1e5dea5e3ccad75e', 1, 'lemon::Preflow::Preflow()']\n ]],\n- ['preflow_2eh_51', ['preflow.h', ['../a00404.html', 1, '']]],\n+ ['preflow_2eh_51', ['preflow.h', ['../a00413.html', 1, '']]],\n ['preflow_3c_20digraph_2c_20capacitymap_2c_20setelevatortraits_3c_20t_20_3e_20_3e_52', ['Preflow< Digraph, CapacityMap, SetElevatorTraits< T > >', ['../a04057.html', 1, 'lemon']]],\n ['preflow_3c_20digraph_2c_20capacitymap_2c_20setflowmaptraits_3c_20t_20_3e_20_3e_53', ['Preflow< Digraph, CapacityMap, SetFlowMapTraits< T > >', ['../a04057.html', 1, 'lemon']]],\n ['preflow_3c_20digraph_2c_20capacitymap_2c_20setstandardelevatortraits_3c_20t_20_3e_20_3e_54', ['Preflow< Digraph, CapacityMap, SetStandardElevatorTraits< T > >', ['../a04057.html', 1, 'lemon']]],\n ['preflowdefaulttraits_55', ['PreflowDefaultTraits', ['../a04053.html', 1, 'lemon']]],\n ['prescale_56', ['preScale', ['../a02745.html#a5e073873a0443536aacefcf040276770', 1, 'lemon::GraphToEps']]],\n ['presolver_57', ['presolver', ['../a02717.html#ab03beab5ff5c12c7160c325c0b6995d6', 1, 'lemon::GlpkLp']]],\n ['primal_58', ['primal', ['../a03405.html#a9ae7e1617e920a8bc135f114422c2693', 1, 'lemon::LpSolver::primal(Col c) const'],\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/all_14.js", "source2": "./usr/share/doc/lemon/html/search/all_14.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,9 +1,9 @@\n var searchData = [\n- ['quad_5fheap_2eh_0', ['quad_heap.h', ['../a00203.html', 1, '']]],\n+ ['quad_5fheap_2eh_0', ['quad_heap.h', ['../a00329.html', 1, '']]],\n ['quadheap_1', ['quadheap', ['../a04085.html', 1, 'QuadHeap< PR, IM, CMP >'],\n ['../a04085.html#a1e4789b516725925e96744e0c67a2f90', 1, 'lemon::QuadHeap::QuadHeap(ItemIntMap &map)'],\n ['../a04085.html#a791328236563411c33eac2b983c08f19', 1, 'lemon::QuadHeap::QuadHeap(ItemIntMap &map, const Compare &comp)']\n ]],\n ['queuesize_2', ['queuesize', ['../a01717.html#aaa5f62cfe07c16d8cf53f4450aae61e3', 1, 'lemon::Bfs::queueSize()'],\n ['../a01801.html#aaa5f62cfe07c16d8cf53f4450aae61e3', 1, 'lemon::BfsVisit::queueSize()'],\n ['../a02201.html#aaa5f62cfe07c16d8cf53f4450aae61e3', 1, 'lemon::Dfs::queueSize()'],\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/all_15.js", "source2": "./usr/share/doc/lemon/html/search/all_15.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,24 +1,24 @@\n var searchData = [\n- ['radix_5fheap_2eh_0', ['radix_heap.h', ['../a00395.html', 1, '']]],\n- ['radix_5fsort_2eh_1', ['radix_sort.h', ['../a00272.html', 1, '']]],\n+ ['radix_5fheap_2eh_0', ['radix_heap.h', ['../a00293.html', 1, '']]],\n+ ['radix_5fsort_2eh_1', ['radix_sort.h', ['../a00317.html', 1, '']]],\n ['radixheap_2', ['radixheap', ['../a04089.html#a3cb7922e49ab222db12ffc23800aebc0', 1, 'lemon::RadixHeap::RadixHeap()'],\n ['../a04089.html', 1, 'RadixHeap< IM >']\n ]],\n ['radixsort_3', ['radixSort', ['../a00535.html#ga7c26fb2ef8623f8828b58492941a2e34', 1, 'lemon']]],\n ['random_4', ['random', ['../a04149.html', 1, 'Random'],\n ['../a02937.html#a434cb6429f314a1e6ea1c4f2d262708eaa2b65445a3a16f164c5e811064d75726', 1, 'lemon::InsertionTsp::RANDOM'],\n ['../a02829.html#a434cb6429f314a1e6ea1c4f2d262708eaa2b65445a3a16f164c5e811064d75726', 1, 'lemon::GrossoLocatelliPullanMc::RANDOM'],\n ['../a04149.html#aa0cd23a16025cfeef7b8810eeb2a5d36', 1, 'lemon::Random::Random()'],\n ['../a04149.html#a68d070cccabd77b93a742cc9bbe56572', 1, 'lemon::Random::Random(Number seed)'],\n ['../a04149.html#a89d448f90181f96ca00367401cf43312', 1, 'lemon::Random::Random(Iterator begin, Iterator end)'],\n ['../a04149.html#af1ba64a55666953d210a357ffd756bf5', 1, 'lemon::Random::Random(const Random &other)']\n ]],\n- ['random_2ecc_5', ['random.cc', ['../a00239.html', 1, '']]],\n- ['random_2eh_6', ['random.h', ['../a00296.html', 1, '']]],\n+ ['random_2ecc_5', ['random.cc', ['../a00185.html', 1, '']]],\n+ ['random_2eh_6', ['random.h', ['../a00275.html', 1, '']]],\n ['rangeidmap_7', ['rangeidmap', ['../a03589.html', 1, 'RangeIdMap< GR, K >'],\n ['../a03589.html#a5186d7da8a6e71d0dd74806b043fc3a8', 1, 'lemon::RangeIdMap::RangeIdMap(const Graph &gr)'],\n ['../a00516.html#gac058be03cd677659864d5ff0a240d8ca', 1, 'lemon::RangeIdMap::rangeIdMap(const GR &graph)']\n ]],\n ['rangemap_8', ['rangemap', ['../a03449.html#a721cc8008a224e2d8ec682e70b93be33', 1, 'lemon::RangeMap::RangeMap(int size=0, const Value &value=Value())'],\n ['../a03449.html#a07813b57930229a80f26ad69696ca342', 1, 'lemon::RangeMap::RangeMap(const std::vector< V1 > &vector)'],\n ['../a03449.html#a53f01f436ebad322e08f5774429224f0', 1, 'lemon::RangeMap::RangeMap(const RangeMap< V1 > &c)'],\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/all_16.js", "source2": "./usr/share/doc/lemon/html/search/all_16.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -219,15 +219,15 @@\n ['skipnodes_53', ['skipnodes', ['../a03201.html#aaadbe87004604b913af2b0ae0c5b5c22', 1, 'lemon::DigraphWriter::skipNodes()'],\n ['../a03125.html#afeaad58f48913e550cea89b44c60536f', 1, 'lemon::DigraphReader::skipNodes()'],\n ['../a03129.html#aa4b7795c1d5e8bc5205126f902a374bc', 1, 'lemon::GraphReader::skipNodes()'],\n ['../a03133.html#a92aac7c155b98d514c56ff1e757840eb', 1, 'lemon::BpGraphReader::skipNodes()'],\n ['../a03205.html#ab513c139ce3ae391166f749ec5a48c7a', 1, 'lemon::GraphWriter::skipNodes()'],\n ['../a03209.html#a4560bc77fc4b214c2ff47118e5ba97eb', 1, 'lemon::BpGraphWriter::skipNodes()']\n ]],\n- ['smart_5fgraph_2eh_54', ['smart_graph.h', ['../a00197.html', 1, '']]],\n+ ['smart_5fgraph_2eh_54', ['smart_graph.h', ['../a00191.html', 1, '']]],\n ['smartarcset_55', ['smartarcset', ['../a02509.html#a695e3ed4a0721ca1e24704aa26ebfff1', 1, 'lemon::SmartArcSet::SmartArcSet()'],\n ['../a02509.html', 1, 'SmartArcSet< GR >']\n ]],\n ['smartbpgraph_56', ['smartbpgraph', ['../a04245.html#a76e0fd2791f18e8bd408bd4b96265514', 1, 'lemon::SmartBpGraph::SmartBpGraph(const SmartBpGraph &)'],\n ['../a04245.html#a88a0425d8168ea29a010c207b1620f5e', 1, 'lemon::SmartBpGraph::SmartBpGraph()'],\n ['../a04245.html', 1, 'SmartBpGraph']\n ]],\n@@ -280,16 +280,16 @@\n ['solveexitstatus_68', ['SolveExitStatus', ['../a03341.html#a4a5e4b34b14952c4c826e3a859028e31', 1, 'lemon::LpBase']]],\n ['solveprimal_69', ['solveprimal', ['../a02717.html#a48d56f0dbe8b60dadfb9aa6f6e7a458a', 1, 'lemon::GlpkLp::solvePrimal()'],\n ['../a02181.html#a3316441c156eb3cc78bcb835f3e86c3e', 1, 'lemon::CplexLp::solvePrimal()'],\n ['../a01909.html#a0c104ef72fd5fc98036e0a83305bdcb1', 1, 'lemon::ClpLp::solvePrimal()']\n ]],\n ['solvername_70', ['solverName', ['../a03341.html#a07a93354788e07568c98aec6f3ba52e9', 1, 'lemon::LpBase']]],\n ['solvers_71', ['LP and MIP Solvers', ['../a00537.html', 1, '']]],\n- ['soplex_2ecc_72', ['soplex.cc', ['../a00260.html', 1, '']]],\n- ['soplex_2eh_73', ['soplex.h', ['../a00236.html', 1, '']]],\n+ ['soplex_2ecc_72', ['soplex.cc', ['../a00326.html', 1, '']]],\n+ ['soplex_2eh_73', ['soplex.h', ['../a00281.html', 1, '']]],\n ['soplexlp_74', ['soplexlp', ['../a04253.html#a5f0bc2548006cf473f17dc3f9aa01efd', 1, 'lemon::SoplexLp::SoplexLp()'],\n ['../a04253.html#a661b9d88b07c1915e69d7df71006109f', 1, 'lemon::SoplexLp::SoplexLp(const SoplexLp &)'],\n ['../a04253.html', 1, 'SoplexLp']\n ]],\n ['source_75', ['source', ['../a02553.html#ab833af6e9c46098a4fcd43523682777e', 1, 'lemon::EdmondsKarp::source()'],\n ['../a04057.html#ae3b4905fcdad09ea2bd8e79f4bf0f7f3', 1, 'lemon::Preflow::source()'],\n ['../a05101.html#ac9e85ffa6cef50642d14bc9d7f74118e', 1, 'lemon::concepts::BpGraph::source()'],\n@@ -396,15 +396,15 @@\n ['../a02593.html#a5d74787dedbc4e11c1ab15bf487e61f8', 1, 'lemon::FibHeap::State'],\n ['../a02297.html#a5d74787dedbc4e11c1ab15bf487e61f8', 1, 'lemon::DHeap::State'],\n ['../a01841.html#a5d74787dedbc4e11c1ab15bf487e61f8', 1, 'lemon::SimpleBucketHeap::State'],\n ['../a01833.html#a5d74787dedbc4e11c1ab15bf487e61f8', 1, 'lemon::BucketHeap::State'],\n ['../a01817.html#a5d74787dedbc4e11c1ab15bf487e61f8', 1, 'lemon::BinomialHeap::State'],\n ['../a01813.html#a5d74787dedbc4e11c1ab15bf487e61f8', 1, 'lemon::BinHeap::State']\n ]],\n- ['static_5fgraph_2eh_100', ['static_graph.h', ['../a00287.html', 1, '']]],\n+ ['static_5fgraph_2eh_100', ['static_graph.h', ['../a00257.html', 1, '']]],\n ['staticdigraph_101', ['staticdigraph', ['../a04273.html', 1, 'StaticDigraph'],\n ['../a04273.html#acb22e3239d9b109d2a6951626de2e7f5', 1, 'lemon::StaticDigraph::StaticDigraph()']\n ]],\n ['staticpath_102', ['staticpath', ['../a03961.html#a64b9be3c43f4d02196741ece4eb8338f', 1, 'lemon::StaticPath::StaticPath()'],\n ['../a03961.html', 1, 'StaticPath< GR >'],\n ['../a03961.html#a7dc7850181ac172d65320a188c26e150', 1, 'lemon::StaticPath::StaticPath(const StaticPath &cpath)'],\n ['../a03961.html#adb22f061d46947d0b631b40829469e3d', 1, 'lemon::StaticPath::StaticPath(const CPath &cpath)']\n@@ -477,15 +477,15 @@\n ]],\n ['supplytype_121', ['supplytype', ['../a03889.html#a9105ea54524673852c6eda60b7bc58f0', 1, 'lemon::NetworkSimplex::supplyType(SupplyType supply_type)'],\n ['../a03889.html#ac860a45e09c68fb71f723d392c3161ac', 1, 'lemon::NetworkSimplex::SupplyType']\n ]],\n ['suurballe_122', ['suurballe', ['../a04285.html', 1, 'Suurballe< GR, LEN, TR >'],\n ['../a04285.html#a31b52817725a0f1a2154d6e2b026274e', 1, 'lemon::Suurballe::Suurballe()']\n ]],\n- ['suurballe_2eh_123', ['suurballe.h', ['../a00425.html', 1, '']]],\n+ ['suurballe_2eh_123', ['suurballe.h', ['../a00302.html', 1, '']]],\n ['suurballe_3c_20gr_2c_20len_2c_20setflowmaptraits_3c_20t_20_3e_20_3e_124', ['Suurballe< GR, LEN, SetFlowMapTraits< T > >', ['../a04285.html', 1, 'lemon']]],\n ['suurballe_3c_20gr_2c_20len_2c_20setheaptraits_3c_20h_2c_20typename_20digraph_3a_3atemplate_20nodemap_3c_20int_20_3e_20_3e_20_3e_125', ['Suurballe< GR, LEN, SetHeapTraits< H, typename Digraph::template NodeMap< int > > >', ['../a04285.html', 1, 'lemon']]],\n ['suurballe_3c_20gr_2c_20len_2c_20setpathtraits_3c_20t_20_3e_20_3e_126', ['Suurballe< GR, LEN, SetPathTraits< T > >', ['../a04285.html', 1, 'lemon']]],\n ['suurballe_3c_20gr_2c_20len_2c_20setpotentialmaptraits_3c_20t_20_3e_20_3e_127', ['Suurballe< GR, LEN, SetPotentialMapTraits< T > >', ['../a04285.html', 1, 'lemon']]],\n ['suurballedefaulttraits_128', ['SuurballeDefaultTraits', ['../a04281.html', 1, 'lemon']]],\n ['swap_129', ['swap', ['../a03589.html#af90921c6ed51125c78327455d73edb8a', 1, 'lemon::RangeIdMap']]],\n ['synonym_130', ['synonym', ['../a01617.html#a84fdd5f9ed184b3ef96a142590d9c7b3', 1, 'lemon::ArgParser']]],\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/all_17.js", "source2": "./usr/share/doc/lemon/html/search/all_17.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -22,15 +22,15 @@\n ]],\n ['terms_8', ['License Terms', ['../a11512.html', 1, '']]],\n ['test_5ftools_2eh_9', ['test_tools.h', ['../a00506.html', 1, '']]],\n ['the_200_20x_20series_10', ['Migration from the 0.x Series', ['../a11513.html', 1, '']]],\n ['the_20documentation_11', ['How to Read the Documentation', ['../index.html#howtoread', 1, '']]],\n ['throwonproblems_12', ['throwOnProblems', ['../a01617.html#a4f78fd6d3de2bbcab981ec4df3826842', 1, 'lemon::ArgParser']]],\n ['time_20measuring_20and_20counting_13', ['Time Measuring and Counting', ['../a00541.html', 1, '']]],\n- ['time_5fmeasure_2eh_14', ['time_measure.h', ['../a00233.html', 1, '']]],\n+ ['time_5fmeasure_2eh_14', ['time_measure.h', ['../a00248.html', 1, '']]],\n ['timer_15', ['timer', ['../a04329.html', 1, 'Timer'],\n ['../a04329.html#a7c4639dcdcc80169f9886b41077e106a', 1, 'lemon::Timer::Timer()']\n ]],\n ['timereport_16', ['timereport', ['../a04333.html#ab0a9d6a56eda7da48ed9c4a9ea31cc66', 1, 'lemon::TimeReport::TimeReport()'],\n ['../a04333.html', 1, 'TimeReport']\n ]],\n ['timestamp_17', ['timestamp', ['../a04325.html#a1ae4a35dfcd8d6cd86ac79b723b463be', 1, 'lemon::TimeStamp::TimeStamp()'],\n@@ -71,15 +71,15 @@\n ['../a04349.html#a9945dec0f6e6f3cf19597b2f7fa313b1', 1, 'lemon::Tolerance< double >::Tolerance(double e)'],\n ['../a04349.html#a9fb4f4c61a9530cf159b6d73e0a1e74f', 1, 'lemon::Tolerance< double >::Tolerance()'],\n ['../a04345.html#a1a95b75b6f3503b87ff886003df8503a', 1, 'lemon::Tolerance< float >::Tolerance()'],\n ['../a02969.html#a35e771685a474e678b13c4de43711c7f', 1, 'lemon::KarpMmc::Tolerance'],\n ['../a04057.html#a926a96c583959d256c1316a2aca3ce22', 1, 'lemon::Preflow::Tolerance'],\n ['../a04345.html#a9fb4f4c61a9530cf159b6d73e0a1e74f', 1, 'lemon::Tolerance< float >::Tolerance()']\n ]],\n- ['tolerance_2eh_21', ['tolerance.h', ['../a00218.html', 1, '']]],\n+ ['tolerance_2eh_21', ['tolerance.h', ['../a00200.html', 1, '']]],\n ['tolerance_3c_20double_20_3e_22', ['Tolerance< double >', ['../a04349.html', 1, 'lemon']]],\n ['tolerance_3c_20float_20_3e_23', ['Tolerance< float >', ['../a04345.html', 1, 'lemon']]],\n ['tolerance_3c_20long_20double_20_3e_24', ['Tolerance< long double >', ['../a04353.html', 1, 'lemon']]],\n ['tools_25', ['tools', ['../a11513.html#migration-error', 1, 'Exceptions and Debug tools'],\n ['../a00536.html', 1, 'General Optimization Tools'],\n ['../a11513.html#migration-lgf', 1, 'LGF tools'],\n ['../a00540.html', 1, 'Miscellaneous Tools']\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/all_18.js", "source2": "./usr/share/doc/lemon/html/search/all_18.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -24,15 +24,15 @@\n ['../a00514.html#gaebf4f5d421ecb3a11161a2efca58bbd9', 1, 'lemon::Undirector::undirector(const DGR &digraph)'],\n ['../a01533.html', 1, 'Undirector< DGR >']\n ]],\n ['undirector_3c_20const_20digraph_20_3e_7', ['Undirector< const Digraph >', ['../a01533.html', 1, 'lemon']]],\n ['unionfind_8', ['unionfind', ['../a04357.html', 1, 'UnionFind< IM >'],\n ['../a04357.html#a23eb9f42b64ad319bd13e7b39921f9e1', 1, 'lemon::UnionFind::UnionFind()']\n ]],\n- ['unionfind_2eh_9', ['unionfind.h', ['../a00209.html', 1, '']]],\n+ ['unionfind_2eh_9', ['unionfind.h', ['../a00194.html', 1, '']]],\n ['unionfindenum_10', ['UnionFindEnum', ['../a04361.html', 1, 'lemon']]],\n ['unknown_5fopt_11', ['UNKNOWN_OPT', ['../a01613.html#af38960e2d1da2c992b2232eb3f285c4eabfd8812b728977aa16448b7751ef9508', 1, 'lemon::ArgParserException']]],\n ['unmatched_12', ['UNMATCHED', ['../a03685.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba1281ac5b7ba5b42a08b8e2dfee5ec74c', 1, 'lemon::MaxMatching']]],\n ['unsolved_13', ['UNSOLVED', ['../a03341.html#a4a5e4b34b14952c4c826e3a859028e31a38e4b0838cfb137a637dcf0f5217b694', 1, 'lemon::LpBase']]],\n ['unsupportedformaterror_14', ['UnsupportedFormatError', ['../a03401.html', 1, 'lemon::LpBase']]],\n ['up_15', ['up', ['../a02813.html#a0156ee209c9b4ad8ade299394687d98d', 1, 'lemon::GridGraph']]],\n ['upper_16', ['UPPER', ['../a03405.html#a86b9012e22aaac73c64bb7247dcb44c5ae704d5d328a8522a6193aa3efb28c724', 1, 'lemon::LpSolver']]],\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/all_1a.js", "source2": "./usr/share/doc/lemon/html/search/all_1a.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -11,15 +11,15 @@\n ['../a01613.html#aa884ff67408851f00e50cf971a4dfd05', 1, 'lemon::ArgParserException::what()'],\n ['../a02581.html#aa884ff67408851f00e50cf971a4dfd05', 1, 'lemon::FormatError::what()']\n ]],\n ['white_3', ['WHITE', ['../a00540.html#gaa574c6748d637031ff114ee5396f371d', 1, 'lemon']]],\n ['width_4', ['width', ['../a02401.html#a7f4553e88461c9deaf624f0af83b468c', 1, 'lemon::dim2::Box::width()'],\n ['../a02813.html#ad72663daf610f2a0833a2fc3d78e4fdf', 1, 'lemon::GridGraph::width()']\n ]],\n- ['windows_2ecc_5', ['windows.cc', ['../a00479.html', 1, '']]],\n+ ['windows_2ecc_5', ['windows.cc', ['../a00461.html', 1, '']]],\n ['write_6', ['write', ['../a02177.html#a01fb09b584b86088a044612f90401291', 1, 'lemon::CplexBase::write()'],\n ['../a02709.html#a01fb09b584b86088a044612f90401291', 1, 'lemon::GlpkBase::write()'],\n ['../a03341.html#a01fb09b584b86088a044612f90401291', 1, 'lemon::LpBase::write()']\n ]],\n ['writedimacsmat_7', ['writeDimacsMat', ['../a00546.html#ga21ec5f2eae09a772911ad7eb6eea63ae', 1, 'lemon']]],\n ['writemap_8', ['writemap', ['../a00550.html#ga7988a5ffa9402369408447cb21be1123', 1, 'lemon::concepts::WriteMap::WriteMap()'],\n ['../a05549.html', 1, 'WriteMap< K, T >']\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/all_4.js", "source2": "./usr/share/doc/lemon/html/search/all_4.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -29,15 +29,15 @@\n ]],\n ['activesonlevel_10', ['activesonlevel', ['../a02565.html#a245c078bd901f23e0123534d43504693', 1, 'lemon::Elevator::activesOnLevel()'],\n ['../a02569.html#a245c078bd901f23e0123534d43504693', 1, 'lemon::LinkedElevator::activesOnLevel()']\n ]],\n ['acyclic_11', ['acyclic', ['../a00531.html#gafea92444915d2c04d5d868c7daec1b68', 1, 'lemon']]],\n ['adaptor_20classes_20for_20graphs_12', ['Adaptor Classes for Graphs', ['../a00514.html', 1, '']]],\n ['adaptors_13', ['Map Adaptors', ['../a00517.html', 1, '']]],\n- ['adaptors_2eh_14', ['adaptors.h', ['../a00401.html', 1, '']]],\n+ ['adaptors_2eh_14', ['adaptors.h', ['../a00290.html', 1, '']]],\n ['add_15', ['add', ['../a03589.html#a26843673979cea029c22db6d5561cb37', 1, 'lemon::RangeIdMap::add(const std::vector< Item > &items)'],\n ['../a03589.html#a8f19d579f2966225d0000e559d187a38', 1, 'lemon::RangeIdMap::add(const Item &item)'],\n ['../a02401.html#aa961ea8e323638367f8ee03cf55182fd', 1, 'lemon::dim2::Box::add(const Box &u)'],\n ['../a02401.html#acab32b0d2070b75c4f073fa24b264051', 1, 'lemon::dim2::Box::add(const Point< T > &u)'],\n ['../a01917.html#a77e076addeb00430edb72da3f9b134b0', 1, 'lemon::Palette::add()']\n ]],\n ['addarc_16', ['addarc', ['../a02449.html#ab947ea03356504c5c4b3c8ebfed1516a', 1, 'lemon::ListArcSet::addArc()'],\n@@ -285,15 +285,15 @@\n ['arcs_67', ['arcs', ['../a03125.html#aedf9af8d297c30e0cb0bb3c7268ce7e0', 1, 'lemon::DigraphReader::arcs()'],\n ['../a03201.html#a3f160f506a390dd125d487fd6508479c', 1, 'lemon::DigraphWriter::arcs()']\n ]],\n ['arcsection_68', ['arcSection', ['../a03141.html#a30d18bb14a5ac08ff754630a5ef55e40', 1, 'lemon::LgfContents']]],\n ['arcsectionnum_69', ['arcSectionNum', ['../a03141.html#a66d3f53752cdabeeee076438af93bc64', 1, 'lemon::LgfContents']]],\n ['arcwidths_70', ['arcWidths', ['../a02745.html#a412aff9588718d47d62aefe95f48c9c1', 1, 'lemon::GraphToEps']]],\n ['arcwidthscale_71', ['arcWidthScale', ['../a02745.html#af524d8f7a4dd22e27064e202044a3f09', 1, 'lemon::GraphToEps']]],\n- ['arg_5fparser_2eh_72', ['arg_parser.h', ['../a00254.html', 1, '']]],\n+ ['arg_5fparser_2eh_72', ['arg_parser.h', ['../a00212.html', 1, '']]],\n ['arg_5fparser_5fdemo_2ecc_73', ['arg_parser_demo.cc', ['../a00008.html', 1, '']]],\n ['argparser_74', ['argparser', ['../a01617.html#ac53646f9d7508088703ae971557756da', 1, 'lemon::ArgParser::ArgParser()'],\n ['../a01617.html', 1, 'ArgParser']\n ]],\n ['argparserexception_75', ['argparserexception', ['../a01613.html', 1, 'ArgParserException'],\n ['../a01613.html#a143c5e00789073bb68ef6139fa3de431', 1, 'lemon::ArgParserException::ArgParserException()']\n ]],\n@@ -307,15 +307,15 @@\n ]],\n ['asrednode_80', ['asrednode', ['../a05101.html#afa6c2206200de5019918999c62882ff6', 1, 'lemon::concepts::BpGraph::asRedNode()'],\n ['../a05305.html#afa6c2206200de5019918999c62882ff6', 1, 'lemon::concepts::BaseBpGraphComponent::asRedNode()']\n ]],\n ['asrednodeunsafe_81', ['asrednodeunsafe', ['../a05101.html#a3058478fec8120a41bd34ce72eb27631', 1, 'lemon::concepts::BpGraph::asRedNodeUnsafe()'],\n ['../a05305.html#a3058478fec8120a41bd34ce72eb27631', 1, 'lemon::concepts::BaseBpGraphComponent::asRedNodeUnsafe()']\n ]],\n- ['assert_2eh_82', ['assert.h', ['../a00194.html', 1, '']]],\n+ ['assert_2eh_82', ['assert.h', ['../a00359.html', 1, '']]],\n ['attribute_83', ['attribute', ['../a03133.html#a1a019983d3aa1a24f18032a93a4d74e2', 1, 'lemon::BpGraphReader::attribute()'],\n ['../a03125.html#a1cf237b8e9ee33df6725c62c70da7451', 1, 'lemon::DigraphReader::attribute(const std::string &caption, Value &value)'],\n ['../a03125.html#ae1d44055e018ad2077ee8c1c5c126d2c', 1, 'lemon::DigraphReader::attribute(const std::string &caption, Value &value, const Converter &converter=Converter())'],\n ['../a03129.html#ac3ac19ea237fe50d88a449e786d1092a', 1, 'lemon::GraphReader::attribute(const std::string &caption, Value &value)'],\n ['../a03129.html#a9dacf0cbe2abd7e1a4a64fbf43f0dc88', 1, 'lemon::GraphReader::attribute(const std::string &caption, Value &value, const Converter &converter=Converter())'],\n ['../a03209.html#a6652cc28c9ba1ef1d2126ec279e5fcb6', 1, 'lemon::BpGraphWriter::attribute()'],\n ['../a03201.html#a26a31821021fc8d3f0827e99cbf6718f', 1, 'lemon::DigraphWriter::attribute()'],\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/all_5.js", "source2": "./usr/share/doc/lemon/html/search/all_5.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -13,15 +13,15 @@\n ['../a03661.html', 1, 'BackwardMap< GR >']\n ]],\n ['barrier_4', ['barrier', ['../a01881.html#a721a11371b4e487be7c42614481b6ddd', 1, 'lemon::Circulation::barrier()'],\n ['../a02605.html#a721a11371b4e487be7c42614481b6ddd', 1, 'lemon::MaxFractionalMatching::barrier()'],\n ['../a03685.html#a260eed009ff30adef3d856b44cf76bc9', 1, 'lemon::MaxMatching::barrier()']\n ]],\n ['barriermap_5', ['barrierMap', ['../a01881.html#a067296931f77c1adbaa5920f270164cc', 1, 'lemon::Circulation']]],\n- ['base_2ecc_6', ['base.cc', ['../a00275.html', 1, '']]],\n+ ['base_2ecc_6', ['base.cc', ['../a00167.html', 1, '']]],\n ['basebpgraphcomponent_7', ['BaseBpGraphComponent', ['../a05305.html', 1, 'lemon::concepts']]],\n ['basedigraphcomponent_8', ['BaseDigraphComponent', ['../a05285.html', 1, 'lemon::concepts']]],\n ['basegraphcomponent_9', ['BaseGraphComponent', ['../a05293.html', 1, 'lemon::concepts']]],\n ['basenode_10', ['basenode', ['../a05181.html#a581bb7d2e756fac2d971849e60e98297', 1, 'lemon::concepts::Digraph::baseNode()'],\n ['../a05221.html#a58e9568fc1817eab27698269ca154dd6', 1, 'lemon::concepts::Graph::baseNode(IncEdgeIt) const'],\n ['../a05221.html#a6f0f66cde63d5e9d7f0642746d840230', 1, 'lemon::concepts::Graph::baseNode(OutArcIt) const'],\n ['../a05221.html#a581bb7d2e756fac2d971849e60e98297', 1, 'lemon::concepts::Graph::baseNode(InArcIt) const'],\n@@ -35,15 +35,15 @@\n ]],\n ['basic_11', ['BASIC', ['../a03405.html#a86b9012e22aaac73c64bb7247dcb44c5a13c45196813cb44e6e81e9c48a5ec1b4', 1, 'lemon::LpSolver']]],\n ['basic_20graph_20utilities_12', ['Basic Graph Utilities', ['../a00539.html', 1, '']]],\n ['begin_13', ['begin', ['../a03565.html#a09dd208593b9721a30a83ed978ede577', 1, 'lemon::LoggerBoolMap']]],\n ['beginvalue_14', ['beginvalue', ['../a03637.html#aacb353dcd725e2cdcf4929aaabe25b67', 1, 'lemon::IterableValueMap::beginValue()'],\n ['../a03577.html#aacb353dcd725e2cdcf4929aaabe25b67', 1, 'lemon::CrossRefMap::beginValue()']\n ]],\n- ['bellman_5fford_2eh_15', ['bellman_ford.h', ['../a00374.html', 1, '']]],\n+ ['bellman_5fford_2eh_15', ['bellman_ford.h', ['../a00353.html', 1, '']]],\n ['bellmanford_16', ['bellmanford', ['../a01657.html', 1, 'BellmanFord< GR, LEN, TR >'],\n ['../a00524.html#ga6ab0f5b3864a9d9abcf68b0b92d366c5', 1, 'lemon::bellmanFord(const GR &digraph, const LEN &length)'],\n ['../a01657.html#a3c6b227a4a6d76c8c5960ab4d713c1d7', 1, 'lemon::BellmanFord::BellmanFord()']\n ]],\n ['bellmanford_3c_20digraph_2c_20lengthmap_2c_20setdistmaptraits_3c_20t_20_3e_20_3e_17', ['BellmanFord< Digraph, LengthMap, SetDistMapTraits< T > >', ['../a01657.html', 1, 'lemon']]],\n ['bellmanford_3c_20digraph_2c_20lengthmap_2c_20setoperationtraitstraits_3c_20t_20_3e_20_3e_18', ['BellmanFord< Digraph, LengthMap, SetOperationTraitsTraits< T > >', ['../a01657.html', 1, 'lemon']]],\n ['bellmanford_3c_20digraph_2c_20lengthmap_2c_20setpredmaptraits_3c_20t_20_3e_20_3e_19', ['BellmanFord< Digraph, LengthMap, SetPredMapTraits< T > >', ['../a01657.html', 1, 'lemon']]],\n@@ -61,15 +61,15 @@\n ['bellmanfordwizarddefaulttraits_24', ['BellmanFordWizardDefaultTraits', ['../a01689.html', 1, 'lemon']]],\n ['best_5feligible_25', ['BEST_ELIGIBLE', ['../a03889.html#a310d3a1fcfff1e099330ae372abc73c2ac89b3377964fb28026f9b814f30c210b', 1, 'lemon::NetworkSimplex']]],\n ['bfs_26', ['bfs', ['../a01717.html', 1, 'Bfs< GR, TR >'],\n ['../a01717.html#a55f525c9a3cc7a3ecb17c51873ba1d14', 1, 'lemon::Bfs::Bfs()'],\n ['../a00523.html#ga85685a2294693581cbfad40c3c30ccbf', 1, 'lemon::bfs()']\n ]],\n ['bfs_20dfs_20and_20dijkstra_27', ['BFS, DFS and Dijkstra', ['../a11513.html#migration-search', 1, '']]],\n- ['bfs_2eh_28', ['bfs.h', ['../a00359.html', 1, '']]],\n+ ['bfs_2eh_28', ['bfs.h', ['../a00230.html', 1, '']]],\n ['bfs_3c_20digraph_2c_20setdistmaptraits_3c_20t_20_3e_20_3e_29', ['Bfs< Digraph, SetDistMapTraits< T > >', ['../a01717.html', 1, 'lemon']]],\n ['bfs_3c_20digraph_2c_20setpredmaptraits_3c_20t_20_3e_20_3e_30', ['Bfs< Digraph, SetPredMapTraits< T > >', ['../a01717.html', 1, 'lemon']]],\n ['bfs_3c_20digraph_2c_20setprocessedmaptraits_3c_20t_20_3e_20_3e_31', ['Bfs< Digraph, SetProcessedMapTraits< T > >', ['../a01717.html', 1, 'lemon']]],\n ['bfs_3c_20digraph_2c_20setreachedmaptraits_3c_20t_20_3e_20_3e_32', ['Bfs< Digraph, SetReachedMapTraits< T > >', ['../a01717.html', 1, 'lemon']]],\n ['bfs_3c_20digraph_2c_20setstandardprocessedmaptraits_20_3e_33', ['Bfs< Digraph, SetStandardProcessedMapTraits >', ['../a01717.html', 1, 'lemon']]],\n ['bfsdefaulttraits_34', ['BfsDefaultTraits', ['../a01713.html', 1, 'lemon']]],\n ['bfsvisit_35', ['bfsvisit', ['../a01801.html#ae27c446704010b785a05379a1e02811e', 1, 'lemon::BfsVisit::BfsVisit()'],\n@@ -89,28 +89,28 @@\n ['../a01765.html', 1, 'BfsWizardBase< GR >']\n ]],\n ['bfswizarddefaulttraits_42', ['BfsWizardDefaultTraits', ['../a01761.html', 1, 'lemon']]],\n ['bibliography_43', ['Bibliography', ['../a11523.html', 1, '']]],\n ['biedgeconnected_44', ['biEdgeConnected', ['../a00531.html#gac86ac46fd94b49fe56bbb2e45e1f43f0', 1, 'lemon']]],\n ['biedgeconnectedcomponents_45', ['biEdgeConnectedComponents', ['../a00531.html#ga21e93bea51dbfbaeebfae99255842ddb', 1, 'lemon']]],\n ['biedgeconnectedcutedges_46', ['biEdgeConnectedCutEdges', ['../a00531.html#gacf528201ef1e1446dfcce2d9e16c0959', 1, 'lemon']]],\n- ['bin_5fheap_2eh_47', ['bin_heap.h', ['../a00284.html', 1, '']]],\n+ ['bin_5fheap_2eh_47', ['bin_heap.h', ['../a00371.html', 1, '']]],\n ['bindarc_48', ['bindArc', ['../a01601.html#afa9ff5bc582ba23c4d1ee971c622c1c1', 1, 'lemon::SplitNodes']]],\n ['binheap_49', ['binheap', ['../a01813.html', 1, 'BinHeap< PR, IM, CMP >'],\n ['../a01813.html#ad37464eb1f70d05e41d8b2f99c3b7b54', 1, 'lemon::BinHeap::BinHeap(ItemIntMap &map, const Compare &comp)'],\n ['../a01813.html#acf056081005598d56af81013dc122e3f', 1, 'lemon::BinHeap::BinHeap(ItemIntMap &map)']\n ]],\n ['binheap_3c_20value_2c_20intarcmap_20_3e_50', ['BinHeap< Value, IntArcMap >', ['../a01813.html', 1, 'lemon']]],\n ['binheap_3c_20value_2c_20intedgemap_20_3e_51', ['BinHeap< Value, IntEdgeMap >', ['../a01813.html', 1, 'lemon']]],\n ['binheap_3c_20value_2c_20intnodemap_20_3e_52', ['BinHeap< Value, IntNodeMap >', ['../a01813.html', 1, 'lemon']]],\n ['binheap_3c_20value_2c_20lemon_3a_3arangemap_20_3e_53', ['BinHeap< Value, lemon::RangeMap >', ['../a01813.html', 1, 'lemon']]],\n ['binodeconnected_54', ['biNodeConnected', ['../a00531.html#ga9c680aba3eb323e99bec1f1f5456b130', 1, 'lemon']]],\n ['binodeconnectedcomponents_55', ['biNodeConnectedComponents', ['../a00531.html#ga2a4ae65a1735c7a1062049470584ba2a', 1, 'lemon']]],\n ['binodeconnectedcutnodes_56', ['biNodeConnectedCutNodes', ['../a00531.html#gae2230b3584207b60bc16ad4a1df897a8', 1, 'lemon']]],\n- ['binomial_5fheap_2eh_57', ['binomial_heap.h', ['../a00365.html', 1, '']]],\n+ ['binomial_5fheap_2eh_57', ['binomial_heap.h', ['../a00416.html', 1, '']]],\n ['binomialheap_58', ['binomialheap', ['../a01817.html#a081f9542eed0eb80c980f95e850e4d43', 1, 'lemon::BinomialHeap::BinomialHeap()'],\n ['../a01817.html', 1, 'BinomialHeap< PR, IM, CMP >'],\n ['../a01817.html#a6c476fe3ee11480a57545c069b0c912d', 1, 'lemon::BinomialHeap::BinomialHeap()']\n ]],\n ['bipartite_59', ['bipartite', ['../a00531.html#ga34cfdf825ec570a58d7a21d43f563d37', 1, 'lemon']]],\n ['bipartitepartitions_60', ['bipartitePartitions', ['../a00531.html#gad81d34916b67ad671007e594bbbb9a3d', 1, 'lemon']]],\n ['black_61', ['BLACK', ['../a00540.html#ga887e77777b0cdd4bd98cd8582eab747d', 1, 'lemon']]],\n@@ -199,15 +199,15 @@\n ['../a02401.html#a2cff8d3592817baa693975c17f90f271', 1, 'lemon::dim2::Box::Box(Point< T > a, Point< T > b)'],\n ['../a02401.html#a7a3358e8b1634d15a1c4cad13900b90c', 1, 'lemon::dim2::Box::Box(T l, T b, T r, T t)']\n ]],\n ['bpgraph_82', ['bpgraph', ['../a05101.html', 1, 'BpGraph'],\n ['../a05101.html#a765a0c7562c7105b2cec6a70e41d28e0', 1, 'lemon::concepts::BpGraph::BpGraph(const BpGraph &)'],\n ['../a05101.html#a37153818affe207ef444aff491e572cf', 1, 'lemon::concepts::BpGraph::BpGraph()']\n ]],\n- ['bpgraph_2eh_83', ['bpgraph.h', ['../a00494.html', 1, '']]],\n+ ['bpgraph_2eh_83', ['bpgraph.h', ['../a00482.html', 1, '']]],\n ['bpgraph_5ftypedefs_84', ['BPGRAPH_TYPEDEFS', ['../a00539.html#gac8d6365af7bc18ed8d55d0d4e752399f', 1, 'core.h']]],\n ['bpgraphcopy_85', ['bpgraphcopy', ['../a00539.html#gae401a20b699512f767015263b15d04a3', 1, 'lemon::bpGraphCopy(const From &from, To &to)'],\n ['../a02069.html', 1, 'BpGraphCopy< From, To >'],\n ['../a02069.html#a7675a18a618014ce6cb91608d11683fe', 1, 'lemon::BpGraphCopy::BpGraphCopy()']\n ]],\n ['bpgraphreader_86', ['bpgraphreader', ['../a00544.html#gac4c1c8a87aed10ee29c691b70267927d', 1, 'lemon::BpGraphReader::bpGraphReader()'],\n ['../a03133.html', 1, 'BpGraphReader< BGR >'],\n@@ -221,15 +221,15 @@\n ['../a03209.html#a39f67270f684dfcadd499b32111caa04', 1, 'lemon::BpGraphWriter::bpGraphWriter(const TBGR &graph, const char *fn)'],\n ['../a03209.html#a9e35f031f911615b2f6fb6d60ba3d992', 1, 'lemon::BpGraphWriter::bpGraphWriter(const TBGR &graph, const std::string &fn)'],\n ['../a00544.html#ga501cff32bd7af38690224e42bf85bea8', 1, 'lemon::BpGraphWriter::bpGraphWriter(const TBGR &graph, std::ostream &os)'],\n ['../a03209.html#a0b9168912b6506f044df3dc6b68a0d2c', 1, 'lemon::BpGraphWriter::BpGraphWriter(const BGR &graph, const char *fn)'],\n ['../a03209.html#a9bcb6ded882fda6a0bd45483c3146fef', 1, 'lemon::BpGraphWriter::BpGraphWriter(const BGR &graph, const std::string &fn)'],\n ['../a03209.html#a82dea74da2ecb88894b83fd8ba401840', 1, 'lemon::BpGraphWriter::BpGraphWriter(const BGR &graph, std::ostream &os=std::cout)']\n ]],\n- ['bucket_5fheap_2eh_88', ['bucket_heap.h', ['../a00326.html', 1, '']]],\n+ ['bucket_5fheap_2eh_88', ['bucket_heap.h', ['../a00215.html', 1, '']]],\n ['bucketheap_89', ['bucketheap', ['../a01833.html#abcf7763ddd0d43afde396f855310ca16', 1, 'lemon::BucketHeap::BucketHeap()'],\n ['../a01833.html', 1, 'BucketHeap< IM, MIN >']\n ]],\n ['build_90', ['build', ['../a03589.html#a9d887f6f043a4b7c3388ca7aba0b070c', 1, 'lemon::RangeIdMap::build()'],\n ['../a04273.html#a1dd9ee53316354c7bfc3e04ac7a9b763', 1, 'lemon::StaticDigraph::build(const Digraph &digraph, NodeRefMap &nodeRef, ArcRefMap &arcRef)'],\n ['../a04273.html#a2d222f9bb2f81c3cc007e11e7c650f0e', 1, 'lemon::StaticDigraph::build(int n, ArcListIterator begin, ArcListIterator end)']\n ]]\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/all_6.js", "source2": "./usr/share/doc/lemon/html/search/all_6.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,14 +1,14 @@\n var searchData = [\n ['calculatein_0', ['calculateIn', ['../a02849.html#a3b2a8b9cda4a87593c4fdfc44afa15d7', 1, 'lemon::HaoOrlin']]],\n ['calculateout_1', ['calculateOut', ['../a02849.html#ae495b2edefc81e20b797ee5b125d3955', 1, 'lemon::HaoOrlin']]],\n ['cancel_5fand_5ftighten_2', ['CANCEL_AND_TIGHTEN', ['../a02189.html#a2a3c0067e44c5ef3210a256d06c16b0fae5674d98ba6203a143cc02984415c242', 1, 'lemon::CycleCanceling']]],\n ['candidate_5flist_3', ['CANDIDATE_LIST', ['../a03889.html#a310d3a1fcfff1e099330ae372abc73c2a8d608c7bc486d1c56c7e5a5a6c6a616d', 1, 'lemon::NetworkSimplex']]],\n ['capacity_4', ['Capacity', ['../a02725.html#a772fe38595302c3bf6c4e79765a37a28', 1, 'lemon::GomoryHu']]],\n- ['capacity_5fscaling_2eh_5', ['capacity_scaling.h', ['../a00257.html', 1, '']]],\n+ ['capacity_5fscaling_2eh_5', ['capacity_scaling.h', ['../a00398.html', 1, '']]],\n ['capacitymap_6', ['capacitymap', ['../a02849.html#a10f68c1f869f7e1be967acfbd9750290', 1, 'lemon::HaoOrlin::CapacityMap'],\n ['../a04057.html#af8d2d82c6f00c1ac86ebbe9dcc664df3', 1, 'lemon::Preflow::capacityMap()'],\n ['../a03757.html#aea7f3a34741aba15ad8117abf089bf16', 1, 'lemon::MaxCardinalitySearch::capacityMap() const'],\n ['../a03757.html#a9ab99254dd7d27aa27918ca3f91e740f', 1, 'lemon::MaxCardinalitySearch::capacityMap(const CapacityMap &m)'],\n ['../a02553.html#aadbc97fe7fb4aa76938a1741b34b20fb', 1, 'lemon::EdmondsKarp::capacityMap()'],\n ['../a04057.html#a9eeec06f304c4b0e7ec59d26ea8698a6', 1, 'lemon::Preflow::CapacityMap'],\n ['../a04053.html#a10f68c1f869f7e1be967acfbd9750290', 1, 'lemon::PreflowDefaultTraits::CapacityMap'],\n@@ -27,16 +27,16 @@\n ['capacityscalingdefaulttraits_9', ['CapacityScalingDefaultTraits', ['../a01849.html', 1, 'lemon']]],\n ['cardinality_10', ['cardinality', ['../a03757.html#ae11005bacf44368f126b50b4255eaf08', 1, 'lemon::MaxCardinalitySearch']]],\n ['cardinalitymap_11', ['cardinalitymap', ['../a03757.html#af21a0db9502860cbc423a9a7b48f67f1', 1, 'lemon::MaxCardinalitySearch::cardinalityMap(CardinalityMap &m)'],\n ['../a03757.html#a8b98e3d533ef4b6547d795c14b817eaa', 1, 'lemon::MaxCardinalitySearch::cardinalityMap() const'],\n ['../a03729.html#ad6b1960c7ece31acf8c7aab3f8b17054', 1, 'lemon::MaxCardinalitySearchDefaultTraits::CardinalityMap'],\n ['../a03757.html#a1d78c2f9734e01d062d4ba5c86be166b', 1, 'lemon::MaxCardinalitySearch::CardinalityMap']\n ]],\n- ['cbc_2ecc_12', ['cbc.cc', ['../a00332.html', 1, '']]],\n- ['cbc_2eh_13', ['cbc.h', ['../a00368.html', 1, '']]],\n+ ['cbc_2ecc_12', ['cbc.cc', ['../a00209.html', 1, '']]],\n+ ['cbc_2eh_13', ['cbc.h', ['../a00428.html', 1, '']]],\n ['cbcmip_14', ['cbcmip', ['../a01869.html#a04420c67edf64119f3df6b79cc7e705d', 1, 'lemon::CbcMip::CbcMip(const CbcMip &)'],\n ['../a01869.html#ab1ff7c7f55a6ae5f87eeebe0d5a1421c', 1, 'lemon::CbcMip::CbcMip()'],\n ['../a01869.html', 1, 'CbcMip']\n ]],\n ['changeblue_15', ['changeBlue', ['../a03325.html#a7bdc15f10072d20f21bda91a1904c4f5', 1, 'lemon::ListBpGraph']]],\n ['changered_16', ['changeRed', ['../a03325.html#a58b745cb55d320050af95b578fb4c2d5', 1, 'lemon::ListBpGraph']]],\n ['changes_17', ['Graph Related Name Changes', ['../a11513.html#migration-graph', 1, '']]],\n@@ -50,23 +50,23 @@\n ['checkconcept_25', ['checkConcept', ['../a00554.html#a9b081cf2fafb2e6a4b7bd0008a1cee82', 1, 'lemon']]],\n ['checkedinit_26', ['checkedInit', ['../a02553.html#aaecaa382881804e00b0eac86601f6323', 1, 'lemon::EdmondsKarp']]],\n ['checkedstart_27', ['checkedStart', ['../a01657.html#a3bc557223ef2af001c022580f9c8e18c', 1, 'lemon::BellmanFord']]],\n ['checkedtopologicalsort_28', ['checkedTopologicalSort', ['../a00531.html#gaecf3c9cc5a2a58bc422f558c279d16ea', 1, 'lemon']]],\n ['checkflow_29', ['checkFlow', ['../a01881.html#af5b5cd93b7fa9062f867b788c40d79a5', 1, 'lemon::Circulation']]],\n ['checkpath_30', ['checkPath', ['../a00518.html#ga14ac7dbe0ce23d033936640b93f652f5', 1, 'lemon']]],\n ['checkplanarity_31', ['checkPlanarity', ['../a00532.html#ga1dcd3bb097a2b61d7d32f931966898ad', 1, 'lemon']]],\n- ['christofides_5ftsp_2eh_32', ['christofides_tsp.h', ['../a00248.html', 1, '']]],\n+ ['christofides_5ftsp_2eh_32', ['christofides_tsp.h', ['../a00386.html', 1, '']]],\n ['christofidestsp_33', ['christofidestsp', ['../a01873.html#af589c2ff4400edf3892b073908b01f19', 1, 'lemon::ChristofidesTsp::ChristofidesTsp()'],\n ['../a01873.html', 1, 'ChristofidesTsp< CM >']\n ]],\n ['circle_34', ['CIRCLE', ['../a02745.html#a30c21e7556892045cb4f5553dcc47ef7aa79c827759ea48f0735386c4b1188911', 1, 'lemon::GraphToEps']]],\n ['circulation_35', ['circulation', ['../a01881.html#a766fcc516e43681f77caad90d5e73913', 1, 'lemon::Circulation::Circulation()'],\n ['../a01881.html', 1, 'Circulation< GR, LM, UM, SM, TR >']\n ]],\n- ['circulation_2eh_36', ['circulation.h', ['../a00371.html', 1, '']]],\n+ ['circulation_2eh_36', ['circulation.h', ['../a00182.html', 1, '']]],\n ['circulation_3c_20digraph_2c_20lowermap_2c_20uppermap_2c_20supplymap_2c_20setelevatortraits_3c_20t_20_3e_20_3e_37', ['Circulation< Digraph, LowerMap, UpperMap, SupplyMap, SetElevatorTraits< T > >', ['../a01881.html', 1, 'lemon']]],\n ['circulation_3c_20digraph_2c_20lowermap_2c_20uppermap_2c_20supplymap_2c_20setflowmaptraits_3c_20t_20_3e_20_3e_38', ['Circulation< Digraph, LowerMap, UpperMap, SupplyMap, SetFlowMapTraits< T > >', ['../a01881.html', 1, 'lemon']]],\n ['circulation_3c_20digraph_2c_20lowermap_2c_20uppermap_2c_20supplymap_2c_20setstandardelevatortraits_3c_20t_20_3e_20_3e_39', ['Circulation< Digraph, LowerMap, UpperMap, SupplyMap, SetStandardElevatorTraits< T > >', ['../a01881.html', 1, 'lemon']]],\n ['circulationdefaulttraits_40', ['CirculationDefaultTraits', ['../a01877.html', 1, 'lemon']]],\n ['class_20and_20instance_20member_20variables_20auto_20variables_41', ['Class and instance member variables, auto variables', ['../a11510.html#cs-loc-var', 1, '']]],\n ['class_20template_20parameters_42', ['Named Class Template Parameters', ['../a11515.html#named-templ-param', 1, '']]],\n ['classes_43', ['Traits Classes', ['../a11515.html#traits-classes', 1, '']]],\n@@ -136,15 +136,15 @@\n ['../a03405.html#a38849c6374b48029aa2b210da9f116b5', 1, 'lemon::LpSolver::cloneSolver()'],\n ['../a01869.html#a827db15e4061ec6ca2b47fbb3770e31d', 1, 'lemon::CbcMip::cloneSolver()'],\n ['../a02717.html#af5a1c320c6ae9fc1f0284e2718b59ef6', 1, 'lemon::GlpkLp::cloneSolver()'],\n ['../a02185.html#ae3c6634a04ffc4d83c1c6e7226199b3f', 1, 'lemon::CplexMip::cloneSolver()'],\n ['../a02181.html#a8ba274ae502aef2945f5964128523c4d', 1, 'lemon::CplexLp::cloneSolver()'],\n ['../a01909.html#aaa8694657547bc0325609991b0074d46', 1, 'lemon::ClpLp::cloneSolver()']\n ]],\n- ['clp_2eh_61', ['clp.h', ['../a00179.html', 1, '']]],\n+ ['clp_2eh_61', ['clp.h', ['../a00236.html', 1, '']]],\n ['clpcol_62', ['clpCol', ['../a01909.html#a23d501ffaf0d1d080de1370114b70495', 1, 'lemon::ClpLp']]],\n ['clplp_63', ['clplp', ['../a01909.html#af9667a2a88853c4be96b0c2e19416ad2', 1, 'lemon::ClpLp::ClpLp()'],\n ['../a01909.html#a89f91b42af43524791c4c73c6f377a79', 1, 'lemon::ClpLp::ClpLp(const ClpLp &)'],\n ['../a01909.html', 1, 'ClpLp']\n ]],\n ['clprow_64', ['clpRow', ['../a01909.html#ac8fdd2698860337a112bdce3f4b78b9f', 1, 'lemon::ClpLp']]],\n ['coding_20style_65', ['LEMON Coding Style', ['../a11510.html', 1, '']]],\n@@ -185,16 +185,16 @@\n ['../a03341.html#a926a85f6e1fc4ef4dc9d82dfdf41a954', 1, 'lemon::LpBase::colName(Col c, const std::string &name)']\n ]],\n ['color_76', ['color', ['../a04049.html#a9bb8452c64e6f3d0b24c483e0bac90b0', 1, 'lemon::PlanarColoring::color()'],\n ['../a01913.html#ac975f1207e7e7caacde357dfea1369c8', 1, 'lemon::Color::Color(double r, double g, double b)'],\n ['../a01913.html#a1589b83974b42a2f3315624f14c3c92c', 1, 'lemon::Color::Color()'],\n ['../a01913.html', 1, 'Color']\n ]],\n- ['color_2ecc_77', ['color.cc', ['../a00173.html', 1, '']]],\n- ['color_2eh_78', ['color.h', ['../a00317.html', 1, '']]],\n+ ['color_2ecc_77', ['color.cc', ['../a00425.html', 1, '']]],\n+ ['color_2eh_78', ['color.h', ['../a00221.html', 1, '']]],\n ['colorindex_79', ['colorIndex', ['../a04049.html#a4938ed17a7b8d9af65da60932386f900', 1, 'lemon::PlanarColoring']]],\n ['colorindexmap_80', ['colorIndexMap', ['../a04049.html#aa1b676e03ff270492358f953540aa4db', 1, 'lemon::PlanarColoring']]],\n ['colormap_81', ['colormap', ['../a04049.html#a464f44e32ceda9bf39a2cb84793b9925', 1, 'lemon::PlanarColoring::colorMap() const'],\n ['../a04049.html#a617c5c71f1fe86ac4a17a7410ba0d5f6', 1, 'lemon::PlanarColoring::ColorMap']\n ]],\n ['colstatus_82', ['colStatus', ['../a03405.html#a72e334b401535af5716766c50d113fa0', 1, 'lemon::LpSolver']]],\n ['coltype_83', ['coltype', ['../a03409.html#aa7e3fcdb8e8840d5a4ce7a74a143de8c', 1, 'lemon::MipSolver::colType(Col c, ColTypes col_type)'],\n@@ -233,27 +233,27 @@\n ['../a00517.html#gac36b354e8e808fba48e18cf15db5100f', 1, 'lemon::ComposeMap::composeMap(const M1 &m1, const M2 &m2)'],\n ['../a03457.html#aff637d186f992a6d4e8c16d29b8eb7f2', 1, 'lemon::ComposeMap::ComposeMap(const M1 &m1, const M2 &m2)']\n ]],\n ['conarcit_92', ['conarcit', ['../a02089.html', 1, 'ConArcIt< GR >'],\n ['../a02089.html#a0a41f45a3e529803047fbd033522a2aa', 1, 'lemon::ConArcIt::ConArcIt(const GR &g, Arc a)'],\n ['../a02089.html#a77d03dd52dcaad7b393c1efbbab63602', 1, 'lemon::ConArcIt::ConArcIt(const GR &g, Node u, Node v)']\n ]],\n- ['concept_5fcheck_2eh_93', ['concept_check.h', ['../a00347.html', 1, '']]],\n+ ['concept_5fcheck_2eh_93', ['concept_check.h', ['../a00173.html', 1, '']]],\n ['concepts_94', ['concepts', ['../a00548.html', 1, 'Concepts'],\n ['../a00549.html', 1, 'Graph Structure Concepts'],\n ['../a00550.html', 1, 'Map Concepts']\n ]],\n ['conedgeit_95', ['conedgeit', ['../a02101.html', 1, 'ConEdgeIt< GR >'],\n ['../a02101.html#a09282f7895a4ec3cd5211ece130c8762', 1, 'lemon::ConEdgeIt::ConEdgeIt(const GR &g, Node u, Node v)'],\n ['../a02101.html#a66878cccb947904847f417dfdc9de3f5', 1, 'lemon::ConEdgeIt::ConEdgeIt(const GR &g, Edge e)']\n ]],\n ['connected_96', ['connected', ['../a00531.html#ga7f42d801bea8ab57b6c28f03faeff38c', 1, 'lemon']]],\n ['connectedcomponents_97', ['connectedComponents', ['../a00531.html#gadf73dc53d6597e9046277108715c4849', 1, 'lemon']]],\n ['connectivity_20and_20other_20graph_20properties_98', ['Connectivity and Other Graph Properties', ['../a00531.html', 1, '']]],\n- ['connectivity_2eh_99', ['connectivity.h', ['../a00305.html', 1, '']]],\n+ ['connectivity_2eh_99', ['connectivity.h', ['../a00233.html', 1, '']]],\n ['constants_20macros_100', ['Constants, Macros', ['../a11510.html#cs-funcs', 1, '']]],\n ['constcoeffit_101', ['constcoeffit', ['../a03385.html', 1, 'LpBase::DualExpr::ConstCoeffIt'],\n ['../a03385.html#a906f76a122f4e52776d7f108a8bfabed', 1, 'lemon::LpBase::DualExpr::ConstCoeffIt::ConstCoeffIt()'],\n ['../a03369.html#ad50df4e747412a8515c4ed98e63d6f95', 1, 'lemon::LpBase::Expr::ConstCoeffIt::ConstCoeffIt()'],\n ['../a03369.html', 1, 'LpBase::Expr::ConstCoeffIt']\n ]],\n ['constmap_102', ['constmap', ['../a00515.html#ga16ec5e6f4258e1da61b9c297f97cebbc', 1, 'lemon::ConstMap::constMap()'],\n@@ -302,15 +302,15 @@\n ['../a03473.html', 1, 'ConvertMap< M, V >']\n ]],\n ['coords_123', ['coords', ['../a04041.html#a1ec58f7202c5bb0e84561fc552c17427', 1, 'lemon::PlanarDrawing::coords()'],\n ['../a02745.html#ab6e6cfe43559e8d7f45eac7633c9b208', 1, 'lemon::GraphToEps::coords()']\n ]],\n ['copypath_124', ['copyPath', ['../a00518.html#ga3f5708031ae65849c68fd07cd379ff64', 1, 'lemon']]],\n ['copyright_125', ['copyright', ['../a02745.html#a457b6a860933fd7aec65b7219f6ee0a9', 1, 'lemon::GraphToEps']]],\n- ['core_2eh_126', ['core.h', ['../a00329.html', 1, '']]],\n+ ['core_2eh_126', ['core.h', ['../a00263.html', 1, '']]],\n ['cost_127', ['cost', ['../a02853.html#ac9e9deaccf259b5931d867b0790c1e01', 1, 'lemon::HartmannOrlinMmcDefaultTraits::Cost'],\n ['../a03917.html#a1a1dfba092aeec4656ebceaf99ca8b22', 1, 'lemon::Opt2Tsp::Cost'],\n ['../a03889.html#adeb81a88e6bbaf933ca20ea3bbba7a2c', 1, 'lemon::NetworkSimplex::Cost'],\n ['../a03885.html#a1a1dfba092aeec4656ebceaf99ca8b22', 1, 'lemon::NearestNeighborTsp::Cost'],\n ['../a02969.html#a9142822eba184f2778b6aac70b0900b3', 1, 'lemon::KarpMmc::Cost'],\n ['../a02961.html#ac9e9deaccf259b5931d867b0790c1e01', 1, 'lemon::KarpMmcDefaultTraits::Cost'],\n ['../a02893.html#a9142822eba184f2778b6aac70b0900b3', 1, 'lemon::HowardMmc::Cost'],\n@@ -323,15 +323,15 @@\n ['../a02189.html#adeb81a88e6bbaf933ca20ea3bbba7a2c', 1, 'lemon::CycleCanceling::Cost'],\n ['../a02937.html#a1a1dfba092aeec4656ebceaf99ca8b22', 1, 'lemon::InsertionTsp::Cost'],\n ['../a02137.html#a9142822eba184f2778b6aac70b0900b3', 1, 'lemon::CostScaling::Cost'],\n ['../a02129.html#adeb81a88e6bbaf933ca20ea3bbba7a2c', 1, 'lemon::CostScalingDefaultTraits::Cost']\n ]],\n ['cost_20flow_20algorithms_128', ['Minimum Cost Flow Algorithms', ['../a00527.html', 1, '']]],\n ['cost_20flow_20problem_129', ['Minimum Cost Flow Problem', ['../a11514.html', 1, '']]],\n- ['cost_5fscaling_2eh_130', ['cost_scaling.h', ['../a00290.html', 1, '']]],\n+ ['cost_5fscaling_2eh_130', ['cost_scaling.h', ['../a00260.html', 1, '']]],\n ['costmap_131', ['costmap', ['../a02937.html#a0e4fe3b3bd126f464294f661c36a61d5', 1, 'lemon::InsertionTsp::CostMap'],\n ['../a03917.html#a0e4fe3b3bd126f464294f661c36a61d5', 1, 'lemon::Opt2Tsp::CostMap'],\n ['../a03885.html#a0e4fe3b3bd126f464294f661c36a61d5', 1, 'lemon::NearestNeighborTsp::CostMap'],\n ['../a03805.html#a4394ecf7ca38a61b918f4e4ff3d3c9c7', 1, 'lemon::MinCostArborescence::CostMap'],\n ['../a02861.html#a3a2252844f4d7748442eb48a6907f379', 1, 'lemon::HartmannOrlinMmc::CostMap'],\n ['../a01873.html#a0e4fe3b3bd126f464294f661c36a61d5', 1, 'lemon::ChristofidesTsp::CostMap'],\n ['../a03801.html#a0e4fe3b3bd126f464294f661c36a61d5', 1, 'lemon::MinCostArborescenceDefaultTraits::CostMap'],\n@@ -359,25 +359,25 @@\n ['countconnectedcomponents_140', ['countConnectedComponents', ['../a00531.html#ga5a7ee4d6c2c14a576bd532325185385e', 1, 'lemon']]],\n ['countedges_141', ['countEdges', ['../a00539.html#ga8dcba7389059e364d998ee35a7c0408f', 1, 'lemon']]],\n ['counter_142', ['counter', ['../a02161.html#ae1666ee5f8d8cf588500c65a9935c4fe', 1, 'lemon::Counter::Counter()'],\n ['../a02161.html#a837a4f6c542af203bc3b5d49d0288220', 1, 'lemon::Counter::Counter(std::string title, std::ostream &os=std::cerr)'],\n ['../a02161.html#ab3194596a4d3b2fa5630e036feff4897', 1, 'lemon::Counter::Counter(const char *title, std::ostream &os=std::cerr)'],\n ['../a02161.html', 1, 'Counter']\n ]],\n- ['counter_2eh_143', ['counter.h', ['../a00206.html', 1, '']]],\n+ ['counter_2eh_143', ['counter.h', ['../a00245.html', 1, '']]],\n ['countinarcs_144', ['countInArcs', ['../a00539.html#ga4acb827f328d3c5ac9fd96c005b33be7', 1, 'lemon']]],\n ['countincedges_145', ['countIncEdges', ['../a00539.html#ga87b39b7ad49f28beb564897ee41828a0', 1, 'lemon']]],\n ['counting_146', ['Time Measuring and Counting', ['../a00541.html', 1, '']]],\n ['countitems_147', ['countItems', ['../a00539.html#gacec0859f6750f015c330c4f85988f88b', 1, 'lemon']]],\n ['countnodes_148', ['countNodes', ['../a00539.html#ga047e651627589e1a388afc2596ba8470', 1, 'lemon']]],\n ['countoutarcs_149', ['countOutArcs', ['../a00539.html#ga287df023ad7d8020e04327616d9158ae', 1, 'lemon']]],\n ['countrednodes_150', ['countRedNodes', ['../a00539.html#ga925b7808ac3750e41d00276f49d68088', 1, 'lemon']]],\n ['countstronglyconnectedcomponents_151', ['countStronglyConnectedComponents', ['../a00531.html#gac672c0d24a138fe712f3fd95455a685d', 1, 'lemon']]],\n- ['cplex_2ecc_152', ['cplex.cc', ['../a00170.html', 1, '']]],\n- ['cplex_2eh_153', ['cplex.h', ['../a00407.html', 1, '']]],\n+ ['cplex_2ecc_152', ['cplex.cc', ['../a00305.html', 1, '']]],\n+ ['cplex_2eh_153', ['cplex.h', ['../a00350.html', 1, '']]],\n ['cplexbase_154', ['CplexBase', ['../a02177.html', 1, 'lemon']]],\n ['cplexenv_155', ['cplexenv', ['../a02169.html#a02bd581bb5b04ed7f68844e497d8c5f5', 1, 'lemon::CplexEnv::CplexEnv()'],\n ['../a02169.html', 1, 'CplexEnv'],\n ['../a02177.html#a70dc05eac98ea64784a9215191f7cf68', 1, 'lemon::CplexBase::cplexEnv() const'],\n ['../a02177.html#a27c7ee84e90d743baa2c06d27721d47f', 1, 'lemon::CplexBase::cplexEnv()'],\n ['../a02169.html#a55676c8bcdd5d6168efe436cc8cdc47e', 1, 'lemon::CplexEnv::CplexEnv()']\n ]],\n@@ -468,15 +468,15 @@\n ['../a02969.html#a257ea3e45b5464c64f8b1bb7f50154a6', 1, 'lemon::KarpMmc::cycle(Path &path)'],\n ['../a02893.html#a9a4078b5fc151a309f7261e55fa62742', 1, 'lemon::HowardMmc::cycle() const'],\n ['../a02893.html#ae38d603c7fe22786733329da1913829d', 1, 'lemon::HowardMmc::cycle(Path &path)'],\n ['../a02861.html#a9a4078b5fc151a309f7261e55fa62742', 1, 'lemon::HartmannOrlinMmc::cycle() const'],\n ['../a02861.html#a0943d8873b55502fe9dbc55811414b0c', 1, 'lemon::HartmannOrlinMmc::cycle(Path &path)']\n ]],\n ['cycle_20algorithms_178', ['Minimum Mean Cycle Algorithms', ['../a00529.html', 1, '']]],\n- ['cycle_5fcanceling_2eh_179', ['cycle_canceling.h', ['../a00311.html', 1, '']]],\n+ ['cycle_5fcanceling_2eh_179', ['cycle_canceling.h', ['../a00401.html', 1, '']]],\n ['cyclecanceling_180', ['cyclecanceling', ['../a02189.html#a9781d9ac0d763defc63815da06b4b2b2', 1, 'lemon::CycleCanceling::CycleCanceling()'],\n ['../a02189.html', 1, 'CycleCanceling< GR, V, C >']\n ]],\n ['cyclecost_181', ['cyclecost', ['../a02861.html#a30321d7a2f44b73b067ffc64caa321c2', 1, 'lemon::HartmannOrlinMmc::cycleCost()'],\n ['../a02893.html#a30321d7a2f44b73b067ffc64caa321c2', 1, 'lemon::HowardMmc::cycleCost()'],\n ['../a02969.html#a30321d7a2f44b73b067ffc64caa321c2', 1, 'lemon::KarpMmc::cycleCost()']\n ]],\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/all_7.js", "source2": "./usr/share/doc/lemon/html/search/all_7.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -39,15 +39,15 @@\n ['degree_5fbased_14', ['DEGREE_BASED', ['../a02829.html#a434cb6429f314a1e6ea1c4f2d262708ea52018f7611e838b47b98efd925e7b7a4', 1, 'lemon::GrossoLocatelliPullanMc']]],\n ['demo_20programs_15', ['Demo Programs', ['../a00552.html', 1, '']]],\n ['dfs_16', ['dfs', ['../a02201.html#a77e8d05a88fdbd6eadbc7b562e642c22', 1, 'lemon::Dfs::Dfs()'],\n ['../a02201.html', 1, 'Dfs< GR, TR >'],\n ['../a00523.html#gad956435c359a9ccea7486c1785f936b0', 1, 'lemon::dfs(const GR &digraph)']\n ]],\n ['dfs_20and_20dijkstra_17', ['BFS, DFS and Dijkstra', ['../a11513.html#migration-search', 1, '']]],\n- ['dfs_2eh_18', ['dfs.h', ['../a00353.html', 1, '']]],\n+ ['dfs_2eh_18', ['dfs.h', ['../a00287.html', 1, '']]],\n ['dfs_3c_20digraph_2c_20setdistmaptraits_3c_20t_20_3e_20_3e_19', ['Dfs< Digraph, SetDistMapTraits< T > >', ['../a02201.html', 1, 'lemon']]],\n ['dfs_3c_20digraph_2c_20setpredmaptraits_3c_20t_20_3e_20_3e_20', ['Dfs< Digraph, SetPredMapTraits< T > >', ['../a02201.html', 1, 'lemon']]],\n ['dfs_3c_20digraph_2c_20setprocessedmaptraits_3c_20t_20_3e_20_3e_21', ['Dfs< Digraph, SetProcessedMapTraits< T > >', ['../a02201.html', 1, 'lemon']]],\n ['dfs_3c_20digraph_2c_20setreachedmaptraits_3c_20t_20_3e_20_3e_22', ['Dfs< Digraph, SetReachedMapTraits< T > >', ['../a02201.html', 1, 'lemon']]],\n ['dfs_3c_20digraph_2c_20setstandardprocessedmaptraits_20_3e_23', ['Dfs< Digraph, SetStandardProcessedMapTraits >', ['../a02201.html', 1, 'lemon']]],\n ['dfsdefaulttraits_24', ['DfsDefaultTraits', ['../a02197.html', 1, 'lemon']]],\n ['dfsvisit_25', ['dfsvisit', ['../a02285.html', 1, 'DfsVisit< GR, VS, TR >'],\n@@ -68,15 +68,15 @@\n ['../a02249.html', 1, 'DfsWizardBase< GR >']\n ]],\n ['dfswizarddefaulttraits_33', ['DfsWizardDefaultTraits', ['../a02245.html', 1, 'lemon']]],\n ['dheap_34', ['dheap', ['../a02297.html', 1, 'DHeap< PR, IM, D, CMP >'],\n ['../a02297.html#abbb33a0ea233dc441aedd789fb1efd6e', 1, 'lemon::DHeap::DHeap(ItemIntMap &map)'],\n ['../a02297.html#a6618ea81351d87286749d5c00ecba04a', 1, 'lemon::DHeap::DHeap(ItemIntMap &map, const Compare &comp)']\n ]],\n- ['dheap_2eh_35', ['dheap.h', ['../a00302.html', 1, '']]],\n+ ['dheap_2eh_35', ['dheap.h', ['../a00284.html', 1, '']]],\n ['diamond_36', ['DIAMOND', ['../a02745.html#a30c21e7556892045cb4f5553dcc47ef7a714f2cc5c292a305e2da3c03bd63916a', 1, 'lemon::GraphToEps']]],\n ['dieulerit_37', ['dieulerit', ['../a02585.html', 1, 'DiEulerIt< GR >'],\n ['../a02585.html#a10a5924de31338bf99468ca7b1ea9156', 1, 'lemon::DiEulerIt::DiEulerIt()']\n ]],\n ['different_38', ['different', ['../a04341.html#a3347b4c48c20385af1e0a3bcae825a70', 1, 'lemon::Tolerance::different()'],\n ['../a04345.html#a481baf2480ba3bbd8d6b84f883e8b782', 1, 'lemon::Tolerance< float >::different()'],\n ['../a04349.html#a481baf2480ba3bbd8d6b84f883e8b782', 1, 'lemon::Tolerance< double >::different()'],\n@@ -132,15 +132,15 @@\n ['../a01801.html#aa6928feef02be4f2a184775d19dc6373', 1, 'lemon::BfsVisit::Digraph'],\n ['../a01849.html#af108349b07bd3b361cfa1387c19395ac', 1, 'lemon::CapacityScalingDefaultTraits::Digraph'],\n ['../a01853.html#a750f38b47fd56ef715849c3bd77fbe77', 1, 'lemon::CapacityScaling::Digraph'],\n ['../a01877.html#af108349b07bd3b361cfa1387c19395ac', 1, 'lemon::CirculationDefaultTraits::Digraph'],\n ['../a01881.html#aa6928feef02be4f2a184775d19dc6373', 1, 'lemon::Circulation::Digraph'],\n ['../a02105.html#af108349b07bd3b361cfa1387c19395ac', 1, 'lemon::DynArcLookUp::Digraph']\n ]],\n- ['digraph_2eh_40', ['digraph.h', ['../a00485.html', 1, '']]],\n+ ['digraph_2eh_40', ['digraph.h', ['../a00494.html', 1, '']]],\n ['digraph_5ftypedefs_41', ['DIGRAPH_TYPEDEFS', ['../a00539.html#gac618f30ace596c69836144bfdcc9112c', 1, 'core.h']]],\n ['digraphcopy_42', ['digraphcopy', ['../a00539.html#ga37e26a15e74ca108c8036ef3bf50d005', 1, 'lemon::digraphCopy()'],\n ['../a02057.html#a446ab15561f3b8ed021eb010e9e53ef6', 1, 'lemon::DigraphCopy::DigraphCopy()'],\n ['../a02057.html', 1, 'DigraphCopy< From, To >']\n ]],\n ['digraphreader_43', ['digraphreader', ['../a03125.html', 1, 'DigraphReader< DGR >'],\n ['../a03125.html#aa4f1971218572095cd881516767c8cf3', 1, 'lemon::DigraphReader::DigraphReader(DGR &digraph, std::istream &is=std::cin)'],\n@@ -159,15 +159,15 @@\n ['../a03201.html#a3ee5445ac5f1f877cc947ae7acc609fb', 1, 'lemon::DigraphWriter::DigraphWriter(const DGR &digraph, const std::string &fn)']\n ]],\n ['dijkstra_45', ['dijkstra', ['../a11513.html#migration-search', 1, 'BFS, DFS and Dijkstra'],\n ['../a02309.html#a58fc0895a271a1aa712f66aaf3425b12', 1, 'lemon::Dijkstra::Dijkstra()'],\n ['../a00524.html#gae3f8e74609169fe8f66fb247446753bd', 1, 'lemon::dijkstra(const GR &digraph, const LEN &length)'],\n ['../a02309.html', 1, 'Dijkstra< GR, LEN, TR >']\n ]],\n- ['dijkstra_2eh_46', ['dijkstra.h', ['../a00242.html', 1, '']]],\n+ ['dijkstra_2eh_46', ['dijkstra.h', ['../a00344.html', 1, '']]],\n ['dijkstra_3c_20digraph_2c_20lengthmap_2c_20setdistmaptraits_3c_20t_20_3e_20_3e_47', ['Dijkstra< Digraph, LengthMap, SetDistMapTraits< T > >', ['../a02309.html', 1, 'lemon']]],\n ['dijkstra_3c_20digraph_2c_20lengthmap_2c_20setheaptraits_3c_20h_2c_20typename_20digraph_3a_3atemplate_20nodemap_3c_20int_20_3e_20_3e_20_3e_48', ['Dijkstra< Digraph, LengthMap, SetHeapTraits< H, typename Digraph::template NodeMap< int > > >', ['../a02309.html', 1, 'lemon']]],\n ['dijkstra_3c_20digraph_2c_20lengthmap_2c_20setoperationtraitstraits_3c_20t_20_3e_20_3e_49', ['Dijkstra< Digraph, LengthMap, SetOperationTraitsTraits< T > >', ['../a02309.html', 1, 'lemon']]],\n ['dijkstra_3c_20digraph_2c_20lengthmap_2c_20setpredmaptraits_3c_20t_20_3e_20_3e_50', ['Dijkstra< Digraph, LengthMap, SetPredMapTraits< T > >', ['../a02309.html', 1, 'lemon']]],\n ['dijkstra_3c_20digraph_2c_20lengthmap_2c_20setprocessedmaptraits_3c_20t_20_3e_20_3e_51', ['Dijkstra< Digraph, LengthMap, SetProcessedMapTraits< T > >', ['../a02309.html', 1, 'lemon']]],\n ['dijkstra_3c_20digraph_2c_20lengthmap_2c_20setstandardheaptraits_3c_20h_2c_20typename_20digraph_3a_3atemplate_20nodemap_3c_20int_20_3e_20_3e_20_3e_52', ['Dijkstra< Digraph, LengthMap, SetStandardHeapTraits< H, typename Digraph::template NodeMap< int > > >', ['../a02309.html', 1, 'lemon']]],\n ['dijkstra_3c_20digraph_2c_20lengthmap_2c_20setstandardprocessedmaptraits_20_3e_53', ['Dijkstra< Digraph, LengthMap, SetStandardProcessedMapTraits >', ['../a02309.html', 1, 'lemon']]],\n@@ -179,19 +179,19 @@\n ['../a02377.html#af83a6b7a96934b5c0efe73294f5d9412', 1, 'lemon::DijkstraWizard::DijkstraWizard(const TR &b)']\n ]],\n ['dijkstrawizardbase_57', ['dijkstrawizardbase', ['../a02373.html', 1, 'DijkstraWizardBase< GR, LEN >'],\n ['../a02373.html#a33295db5ac017fd3f4aabbabb356973f', 1, 'lemon::DijkstraWizardBase::DijkstraWizardBase()'],\n ['../a02373.html#afb8afa8f01b04960d3177cbd0568713e', 1, 'lemon::DijkstraWizardBase::DijkstraWizardBase(const GR &g, const LEN &l)']\n ]],\n ['dijkstrawizarddefaulttraits_58', ['DijkstraWizardDefaultTraits', ['../a02369.html', 1, 'lemon']]],\n- ['dim2_2eh_59', ['dim2.h', ['../a00281.html', 1, '']]],\n+ ['dim2_2eh_59', ['dim2.h', ['../a00314.html', 1, '']]],\n ['dimacs_20format_60', ['DIMACS Format', ['../a00546.html', 1, '']]],\n ['dimacs_2dsolver_2ecc_61', ['dimacs-solver.cc', ['../a00503.html', 1, '']]],\n ['dimacs_2dto_2dlgf_2ecc_62', ['dimacs-to-lgf.cc', ['../a00500.html', 1, '']]],\n- ['dimacs_2eh_63', ['dimacs.h', ['../a00251.html', 1, '']]],\n+ ['dimacs_2eh_63', ['dimacs.h', ['../a00197.html', 1, '']]],\n ['dimacsdescriptor_64', ['dimacsdescriptor', ['../a02425.html', 1, 'DimacsDescriptor'],\n ['../a02425.html#abb1aab8d4a78dbac2c1c69fccf3b337e', 1, 'lemon::DimacsDescriptor::DimacsDescriptor()']\n ]],\n ['dimacstype_65', ['dimacsType', ['../a00546.html#ga26df906d8afc5f2a00998f0c0d93934d', 1, 'lemon']]],\n ['dimension_66', ['dimension', ['../a02929.html#afa3db02dd8370219ac34c28d6d7d74e0', 1, 'lemon::HypercubeGraph::dimension(Edge edge) const'],\n ['../a02929.html#a510a87518ab1d5a4e7cbafb0fbedaa22', 1, 'lemon::HypercubeGraph::dimension() const'],\n ['../a02929.html#a7ca2309693275af5902759b9f63c5db4', 1, 'lemon::HypercubeGraph::dimension(Arc arc) const']\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/all_8.js", "source2": "./usr/share/doc/lemon/html/search/all_8.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -18,15 +18,15 @@\n ['../a03129.html#ade8c9693152a343dde877fd2558d69a6', 1, 'lemon::GraphReader::edge()'],\n ['../a03133.html#ac278400d7657fc24f505961daebe6b16', 1, 'lemon::BpGraphReader::edge()'],\n ['../a03205.html#a2041f229c8652897b70d26ebfd2f7a66', 1, 'lemon::GraphWriter::edge()'],\n ['../a03209.html#a77e17167cd0b023bac8257742ee7b955', 1, 'lemon::BpGraphWriter::edge()'],\n ['../a05233.html', 1, 'Graph::Edge'],\n ['../a05129.html', 1, 'BpGraph::Edge']\n ]],\n- ['edge_5fset_2eh_2', ['edge_set.h', ['../a00191.html', 1, '']]],\n+ ['edge_5fset_2eh_2', ['edge_set.h', ['../a00407.html', 1, '']]],\n ['edgecolors_3', ['edgeColors', ['../a02745.html#a547c3819d4733117d7cfccba78abd191', 1, 'lemon::GraphToEps']]],\n ['edgecrossref_4', ['edgecrossref', ['../a02061.html#ab16cf0b2e43600c501165048d8ff342c', 1, 'lemon::GraphCopy::edgeCrossRef()'],\n ['../a02069.html#a2836cce1325fae5478661434f024317a', 1, 'lemon::BpGraphCopy::edgeCrossRef()']\n ]],\n ['edgefiltermap_5', ['edgefiltermap', ['../a01489.html#ac2f0212f10cc7aa26b76d2a113e963c6', 1, 'lemon::SubGraph::EdgeFilterMap'],\n ['../a01505.html#ac2f0212f10cc7aa26b76d2a113e963c6', 1, 'lemon::FilterEdges::EdgeFilterMap']\n ]],\n@@ -86,15 +86,15 @@\n ['../a03205.html#a1273872471c24814e69780fe48faacd4', 1, 'lemon::GraphWriter::edges()'],\n ['../a03209.html#a5d7a13f3cfa42c25ad040a748f2207d0', 1, 'lemon::BpGraphWriter::edges()']\n ]],\n ['edgesection_14', ['edgeSection', ['../a03141.html#af5741e8aa3b9984e1099ab15eae71766', 1, 'lemon::LgfContents']]],\n ['edgesectionnum_15', ['edgeSectionNum', ['../a03141.html#aaf881fe1bf3071bbabf056e9784cdd1e', 1, 'lemon::LgfContents']]],\n ['edgewidths_16', ['edgeWidths', ['../a02745.html#aef318d20d71c584c44c4cf9aea26a1fd', 1, 'lemon::GraphToEps']]],\n ['edgewidthscale_17', ['edgeWidthScale', ['../a02745.html#a37a0f95f249f7e10cf8961683e37daf1', 1, 'lemon::GraphToEps']]],\n- ['edmonds_5fkarp_2eh_18', ['edmonds_karp.h', ['../a00356.html', 1, '']]],\n+ ['edmonds_5fkarp_2eh_18', ['edmonds_karp.h', ['../a00311.html', 1, '']]],\n ['edmondskarp_19', ['edmondskarp', ['../a02553.html', 1, 'EdmondsKarp< GR, CAP, TR >'],\n ['../a02553.html#a23b3345b69d5205b7813bc411f36d2ae', 1, 'lemon::EdmondsKarp::EdmondsKarp()']\n ]],\n ['edmondskarp_3c_20digraph_2c_20capacitymap_2c_20setflowmaptraits_3c_20t_20_3e_20_3e_20', ['EdmondsKarp< Digraph, CapacityMap, SetFlowMapTraits< T > >', ['../a02553.html', 1, 'lemon']]],\n ['edmondskarpdefaulttraits_21', ['EdmondsKarpDefaultTraits', ['../a02549.html', 1, 'lemon']]],\n ['elevator_22', ['elevator', ['../a02565.html#aedd805b73161ff74106bb1cbb18ae976', 1, 'lemon::Elevator::Elevator(const GR &graph)'],\n ['../a02565.html#ac5d91754365aee61cba08bc0706fda0f', 1, 'lemon::Elevator::Elevator(const GR &graph, int max_level)'],\n@@ -108,15 +108,15 @@\n ['../a02605.html#a6e6b3dff15a84df4d2e8cadd6ccca007', 1, 'lemon::MaxFractionalMatching::elevator() const'],\n ['../a02605.html#a809a0a541e9bc16e5669c916e499790a', 1, 'lemon::MaxFractionalMatching::elevator(Elevator &elevator)'],\n ['../a01881.html#a6e6b3dff15a84df4d2e8cadd6ccca007', 1, 'lemon::Circulation::elevator() const'],\n ['../a01881.html#a09011773f8f82cdc74512c8c28141e21', 1, 'lemon::Circulation::elevator(Elevator &elevator)'],\n ['../a04053.html#af3390aa8ccdc072ceee447dcb2f33145', 1, 'lemon::PreflowDefaultTraits::Elevator'],\n ['../a02565.html', 1, 'Elevator< GR, Item >']\n ]],\n- ['elevator_2eh_23', ['elevator.h', ['../a00230.html', 1, '']]],\n+ ['elevator_2eh_23', ['elevator.h', ['../a00383.html', 1, '']]],\n ['ellapsed_24', ['ellapsed', ['../a04325.html#a245b051eda74a94ae527eaf97434c914', 1, 'lemon::TimeStamp']]],\n ['embedding_20and_20drawing_25', ['Planar Embedding and Drawing', ['../a00532.html', 1, '']]],\n ['embeddingmap_26', ['embeddingmap', ['../a04037.html#abb388f3f504ad4f249acea35a17a8c0c', 1, 'lemon::PlanarEmbedding::embeddingMap() const'],\n ['../a04037.html#a16408eaf7e4c1a9ee5ac1371b1eb0976', 1, 'lemon::PlanarEmbedding::EmbeddingMap']\n ]],\n ['empty_27', ['empty', ['../a01841.html#a644718bb2fb240de962dc3c9a1fdf0dc', 1, 'lemon::SimpleBucketHeap::empty()'],\n ['../a03933.html#a644718bb2fb240de962dc3c9a1fdf0dc', 1, 'lemon::Path::empty()'],\n@@ -214,16 +214,16 @@\n ]],\n ['eraseclass_45', ['eraseclass', ['../a04381.html#a2174a725c3a68a866b49d43142bc3d29', 1, 'lemon::ExtendFindEnum::eraseClass()'],\n ['../a04361.html#a9cafaae8d2a6a124f500d5cd774c10fc', 1, 'lemon::UnionFindEnum::eraseClass()']\n ]],\n ['erasefront_46', ['erasefront', ['../a03949.html#a320672c73f9043f74530d5b2e65d5f6e', 1, 'lemon::ListPath::eraseFront()'],\n ['../a03933.html#a320672c73f9043f74530d5b2e65d5f6e', 1, 'lemon::Path::eraseFront()']\n ]],\n- ['error_2eh_47', ['error.h', ['../a00278.html', 1, '']]],\n- ['euler_2eh_48', ['euler.h', ['../a00413.html', 1, '']]],\n+ ['error_2eh_47', ['error.h', ['../a00347.html', 1, '']]],\n+ ['euler_2eh_48', ['euler.h', ['../a00176.html', 1, '']]],\n ['eulerian_49', ['eulerian', ['../a00531.html#ga17cf892e13f8c03b9e7f954f54b4180e', 1, 'lemon']]],\n ['eulerit_50', ['eulerit', ['../a02589.html', 1, 'EulerIt< GR >'],\n ['../a02589.html#adeeac6d3cfe48af7b2452144c3fbf6e7', 1, 'lemon::EulerIt::EulerIt()']\n ]],\n ['even_51', ['EVEN', ['../a03685.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba8487756fbc720579906f0ae1738f0fcc', 1, 'lemon::MaxMatching']]],\n ['examine_52', ['examine', ['../a01793.html#a3656d1f80036aee1dcaa927450b70c2a', 1, 'lemon::BfsVisitor::examine()'],\n ['../a02277.html#a3656d1f80036aee1dcaa927450b70c2a', 1, 'lemon::DfsVisitor::examine()']\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/all_9.js", "source2": "./usr/share/doc/lemon/html/search/all_9.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -8,15 +8,15 @@\n ]],\n ['falsenum_2', ['falseNum', ['../a03597.html#a2e0a8387fd504c6e8c39027705433a92', 1, 'lemon::IterableBoolMap']]],\n ['farthest_3', ['FARTHEST', ['../a02937.html#a434cb6429f314a1e6ea1c4f2d262708ead73e1b65eca2da53f94a949e05a87024', 1, 'lemon::InsertionTsp']]],\n ['feasible_4', ['feasible', ['../a03409.html#a4c669cb1cb4d98dfea944e9ceec7d33ea03f919221217f95d21a593a7120165e1', 1, 'lemon::MipSolver::FEASIBLE'],\n ['../a03405.html#a4c669cb1cb4d98dfea944e9ceec7d33ea03f919221217f95d21a593a7120165e1', 1, 'lemon::LpSolver::FEASIBLE']\n ]],\n ['female_5', ['FEMALE', ['../a02745.html#a30c21e7556892045cb4f5553dcc47ef7adebb817413857eea6331734b76793159', 1, 'lemon::GraphToEps']]],\n- ['fib_5fheap_2eh_6', ['fib_heap.h', ['../a00398.html', 1, '']]],\n+ ['fib_5fheap_2eh_6', ['fib_heap.h', ['../a00296.html', 1, '']]],\n ['fibheap_7', ['fibheap', ['../a02593.html#a0e30d9a6f76348e7060c856f45183cfb', 1, 'lemon::FibHeap::FibHeap(ItemIntMap &map, const Compare &comp)'],\n ['../a02593.html#ab3f82678fc257f80edb84d5d9b9383ee', 1, 'lemon::FibHeap::FibHeap(ItemIntMap &map)'],\n ['../a02593.html', 1, 'FibHeap< PR, IM, CMP >']\n ]],\n ['file_8', ['file', ['../a02581.html#afcf446ca6d48179db6389cccc6b94ec1', 1, 'lemon::FormatError::file() const'],\n ['../a02581.html#a51d6a4ade7b21409a4070f3d27c954bf', 1, 'lemon::FormatError::file(const std::string &file)'],\n ['../a02577.html#afcf446ca6d48179db6389cccc6b94ec1', 1, 'lemon::IoError::file() const'],\n@@ -130,26 +130,26 @@\n ['forward_38', ['forward', ['../a01565.html#a05a82dec247b71ac0a5b42b9f8581f39', 1, 'lemon::ResidualDigraph::forward(const typename Digraph::Arc &a)'],\n ['../a01565.html#a7e6872f27247ac469eca9bbec6faa4b9', 1, 'lemon::ResidualDigraph::forward(const Arc &a)']\n ]],\n ['forwardmap_39', ['forwardmap', ['../a03657.html#aca82dbed2eb0ffb8552c017000ba1512', 1, 'lemon::ForwardMap::ForwardMap(const GR &graph)'],\n ['../a00516.html#ga658f2b3a54c7e6e15b47b38bbc588e46', 1, 'lemon::ForwardMap::forwardMap(const GR &graph)'],\n ['../a03657.html', 1, 'ForwardMap< GR >']\n ]],\n- ['fractional_5fmatching_2eh_40', ['fractional_matching.h', ['../a00224.html', 1, '']]],\n+ ['fractional_5fmatching_2eh_40', ['fractional_matching.h', ['../a00242.html', 1, '']]],\n ['fractionalinit_41', ['fractionalinit', ['../a03689.html#aa6aa523182612da8c58ca2745c354403', 1, 'lemon::MaxWeightedMatching::fractionalInit()'],\n ['../a03709.html#aa6aa523182612da8c58ca2745c354403', 1, 'lemon::MaxWeightedPerfectMatching::fractionalInit()']\n ]],\n ['free_42', ['FREE', ['../a03405.html#a86b9012e22aaac73c64bb7247dcb44c5acc62d1576546f3245237e1b232d838b6', 1, 'lemon::LpSolver']]],\n ['from_20the_200_20x_20series_43', ['Migration from the 0.x Series', ['../a11513.html', 1, '']]],\n ['front_44', ['front', ['../a03941.html#a5bfcbed64f84d88c97a40c9fdc63e247', 1, 'lemon::SimplePath::front()'],\n ['../a03933.html#a5bfcbed64f84d88c97a40c9fdc63e247', 1, 'lemon::Path::front()'],\n ['../a03949.html#a5bfcbed64f84d88c97a40c9fdc63e247', 1, 'lemon::ListPath::front()'],\n ['../a03961.html#a5bfcbed64f84d88c97a40c9fdc63e247', 1, 'lemon::StaticPath::front()']\n ]],\n- ['full_5fgraph_2eh_45', ['full_graph.h', ['../a00428.html', 1, '']]],\n+ ['full_5fgraph_2eh_45', ['full_graph.h', ['../a00272.html', 1, '']]],\n ['fullbpgraph_46', ['fullbpgraph', ['../a02701.html', 1, 'FullBpGraph'],\n ['../a02701.html#aab84448cec3ded27de38f2bb335835fa', 1, 'lemon::FullBpGraph::FullBpGraph(int redNum, int blueNum)'],\n ['../a02701.html#abc7c05e9365c30bf769e3e97a5032335', 1, 'lemon::FullBpGraph::FullBpGraph()']\n ]],\n ['fulldigraph_47', ['fulldigraph', ['../a02653.html', 1, 'FullDigraph'],\n ['../a02653.html#a79330852030897096b3c56124e78c91b', 1, 'lemon::FullDigraph::FullDigraph(int n)'],\n ['../a02653.html#a8efcbbf06d26f743ebb266ceb4ca1a2a', 1, 'lemon::FullDigraph::FullDigraph()']\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/all_a.js", "source2": "./usr/share/doc/lemon/html/search/all_a.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -7,26 +7,26 @@\n ]],\n ['gauss2_2', ['gauss2', ['../a04149.html#a139cdd9bc9cd716f09dff1f9995fa1a6', 1, 'lemon::Random']]],\n ['general_20optimization_20tools_3', ['General Optimization Tools', ['../a00536.html', 1, '']]],\n ['geometric_20data_20structures_4', ['Geometric Data Structures', ['../a00521.html', 1, '']]],\n ['geq_5', ['GEQ', ['../a03889.html#ac860a45e09c68fb71f723d392c3161aca99705e9593e3e5c078150b293c86561e', 1, 'lemon::NetworkSimplex']]],\n ['geq_20form_6', ['Definition (GEQ form)', ['../a11514.html#mcf_def', 1, '']]],\n ['given_7', ['given', ['../a01617.html#ae74da01d253a5df1497a604c20abfbd7', 1, 'lemon::ArgParser']]],\n- ['glpk_2ecc_8', ['glpk.cc', ['../a00320.html', 1, '']]],\n- ['glpk_2eh_9', ['glpk.h', ['../a00314.html', 1, '']]],\n+ ['glpk_2ecc_8', ['glpk.cc', ['../a00308.html', 1, '']]],\n+ ['glpk_2eh_9', ['glpk.h', ['../a00320.html', 1, '']]],\n ['glpkbase_10', ['GlpkBase', ['../a02709.html', 1, 'lemon']]],\n ['glpklp_11', ['glpklp', ['../a02717.html', 1, 'GlpkLp'],\n ['../a02717.html#abed5d680cd663d1ebf51276c5d40a3c4', 1, 'lemon::GlpkLp::GlpkLp(const GlpkLp &)'],\n ['../a02717.html#a8fd9ded5caa626fdf9b1b67e0d4342f6', 1, 'lemon::GlpkLp::GlpkLp()']\n ]],\n ['glpkmip_12', ['glpkmip', ['../a02721.html', 1, 'GlpkMip'],\n ['../a02721.html#ab1c1ec0ee2201677230ce93a1c815c90', 1, 'lemon::GlpkMip::GlpkMip(const GlpkMip &)'],\n ['../a02721.html#ad1601aa1469b52a8fef9e52050a3bc1a', 1, 'lemon::GlpkMip::GlpkMip()']\n ]],\n- ['gomory_5fhu_2eh_13', ['gomory_hu.h', ['../a00380.html', 1, '']]],\n+ ['gomory_5fhu_2eh_13', ['gomory_hu.h', ['../a00254.html', 1, '']]],\n ['gomoryhu_14', ['gomoryhu', ['../a02725.html#a31ffa12460cb7ae041f29f09fcd9b8f4', 1, 'lemon::GomoryHu::GomoryHu()'],\n ['../a02725.html', 1, 'GomoryHu< GR, CAP >']\n ]],\n ['graph_15', ['graph', ['../a01553.html#a2a51ae337b207f01f1c904f5eb2aa98a', 1, 'lemon::Orienter::Graph'],\n ['../a03637.html#a2a51ae337b207f01f1c904f5eb2aa98a', 1, 'lemon::IterableValueMap::Graph'],\n ['../a03621.html#a2a51ae337b207f01f1c904f5eb2aa98a', 1, 'lemon::IterableIntMap::Graph'],\n ['../a03589.html#a2a51ae337b207f01f1c904f5eb2aa98a', 1, 'lemon::RangeIdMap::Graph'],\n@@ -55,18 +55,18 @@\n ['graph_20maps_18', ['Graph Maps', ['../a00516.html', 1, '']]],\n ['graph_20properties_19', ['Connectivity and Other Graph Properties', ['../a00531.html', 1, '']]],\n ['graph_20related_20name_20changes_20', ['Graph Related Name Changes', ['../a11513.html#migration-graph', 1, '']]],\n ['graph_20search_21', ['Graph Search', ['../a00523.html', 1, '']]],\n ['graph_20structure_20concepts_22', ['Graph Structure Concepts', ['../a00549.html', 1, '']]],\n ['graph_20structures_23', ['Graph Structures', ['../a00513.html', 1, '']]],\n ['graph_20utilities_24', ['Basic Graph Utilities', ['../a00539.html', 1, '']]],\n- ['graph_2eh_25', ['graph.h', ['../a00482.html', 1, '']]],\n- ['graph_5fcomponents_2eh_26', ['graph_components.h', ['../a00488.html', 1, '']]],\n- ['graph_5fto_5feps_2eh_27', ['graph_to_eps.h', ['../a00263.html', 1, '']]],\n- ['graph_5fto_5feps_5fdemo_2ecc_28', ['graph_to_eps_demo.cc', ['../a00005.html', 1, '']]],\n+ ['graph_2eh_25', ['graph.h', ['../a00488.html', 1, '']]],\n+ ['graph_5fcomponents_2eh_26', ['graph_components.h', ['../a00491.html', 1, '']]],\n+ ['graph_5fto_5feps_2eh_27', ['graph_to_eps.h', ['../a00299.html', 1, '']]],\n+ ['graph_5fto_5feps_5fdemo_2ecc_28', ['graph_to_eps_demo.cc', ['../a00014.html', 1, '']]],\n ['graph_5ftypedefs_29', ['GRAPH_TYPEDEFS', ['../a00539.html#gab8c497e4257836f4669b8922237d830b', 1, 'core.h']]],\n ['graphcopy_30', ['graphcopy', ['../a02061.html', 1, 'GraphCopy< From, To >'],\n ['../a00539.html#ga7419db778a9792c678e3893020175aa8', 1, 'lemon::graphCopy(const From &from, To &to)'],\n ['../a02061.html#a2279b087a65e31ed8414893fc247dd29', 1, 'lemon::GraphCopy::GraphCopy()']\n ]],\n ['graphincit_31', ['graphincit', ['../a05353.html#a88c15f8f8a74c8718d785aea76f9ce8a', 1, 'lemon::concepts::GraphIncIt::GraphIncIt(const GR &, const Base &)'],\n ['../a05353.html#a22a7a460818da92ce6d2221439a3b22a', 1, 'lemon::concepts::GraphIncIt::GraphIncIt()'],\n@@ -113,30 +113,30 @@\n ['../a03205.html#a62d67c675daa12f93ea7f37f616f61de', 1, 'lemon::GraphWriter::graphWriter(const TGR &graph, const char *fn)'],\n ['../a03205.html#a048dd7d5e27e1c30f96e979f92f4ea3d', 1, 'lemon::GraphWriter::GraphWriter(const GR &graph, std::ostream &os=std::cout)'],\n ['../a03205.html#a6a03481bb09c2fdfe5371fc1cd6e90ea', 1, 'lemon::GraphWriter::GraphWriter(const GR &graph, const std::string &fn)'],\n ['../a03205.html#af23c37b427913cc3a001edb841e4ca85', 1, 'lemon::GraphWriter::GraphWriter(const GR &graph, const char *fn)'],\n ['../a00544.html#gae03a34e019c92c5383b4d4a188a3bae0', 1, 'lemon::GraphWriter::graphWriter(const TGR &graph, std::ostream &os)'],\n ['../a03205.html#a0253738e23b139b13b4dd59226975a14', 1, 'lemon::GraphWriter::graphWriter(const TGR &graph, const std::string &fn)']\n ]],\n- ['greedy_5ftsp_2eh_44', ['greedy_tsp.h', ['../a00323.html', 1, '']]],\n+ ['greedy_5ftsp_2eh_44', ['greedy_tsp.h', ['../a00269.html', 1, '']]],\n ['greedyinit_45', ['greedyinit', ['../a03685.html#a275cfb5a0d9eeb69e56ec2366e0a4f81', 1, 'lemon::MaxMatching::greedyInit()'],\n ['../a01881.html#a275cfb5a0d9eeb69e56ec2366e0a4f81', 1, 'lemon::Circulation::greedyInit()']\n ]],\n ['greedytsp_46', ['greedytsp', ['../a02789.html', 1, 'GreedyTsp< CM >'],\n ['../a02789.html#a02b07ecd025ae827ff29e6eb6e9271c4', 1, 'lemon::GreedyTsp::GreedyTsp()']\n ]],\n ['green_47', ['green', ['../a00540.html#ga9d50a7cbc8c947f88556291754b964df', 1, 'lemon::GREEN'],\n ['../a01913.html#a9aec4cad00657b9936f9536c4d433f1a', 1, 'lemon::Color::green()'],\n ['../a01913.html#a17019223e81ccf7c2145836e149f23e5', 1, 'lemon::Color::green() const']\n ]],\n ['grey_48', ['GREY', ['../a00540.html#gaccc4c0904a38839f9554cde971bb4963', 1, 'lemon']]],\n- ['grid_5fgraph_2eh_49', ['grid_graph.h', ['../a00392.html', 1, '']]],\n+ ['grid_5fgraph_2eh_49', ['grid_graph.h', ['../a00368.html', 1, '']]],\n ['gridgraph_50', ['gridgraph', ['../a02813.html#a9592df3bc5a41604bcc6c08b17e6ccce', 1, 'lemon::GridGraph::GridGraph()'],\n ['../a02813.html', 1, 'GridGraph']\n ]],\n- ['grosso_5flocatelli_5fpullan_5fmc_2eh_51', ['grosso_locatelli_pullan_mc.h', ['../a00335.html', 1, '']]],\n+ ['grosso_5flocatelli_5fpullan_5fmc_2eh_51', ['grosso_locatelli_pullan_mc.h', ['../a00203.html', 1, '']]],\n ['grossolocatellipullanmc_52', ['grossolocatellipullanmc', ['../a02829.html', 1, 'GrossoLocatelliPullanMc< GR >'],\n ['../a02829.html#a127cbd3f9c20ce1bcbd934860d3b2ad9', 1, 'lemon::GrossoLocatelliPullanMc::GrossoLocatelliPullanMc(const GR &graph, const Random &random)'],\n ['../a02829.html#a9ab95afa7e1a9c4fd8619f98aaaa63a0', 1, 'lemon::GrossoLocatelliPullanMc::GrossoLocatelliPullanMc(const GR &graph)'],\n ['../a02829.html#a94157b6d74ac0f56a9ed6ad1dd1c8f02', 1, 'lemon::GrossoLocatelliPullanMc::GrossoLocatelliPullanMc(const GR &graph, int seed)']\n ]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/all_b.js", "source2": "./usr/share/doc/lemon/html/search/all_b.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,14 +1,14 @@\n var searchData = [\n ['halt_0', ['halt', ['../a04329.html#ade0430439247877006d7df950f94918a', 1, 'lemon::Timer']]],\n- ['hao_5forlin_2eh_1', ['hao_orlin.h', ['../a00338.html', 1, '']]],\n+ ['hao_5forlin_2eh_1', ['hao_orlin.h', ['../a00341.html', 1, '']]],\n ['haoorlin_2', ['haoorlin', ['../a02849.html#ab03a48e815fb5a8af4274cccd705a33c', 1, 'lemon::HaoOrlin::HaoOrlin()'],\n ['../a02849.html', 1, 'HaoOrlin< GR, CAP, TOL >']\n ]],\n- ['hartmann_5forlin_5fmmc_2eh_3', ['hartmann_orlin_mmc.h', ['../a00389.html', 1, '']]],\n+ ['hartmann_5forlin_5fmmc_2eh_3', ['hartmann_orlin_mmc.h', ['../a00323.html', 1, '']]],\n ['hartmannorlinmmc_4', ['hartmannorlinmmc', ['../a02861.html', 1, 'HartmannOrlinMmc< GR, CM, TR >'],\n ['../a02861.html#a2bf16fe287f8f8c6a0c95230c37874fb', 1, 'lemon::HartmannOrlinMmc::HartmannOrlinMmc()']\n ]],\n ['hartmannorlinmmc_3c_20gr_2c_20cm_2c_20setlargecosttraits_3c_20t_20_3e_20_3e_5', ['HartmannOrlinMmc< GR, CM, SetLargeCostTraits< T > >', ['../a02861.html', 1, 'lemon']]],\n ['hartmannorlinmmc_3c_20gr_2c_20cm_2c_20setpathtraits_3c_20t_20_3e_20_3e_6', ['HartmannOrlinMmc< GR, CM, SetPathTraits< T > >', ['../a02861.html', 1, 'lemon']]],\n ['hartmannorlinmmcdefaulttraits_7', ['HartmannOrlinMmcDefaultTraits', ['../a02853.html', 1, 'lemon']]],\n ['header_20file_8', ['Template Header File', ['../a11510.html#header-template', 1, '']]],\n@@ -28,15 +28,15 @@\n ['../a02305.html#ae9674759c9994950c85735775791c79d', 1, 'lemon::DijkstraDefaultTraits::Heap'],\n ['../a01853.html#ab1e3f1c47cd4bffb15e3bbc452585f7c', 1, 'lemon::CapacityScaling::Heap'],\n ['../a01849.html#a5212fa22a215a30621620615986ac5ca', 1, 'lemon::CapacityScalingDefaultTraits::Heap'],\n ['../a05533.html', 1, 'Heap< PR, IM, CMP >'],\n ['../a02309.html#ab1e3f1c47cd4bffb15e3bbc452585f7c', 1, 'lemon::Dijkstra::Heap']\n ]],\n ['heap_20structures_10', ['Heap Structures', ['../a00519.html', 1, '']]],\n- ['heap_2eh_11', ['heap.h', ['../a00491.html', 1, '']]],\n+ ['heap_2eh_11', ['heap.h', ['../a00485.html', 1, '']]],\n ['heapcrossref_12', ['heapcrossref', ['../a03841.html#a6778ddccbd5e5e916667fdfb0b3280da', 1, 'lemon::NagamochiIbarakiDefaultTraits::HeapCrossRef'],\n ['../a04285.html#a0dc498f33875179555a71ba9441c400a', 1, 'lemon::Suurballe::HeapCrossRef'],\n ['../a04281.html#a2d93a11a420d38311b87175d53c631dc', 1, 'lemon::SuurballeDefaultTraits::HeapCrossRef'],\n ['../a03845.html#acda80d336c67c0b2df5f58ede2b0a02d', 1, 'lemon::NagamochiIbaraki::HeapCrossRef'],\n ['../a03757.html#acda80d336c67c0b2df5f58ede2b0a02d', 1, 'lemon::MaxCardinalitySearch::HeapCrossRef'],\n ['../a03729.html#abe21d3edcb6bd235d862becfd84c6d92', 1, 'lemon::MaxCardinalitySearchDefaultTraits::HeapCrossRef'],\n ['../a02369.html#abe21d3edcb6bd235d862becfd84c6d92', 1, 'lemon::DijkstraWizardDefaultTraits::HeapCrossRef'],\n@@ -57,22 +57,22 @@\n ['highestactive_19', ['highestactive', ['../a02569.html#ae705c89b74ba93a8d0030a73c32a6c55', 1, 'lemon::LinkedElevator::highestActive()'],\n ['../a02565.html#ae705c89b74ba93a8d0030a73c32a6c55', 1, 'lemon::Elevator::highestActive()']\n ]],\n ['highestactivelevel_20', ['highestactivelevel', ['../a02569.html#af0d0300a784833d553460afc1a880e85', 1, 'lemon::LinkedElevator::highestActiveLevel()'],\n ['../a02565.html#af0d0300a784833d553460afc1a880e85', 1, 'lemon::Elevator::highestActiveLevel()']\n ]],\n ['how_20to_20read_20the_20documentation_21', ['How to Read the Documentation', ['../index.html#howtoread', 1, '']]],\n- ['howard_5fmmc_2eh_22', ['howard_mmc.h', ['../a00344.html', 1, '']]],\n+ ['howard_5fmmc_2eh_22', ['howard_mmc.h', ['../a00404.html', 1, '']]],\n ['howardmmc_23', ['howardmmc', ['../a02893.html', 1, 'HowardMmc< GR, CM, TR >'],\n ['../a02893.html#a77813a4da215372de0ce94332beeb464', 1, 'lemon::HowardMmc::HowardMmc()']\n ]],\n ['howardmmc_3c_20gr_2c_20cm_2c_20setlargecosttraits_3c_20t_20_3e_20_3e_24', ['HowardMmc< GR, CM, SetLargeCostTraits< T > >', ['../a02893.html', 1, 'lemon']]],\n ['howardmmc_3c_20gr_2c_20cm_2c_20setpathtraits_3c_20t_20_3e_20_3e_25', ['HowardMmc< GR, CM, SetPathTraits< T > >', ['../a02893.html', 1, 'lemon']]],\n ['howardmmcdefaulttraits_26', ['HowardMmcDefaultTraits', ['../a02885.html', 1, 'lemon']]],\n- ['hypercube_5fgraph_2eh_27', ['hypercube_graph.h', ['../a00182.html', 1, '']]],\n+ ['hypercube_5fgraph_2eh_27', ['hypercube_graph.h', ['../a00266.html', 1, '']]],\n ['hypercubegraph_28', ['hypercubegraph', ['../a02929.html', 1, 'HypercubeGraph'],\n ['../a02929.html#ad1e0bae8743a52a5f67cd18ece720412', 1, 'lemon::HypercubeGraph::HypercubeGraph()']\n ]],\n ['hypermap_29', ['hypermap', ['../a02933.html#af3bfe46c9fac0e4f8ebd92acc2488a4d', 1, 'lemon::HypercubeGraph::HyperMap::HyperMap()'],\n ['../a02933.html', 1, 'HypercubeGraph::HyperMap< T, BF >']\n ]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/all_c.js", "source2": "./usr/share/doc/lemon/html/search/all_c.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -161,15 +161,15 @@\n ['insert_27', ['insert', ['../a04361.html#a1762b08b3b35b8b1a3d1f6d26f389fd1', 1, 'lemon::UnionFindEnum::insert()'],\n ['../a04357.html#a68ecd7821136d47f859542f44ef40138', 1, 'lemon::UnionFind::insert()'],\n ['../a04361.html#a59869ec643e4a302e58808739ad532ec', 1, 'lemon::UnionFindEnum::insert()'],\n ['../a04381.html#a59869ec643e4a302e58808739ad532ec', 1, 'lemon::ExtendFindEnum::insert(const Item &item)'],\n ['../a04381.html#a1762b08b3b35b8b1a3d1f6d26f389fd1', 1, 'lemon::ExtendFindEnum::insert(const Item &item, int cls)'],\n ['../a04401.html#adaf61646dea527f772f4e1711d59e35e', 1, 'lemon::HeapUnionFind::insert()']\n ]],\n- ['insertion_5ftsp_2eh_28', ['insertion_tsp.h', ['../a00221.html', 1, '']]],\n+ ['insertion_5ftsp_2eh_28', ['insertion_tsp.h', ['../a00380.html', 1, '']]],\n ['insertiontsp_29', ['insertiontsp', ['../a02937.html#a8316232e57bedff6d679489e98bb46a7', 1, 'lemon::InsertionTsp::InsertionTsp()'],\n ['../a02937.html', 1, 'InsertionTsp< CM >']\n ]],\n ['inside_30', ['inside', ['../a02401.html#a1639770ab4eb220856ff6e3627be83ea', 1, 'lemon::dim2::Box']]],\n ['instance_20member_20variables_20auto_20variables_31', ['Class and instance member variables, auto variables', ['../a11510.html#cs-loc-var', 1, '']]],\n ['integer_32', ['integer', ['../a03409.html#a2abb63446fb6107f8e2f4dbe9de2e082a5a063e265d2ac903b6808e9f6e73ec46', 1, 'lemon::MipSolver::INTEGER'],\n ['../a04149.html#af2d2e5834fa6c5b56a4a3a87e6d699cd', 1, 'lemon::Random::integer(Number b)'],\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/all_e.js", "source2": "./usr/share/doc/lemon/html/search/all_e.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,9 +1,9 @@\n var searchData = [\n- ['karp_5fmmc_2eh_0', ['karp_mmc.h', ['../a00419.html', 1, '']]],\n+ ['karp_5fmmc_2eh_0', ['karp_mmc.h', ['../a00356.html', 1, '']]],\n ['karpmmc_1', ['karpmmc', ['../a02969.html#a1faa7ea10aa24f717f26008b7c789bc7', 1, 'lemon::KarpMmc::KarpMmc()'],\n ['../a02969.html', 1, 'KarpMmc< GR, CM, TR >']\n ]],\n ['karpmmc_3c_20gr_2c_20cm_2c_20setlargecosttraits_3c_20t_20_3e_20_3e_2', ['KarpMmc< GR, CM, SetLargeCostTraits< T > >', ['../a02969.html', 1, 'lemon']]],\n ['karpmmc_3c_20gr_2c_20cm_2c_20setpathtraits_3c_20t_20_3e_20_3e_3', ['KarpMmc< GR, CM, SetPathTraits< T > >', ['../a02969.html', 1, 'lemon']]],\n ['karpmmcdefaulttraits_4', ['KarpMmcDefaultTraits', ['../a02961.html', 1, 'lemon']]],\n ['key_5', ['key', ['../a03589.html#a2cfe904ef7579cf511b9fcb14420539b', 1, 'lemon::RangeIdMap::Key'],\n@@ -67,10 +67,10 @@\n ['../a03469.html#a8c5e944591efa8f8f0d64cf81950abcf', 1, 'lemon::MapToFunctor::Key'],\n ['../a03465.html#a2cfe904ef7579cf511b9fcb14420539b', 1, 'lemon::FunctorToMap::Key'],\n ['../a03461.html#ac16c774bd2b82a45854c3ac66248de01', 1, 'lemon::CombineMap::Key'],\n ['../a03457.html#a481aeb3578c6cc4719982a3e64501d19', 1, 'lemon::ComposeMap::Key'],\n ['../a03449.html#ac11959cb1c3b09fd9b188d07365c3031', 1, 'lemon::RangeMap::Key']\n ]],\n ['kruskal_6', ['kruskal', ['../a00525.html#ga73cff50a9c30ef28ebd6b6081e6fa685', 1, 'lemon']]],\n- ['kruskal_2eh_7', ['kruskal.h', ['../a00176.html', 1, '']]],\n+ ['kruskal_2eh_7', ['kruskal.h', ['../a00395.html', 1, '']]],\n ['kuratowski_8', ['kuratowski', ['../a04037.html#a6d508c7a7438cde389663e1aef8b20b9', 1, 'lemon::PlanarEmbedding']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/all_f.js", "source2": "./usr/share/doc/lemon/html/search/all_f.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -56,16 +56,16 @@\n ['lessmap_19', ['lessmap', ['../a03553.html#a3992271974bb62dd5632a068a68b5ea6', 1, 'lemon::LessMap::LessMap(const M1 &m1, const M2 &m2)'],\n ['../a00517.html#ga4c49f5cdfa8c2484f4fd1a8ce476ba14', 1, 'lemon::LessMap::lessMap(const M1 &m1, const M2 &m2)'],\n ['../a03553.html', 1, 'LessMap< M1, M2 >']\n ]],\n ['lgf_20', ['LEMON Graph Format (LGF)', ['../a11511.html', 1, '']]],\n ['lgf_20tools_21', ['LGF tools', ['../a11513.html#migration-lgf', 1, '']]],\n ['lgf_2dgen_2ecc_22', ['lgf-gen.cc', ['../a00497.html', 1, '']]],\n- ['lgf_5fdemo_2ecc_23', ['lgf_demo.cc', ['../a00014.html', 1, '']]],\n- ['lgf_5freader_2eh_24', ['lgf_reader.h', ['../a00350.html', 1, '']]],\n+ ['lgf_5fdemo_2ecc_23', ['lgf_demo.cc', ['../a00002.html', 1, '']]],\n+ ['lgf_5freader_2eh_24', ['lgf_reader.h', ['../a00392.html', 1, '']]],\n ['lgf_5fwriter_2eh_25', ['lgf_writer.h', ['../a00164.html', 1, '']]],\n ['lgfcontents_26', ['lgfcontents', ['../a03141.html#a354d20288c783068888642817d4201fb', 1, 'lemon::LgfContents::LgfContents(std::istream &is)'],\n ['../a03141.html#a8504ecb1b857fd19df24823e811d3140', 1, 'lemon::LgfContents::LgfContents(const std::string &fn)'],\n ['../a03141.html#adf863a29229b03c84b76d174dfc355cb', 1, 'lemon::LgfContents::LgfContents(const char *fn)'],\n ['../a03141.html', 1, 'LgfContents']\n ]],\n ['license_20terms_27', ['License Terms', ['../a11512.html', 1, '']]],\n@@ -96,15 +96,15 @@\n ['line_36', ['line', ['../a02581.html#a51e985445b7c0be388784e41241e0a96', 1, 'lemon::FormatError::line(int line)'],\n ['../a02581.html#a9834cd1b21362a1c8b503e9eab45c406', 1, 'lemon::FormatError::line() const']\n ]],\n ['linkedelevator_37', ['linkedelevator', ['../a02569.html', 1, 'LinkedElevator< GR, Item >'],\n ['../a02569.html#a7c6dec431b72da2e9f1ea0296d104f0e', 1, 'lemon::LinkedElevator::LinkedElevator(const GR &graph, int max_level)'],\n ['../a02569.html#aa58ae777b13e13505d79f6d58be15e37', 1, 'lemon::LinkedElevator::LinkedElevator(const GR &graph)']\n ]],\n- ['list_5fgraph_2eh_38', ['list_graph.h', ['../a00386.html', 1, '']]],\n+ ['list_5fgraph_2eh_38', ['list_graph.h', ['../a00206.html', 1, '']]],\n ['listarcset_39', ['listarcset', ['../a02449.html', 1, 'ListArcSet< GR >'],\n ['../a02449.html#aa282329c1d82b1cb36430d5905c0ae41', 1, 'lemon::ListArcSet::ListArcSet()']\n ]],\n ['listbpgraph_40', ['listbpgraph', ['../a03325.html#a1128d56e162dcf7ae3f7b66e240a2738', 1, 'lemon::ListBpGraph::ListBpGraph(const ListBpGraph &)'],\n ['../a03325.html#a02bf78d75220d990389ca54107103d03', 1, 'lemon::ListBpGraph::ListBpGraph()'],\n ['../a03325.html', 1, 'ListBpGraph']\n ]],\n@@ -149,19 +149,19 @@\n ['../a03889.html#a9b6594528905767c13d6a82f6f1be99b', 1, 'lemon::NetworkSimplex::lowerMap()'],\n ['../a02189.html#a1746ea29444d100e02bad55f2aae78af', 1, 'lemon::CycleCanceling::lowerMap()'],\n ['../a02137.html#ab6772160fa9996746da3c53b090eded6', 1, 'lemon::CostScaling::lowerMap()'],\n ['../a01881.html#af4ad420bbfe13dda63a20f306158af91', 1, 'lemon::Circulation::lowerMap()']\n ]],\n ['lp_58', ['Lp', ['../a00537.html#ga8c6461f78849b26ae8be11062410d043', 1, 'lemon']]],\n ['lp_20and_20mip_20solvers_59', ['LP and MIP Solvers', ['../a00537.html', 1, '']]],\n- ['lp_2eh_60', ['lp.h', ['../a00212.html', 1, '']]],\n- ['lp_5fbase_2ecc_61', ['lp_base.cc', ['../a00215.html', 1, '']]],\n- ['lp_5fbase_2eh_62', ['lp_base.h', ['../a00299.html', 1, '']]],\n- ['lp_5fskeleton_2ecc_63', ['lp_skeleton.cc', ['../a00341.html', 1, '']]],\n- ['lp_5fskeleton_2eh_64', ['lp_skeleton.h', ['../a00269.html', 1, '']]],\n+ ['lp_2eh_60', ['lp.h', ['../a00188.html', 1, '']]],\n+ ['lp_5fbase_2ecc_61', ['lp_base.cc', ['../a00224.html', 1, '']]],\n+ ['lp_5fbase_2eh_62', ['lp_base.h', ['../a00377.html', 1, '']]],\n+ ['lp_5fskeleton_2ecc_63', ['lp_skeleton.cc', ['../a00374.html', 1, '']]],\n+ ['lp_5fskeleton_2eh_64', ['lp_skeleton.h', ['../a00419.html', 1, '']]],\n ['lpbase_65', ['LpBase', ['../a03341.html', 1, 'lemon']]],\n ['lpskeleton_66', ['lpskeleton', ['../a03417.html#aac6b7af1622599f20a58aaa053c7b6b4', 1, 'lemon::LpSkeleton::LpSkeleton()'],\n ['../a03417.html', 1, 'LpSkeleton']\n ]],\n ['lpsolver_67', ['LpSolver', ['../a03405.html', 1, 'lemon']]],\n ['lpx_68', ['lpx', ['../a02709.html#adf0d2711307da6c7cb6acee24458f699', 1, 'lemon::GlpkBase::lpx()'],\n ['../a02709.html#ac4702edcab45ce4addf65dd1e57b6163', 1, 'lemon::GlpkBase::lpx() const']\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/files_0.js", "source2": "./usr/share/doc/lemon/html/search/files_0.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,6 +1,6 @@\n var searchData = [\n- ['adaptors_2eh_0', ['adaptors.h', ['../a00401.html', 1, '']]],\n- ['arg_5fparser_2eh_1', ['arg_parser.h', ['../a00254.html', 1, '']]],\n+ ['adaptors_2eh_0', ['adaptors.h', ['../a00290.html', 1, '']]],\n+ ['arg_5fparser_2eh_1', ['arg_parser.h', ['../a00212.html', 1, '']]],\n ['arg_5fparser_5fdemo_2ecc_2', ['arg_parser_demo.cc', ['../a00008.html', 1, '']]],\n- ['assert_2eh_3', ['assert.h', ['../a00194.html', 1, '']]]\n+ ['assert_2eh_3', ['assert.h', ['../a00359.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/files_1.js", "source2": "./usr/share/doc/lemon/html/search/files_1.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,9 +1,9 @@\n var searchData = [\n- ['base_2ecc_0', ['base.cc', ['../a00275.html', 1, '']]],\n- ['bellman_5fford_2eh_1', ['bellman_ford.h', ['../a00374.html', 1, '']]],\n- ['bfs_2eh_2', ['bfs.h', ['../a00359.html', 1, '']]],\n- ['bin_5fheap_2eh_3', ['bin_heap.h', ['../a00284.html', 1, '']]],\n- ['binomial_5fheap_2eh_4', ['binomial_heap.h', ['../a00365.html', 1, '']]],\n- ['bpgraph_2eh_5', ['bpgraph.h', ['../a00494.html', 1, '']]],\n- ['bucket_5fheap_2eh_6', ['bucket_heap.h', ['../a00326.html', 1, '']]]\n+ ['base_2ecc_0', ['base.cc', ['../a00167.html', 1, '']]],\n+ ['bellman_5fford_2eh_1', ['bellman_ford.h', ['../a00353.html', 1, '']]],\n+ ['bfs_2eh_2', ['bfs.h', ['../a00230.html', 1, '']]],\n+ ['bin_5fheap_2eh_3', ['bin_heap.h', ['../a00371.html', 1, '']]],\n+ ['binomial_5fheap_2eh_4', ['binomial_heap.h', ['../a00416.html', 1, '']]],\n+ ['bpgraph_2eh_5', ['bpgraph.h', ['../a00482.html', 1, '']]],\n+ ['bucket_5fheap_2eh_6', ['bucket_heap.h', ['../a00215.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/files_10.js", "source2": "./usr/share/doc/lemon/html/search/files_10.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,6 +1,6 @@\n var searchData = [\n- ['radix_5fheap_2eh_0', ['radix_heap.h', ['../a00395.html', 1, '']]],\n- ['radix_5fsort_2eh_1', ['radix_sort.h', ['../a00272.html', 1, '']]],\n- ['random_2ecc_2', ['random.cc', ['../a00239.html', 1, '']]],\n- ['random_2eh_3', ['random.h', ['../a00296.html', 1, '']]]\n+ ['radix_5fheap_2eh_0', ['radix_heap.h', ['../a00293.html', 1, '']]],\n+ ['radix_5fsort_2eh_1', ['radix_sort.h', ['../a00317.html', 1, '']]],\n+ ['random_2ecc_2', ['random.cc', ['../a00185.html', 1, '']]],\n+ ['random_2eh_3', ['random.h', ['../a00275.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/files_11.js", "source2": "./usr/share/doc/lemon/html/search/files_11.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,7 +1,7 @@\n var searchData = [\n- ['smart_5fgraph_2eh_0', ['smart_graph.h', ['../a00197.html', 1, '']]],\n- ['soplex_2ecc_1', ['soplex.cc', ['../a00260.html', 1, '']]],\n- ['soplex_2eh_2', ['soplex.h', ['../a00236.html', 1, '']]],\n- ['static_5fgraph_2eh_3', ['static_graph.h', ['../a00287.html', 1, '']]],\n- ['suurballe_2eh_4', ['suurballe.h', ['../a00425.html', 1, '']]]\n+ ['smart_5fgraph_2eh_0', ['smart_graph.h', ['../a00191.html', 1, '']]],\n+ ['soplex_2ecc_1', ['soplex.cc', ['../a00326.html', 1, '']]],\n+ ['soplex_2eh_2', ['soplex.h', ['../a00281.html', 1, '']]],\n+ ['static_5fgraph_2eh_3', ['static_graph.h', ['../a00257.html', 1, '']]],\n+ ['suurballe_2eh_4', ['suurballe.h', ['../a00302.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/files_12.js", "source2": "./usr/share/doc/lemon/html/search/files_12.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,5 +1,5 @@\n var searchData = [\n ['test_5ftools_2eh_0', ['test_tools.h', ['../a00506.html', 1, '']]],\n- ['time_5fmeasure_2eh_1', ['time_measure.h', ['../a00233.html', 1, '']]],\n- ['tolerance_2eh_2', ['tolerance.h', ['../a00218.html', 1, '']]]\n+ ['time_5fmeasure_2eh_1', ['time_measure.h', ['../a00248.html', 1, '']]],\n+ ['tolerance_2eh_2', ['tolerance.h', ['../a00200.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/files_13.js", "source2": "./usr/share/doc/lemon/html/search/files_13.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var searchData = [\n- ['unionfind_2eh_0', ['unionfind.h', ['../a00209.html', 1, '']]]\n+ ['unionfind_2eh_0', ['unionfind.h', ['../a00194.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/files_14.js", "source2": "./usr/share/doc/lemon/html/search/files_14.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var searchData = [\n- ['windows_2ecc_0', ['windows.cc', ['../a00479.html', 1, '']]]\n+ ['windows_2ecc_0', ['windows.cc', ['../a00461.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/files_2.js", "source2": "./usr/share/doc/lemon/html/search/files_2.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,18 +1,18 @@\n var searchData = [\n- ['capacity_5fscaling_2eh_0', ['capacity_scaling.h', ['../a00257.html', 1, '']]],\n- ['cbc_2ecc_1', ['cbc.cc', ['../a00332.html', 1, '']]],\n- ['cbc_2eh_2', ['cbc.h', ['../a00368.html', 1, '']]],\n- ['christofides_5ftsp_2eh_3', ['christofides_tsp.h', ['../a00248.html', 1, '']]],\n- ['circulation_2eh_4', ['circulation.h', ['../a00371.html', 1, '']]],\n- ['clp_2eh_5', ['clp.h', ['../a00179.html', 1, '']]],\n- ['color_2ecc_6', ['color.cc', ['../a00173.html', 1, '']]],\n- ['color_2eh_7', ['color.h', ['../a00317.html', 1, '']]],\n- ['concept_5fcheck_2eh_8', ['concept_check.h', ['../a00347.html', 1, '']]],\n- ['connectivity_2eh_9', ['connectivity.h', ['../a00305.html', 1, '']]],\n- ['core_2eh_10', ['core.h', ['../a00329.html', 1, '']]],\n- ['cost_5fscaling_2eh_11', ['cost_scaling.h', ['../a00290.html', 1, '']]],\n- ['counter_2eh_12', ['counter.h', ['../a00206.html', 1, '']]],\n- ['cplex_2ecc_13', ['cplex.cc', ['../a00170.html', 1, '']]],\n- ['cplex_2eh_14', ['cplex.h', ['../a00407.html', 1, '']]],\n- ['cycle_5fcanceling_2eh_15', ['cycle_canceling.h', ['../a00311.html', 1, '']]]\n+ ['capacity_5fscaling_2eh_0', ['capacity_scaling.h', ['../a00398.html', 1, '']]],\n+ ['cbc_2ecc_1', ['cbc.cc', ['../a00209.html', 1, '']]],\n+ ['cbc_2eh_2', ['cbc.h', ['../a00428.html', 1, '']]],\n+ ['christofides_5ftsp_2eh_3', ['christofides_tsp.h', ['../a00386.html', 1, '']]],\n+ ['circulation_2eh_4', ['circulation.h', ['../a00182.html', 1, '']]],\n+ ['clp_2eh_5', ['clp.h', ['../a00236.html', 1, '']]],\n+ ['color_2ecc_6', ['color.cc', ['../a00425.html', 1, '']]],\n+ ['color_2eh_7', ['color.h', ['../a00221.html', 1, '']]],\n+ ['concept_5fcheck_2eh_8', ['concept_check.h', ['../a00173.html', 1, '']]],\n+ ['connectivity_2eh_9', ['connectivity.h', ['../a00233.html', 1, '']]],\n+ ['core_2eh_10', ['core.h', ['../a00263.html', 1, '']]],\n+ ['cost_5fscaling_2eh_11', ['cost_scaling.h', ['../a00260.html', 1, '']]],\n+ ['counter_2eh_12', ['counter.h', ['../a00245.html', 1, '']]],\n+ ['cplex_2ecc_13', ['cplex.cc', ['../a00305.html', 1, '']]],\n+ ['cplex_2eh_14', ['cplex.h', ['../a00350.html', 1, '']]],\n+ ['cycle_5fcanceling_2eh_15', ['cycle_canceling.h', ['../a00401.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/files_3.js", "source2": "./usr/share/doc/lemon/html/search/files_3.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,10 +1,10 @@\n var searchData = [\n- ['dfs_2eh_0', ['dfs.h', ['../a00353.html', 1, '']]],\n- ['dheap_2eh_1', ['dheap.h', ['../a00302.html', 1, '']]],\n- ['digraph_2eh_2', ['digraph.h', ['../a00485.html', 1, '']]],\n- ['dijkstra_2eh_3', ['dijkstra.h', ['../a00242.html', 1, '']]],\n- ['dim2_2eh_4', ['dim2.h', ['../a00281.html', 1, '']]],\n+ ['dfs_2eh_0', ['dfs.h', ['../a00287.html', 1, '']]],\n+ ['dheap_2eh_1', ['dheap.h', ['../a00284.html', 1, '']]],\n+ ['digraph_2eh_2', ['digraph.h', ['../a00494.html', 1, '']]],\n+ ['dijkstra_2eh_3', ['dijkstra.h', ['../a00344.html', 1, '']]],\n+ ['dim2_2eh_4', ['dim2.h', ['../a00314.html', 1, '']]],\n ['dimacs_2dsolver_2ecc_5', ['dimacs-solver.cc', ['../a00503.html', 1, '']]],\n ['dimacs_2dto_2dlgf_2ecc_6', ['dimacs-to-lgf.cc', ['../a00500.html', 1, '']]],\n- ['dimacs_2eh_7', ['dimacs.h', ['../a00251.html', 1, '']]]\n+ ['dimacs_2eh_7', ['dimacs.h', ['../a00197.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/files_4.js", "source2": "./usr/share/doc/lemon/html/search/files_4.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,7 +1,7 @@\n var searchData = [\n- ['edge_5fset_2eh_0', ['edge_set.h', ['../a00191.html', 1, '']]],\n- ['edmonds_5fkarp_2eh_1', ['edmonds_karp.h', ['../a00356.html', 1, '']]],\n- ['elevator_2eh_2', ['elevator.h', ['../a00230.html', 1, '']]],\n- ['error_2eh_3', ['error.h', ['../a00278.html', 1, '']]],\n- ['euler_2eh_4', ['euler.h', ['../a00413.html', 1, '']]]\n+ ['edge_5fset_2eh_0', ['edge_set.h', ['../a00407.html', 1, '']]],\n+ ['edmonds_5fkarp_2eh_1', ['edmonds_karp.h', ['../a00311.html', 1, '']]],\n+ ['elevator_2eh_2', ['elevator.h', ['../a00383.html', 1, '']]],\n+ ['error_2eh_3', ['error.h', ['../a00347.html', 1, '']]],\n+ ['euler_2eh_4', ['euler.h', ['../a00176.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/files_5.js", "source2": "./usr/share/doc/lemon/html/search/files_5.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,5 +1,5 @@\n var searchData = [\n- ['fib_5fheap_2eh_0', ['fib_heap.h', ['../a00398.html', 1, '']]],\n- ['fractional_5fmatching_2eh_1', ['fractional_matching.h', ['../a00224.html', 1, '']]],\n- ['full_5fgraph_2eh_2', ['full_graph.h', ['../a00428.html', 1, '']]]\n+ ['fib_5fheap_2eh_0', ['fib_heap.h', ['../a00296.html', 1, '']]],\n+ ['fractional_5fmatching_2eh_1', ['fractional_matching.h', ['../a00242.html', 1, '']]],\n+ ['full_5fgraph_2eh_2', ['full_graph.h', ['../a00272.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/files_6.js", "source2": "./usr/share/doc/lemon/html/search/files_6.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,12 +1,12 @@\n var searchData = [\n- ['glpk_2ecc_0', ['glpk.cc', ['../a00320.html', 1, '']]],\n- ['glpk_2eh_1', ['glpk.h', ['../a00314.html', 1, '']]],\n- ['gomory_5fhu_2eh_2', ['gomory_hu.h', ['../a00380.html', 1, '']]],\n- ['graph_2eh_3', ['graph.h', ['../a00482.html', 1, '']]],\n- ['graph_5fcomponents_2eh_4', ['graph_components.h', ['../a00488.html', 1, '']]],\n- ['graph_5fto_5feps_2eh_5', ['graph_to_eps.h', ['../a00263.html', 1, '']]],\n- ['graph_5fto_5feps_5fdemo_2ecc_6', ['graph_to_eps_demo.cc', ['../a00005.html', 1, '']]],\n- ['greedy_5ftsp_2eh_7', ['greedy_tsp.h', ['../a00323.html', 1, '']]],\n- ['grid_5fgraph_2eh_8', ['grid_graph.h', ['../a00392.html', 1, '']]],\n- ['grosso_5flocatelli_5fpullan_5fmc_2eh_9', ['grosso_locatelli_pullan_mc.h', ['../a00335.html', 1, '']]]\n+ ['glpk_2ecc_0', ['glpk.cc', ['../a00308.html', 1, '']]],\n+ ['glpk_2eh_1', ['glpk.h', ['../a00320.html', 1, '']]],\n+ ['gomory_5fhu_2eh_2', ['gomory_hu.h', ['../a00254.html', 1, '']]],\n+ ['graph_2eh_3', ['graph.h', ['../a00488.html', 1, '']]],\n+ ['graph_5fcomponents_2eh_4', ['graph_components.h', ['../a00491.html', 1, '']]],\n+ ['graph_5fto_5feps_2eh_5', ['graph_to_eps.h', ['../a00299.html', 1, '']]],\n+ ['graph_5fto_5feps_5fdemo_2ecc_6', ['graph_to_eps_demo.cc', ['../a00014.html', 1, '']]],\n+ ['greedy_5ftsp_2eh_7', ['greedy_tsp.h', ['../a00269.html', 1, '']]],\n+ ['grid_5fgraph_2eh_8', ['grid_graph.h', ['../a00368.html', 1, '']]],\n+ ['grosso_5flocatelli_5fpullan_5fmc_2eh_9', ['grosso_locatelli_pullan_mc.h', ['../a00203.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/files_7.js", "source2": "./usr/share/doc/lemon/html/search/files_7.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,7 +1,7 @@\n var searchData = [\n- ['hao_5forlin_2eh_0', ['hao_orlin.h', ['../a00338.html', 1, '']]],\n- ['hartmann_5forlin_5fmmc_2eh_1', ['hartmann_orlin_mmc.h', ['../a00389.html', 1, '']]],\n- ['heap_2eh_2', ['heap.h', ['../a00491.html', 1, '']]],\n- ['howard_5fmmc_2eh_3', ['howard_mmc.h', ['../a00344.html', 1, '']]],\n- ['hypercube_5fgraph_2eh_4', ['hypercube_graph.h', ['../a00182.html', 1, '']]]\n+ ['hao_5forlin_2eh_0', ['hao_orlin.h', ['../a00341.html', 1, '']]],\n+ ['hartmann_5forlin_5fmmc_2eh_1', ['hartmann_orlin_mmc.h', ['../a00323.html', 1, '']]],\n+ ['heap_2eh_2', ['heap.h', ['../a00485.html', 1, '']]],\n+ ['howard_5fmmc_2eh_3', ['howard_mmc.h', ['../a00404.html', 1, '']]],\n+ ['hypercube_5fgraph_2eh_4', ['hypercube_graph.h', ['../a00266.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/files_8.js", "source2": "./usr/share/doc/lemon/html/search/files_8.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var searchData = [\n- ['insertion_5ftsp_2eh_0', ['insertion_tsp.h', ['../a00221.html', 1, '']]]\n+ ['insertion_5ftsp_2eh_0', ['insertion_tsp.h', ['../a00380.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/files_9.js", "source2": "./usr/share/doc/lemon/html/search/files_9.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,4 +1,4 @@\n var searchData = [\n- ['karp_5fmmc_2eh_0', ['karp_mmc.h', ['../a00419.html', 1, '']]],\n- ['kruskal_2eh_1', ['kruskal.h', ['../a00176.html', 1, '']]]\n+ ['karp_5fmmc_2eh_0', ['karp_mmc.h', ['../a00356.html', 1, '']]],\n+ ['kruskal_2eh_1', ['kruskal.h', ['../a00395.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/files_a.js", "source2": "./usr/share/doc/lemon/html/search/files_a.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,12 +1,12 @@\n var searchData = [\n ['lgf_2dgen_2ecc_0', ['lgf-gen.cc', ['../a00497.html', 1, '']]],\n- ['lgf_5fdemo_2ecc_1', ['lgf_demo.cc', ['../a00014.html', 1, '']]],\n- ['lgf_5freader_2eh_2', ['lgf_reader.h', ['../a00350.html', 1, '']]],\n+ ['lgf_5fdemo_2ecc_1', ['lgf_demo.cc', ['../a00002.html', 1, '']]],\n+ ['lgf_5freader_2eh_2', ['lgf_reader.h', ['../a00392.html', 1, '']]],\n ['lgf_5fwriter_2eh_3', ['lgf_writer.h', ['../a00164.html', 1, '']]],\n- ['list_5fgraph_2eh_4', ['list_graph.h', ['../a00386.html', 1, '']]],\n- ['lp_2eh_5', ['lp.h', ['../a00212.html', 1, '']]],\n- ['lp_5fbase_2ecc_6', ['lp_base.cc', ['../a00215.html', 1, '']]],\n- ['lp_5fbase_2eh_7', ['lp_base.h', ['../a00299.html', 1, '']]],\n- ['lp_5fskeleton_2ecc_8', ['lp_skeleton.cc', ['../a00341.html', 1, '']]],\n- ['lp_5fskeleton_2eh_9', ['lp_skeleton.h', ['../a00269.html', 1, '']]]\n+ ['list_5fgraph_2eh_4', ['list_graph.h', ['../a00206.html', 1, '']]],\n+ ['lp_2eh_5', ['lp.h', ['../a00188.html', 1, '']]],\n+ ['lp_5fbase_2ecc_6', ['lp_base.cc', ['../a00224.html', 1, '']]],\n+ ['lp_5fbase_2eh_7', ['lp_base.h', ['../a00377.html', 1, '']]],\n+ ['lp_5fskeleton_2ecc_8', ['lp_skeleton.cc', ['../a00374.html', 1, '']]],\n+ ['lp_5fskeleton_2eh_9', ['lp_skeleton.h', ['../a00419.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/files_b.js", "source2": "./usr/share/doc/lemon/html/search/files_b.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,9 +1,9 @@\n var searchData = [\n ['maps_2eh_0', ['maps.h', ['../a11517.html', 1, '(Global Namespace)'],\n- ['../a00383.html', 1, '(Global Namespace)']\n+ ['../a00389.html', 1, '(Global Namespace)']\n ]],\n- ['matching_2eh_1', ['matching.h', ['../a00377.html', 1, '']]],\n- ['math_2eh_2', ['math.h', ['../a00245.html', 1, '']]],\n- ['max_5fcardinality_5fsearch_2eh_3', ['max_cardinality_search.h', ['../a00422.html', 1, '']]],\n- ['min_5fcost_5farborescence_2eh_4', ['min_cost_arborescence.h', ['../a00200.html', 1, '']]]\n+ ['matching_2eh_1', ['matching.h', ['../a00170.html', 1, '']]],\n+ ['math_2eh_2', ['math.h', ['../a00422.html', 1, '']]],\n+ ['max_5fcardinality_5fsearch_2eh_3', ['max_cardinality_search.h', ['../a00179.html', 1, '']]],\n+ ['min_5fcost_5farborescence_2eh_4', ['min_cost_arborescence.h', ['../a00239.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/files_c.js", "source2": "./usr/share/doc/lemon/html/search/files_c.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,6 +1,6 @@\n var searchData = [\n- ['nagamochi_5fibaraki_2eh_0', ['nagamochi_ibaraki.h', ['../a00293.html', 1, '']]],\n- ['nauty_5freader_2eh_1', ['nauty_reader.h', ['../a00308.html', 1, '']]],\n- ['nearest_5fneighbor_5ftsp_2eh_2', ['nearest_neighbor_tsp.h', ['../a00188.html', 1, '']]],\n- ['network_5fsimplex_2eh_3', ['network_simplex.h', ['../a00416.html', 1, '']]]\n+ ['nagamochi_5fibaraki_2eh_0', ['nagamochi_ibaraki.h', ['../a00278.html', 1, '']]],\n+ ['nauty_5freader_2eh_1', ['nauty_reader.h', ['../a00218.html', 1, '']]],\n+ ['nearest_5fneighbor_5ftsp_2eh_2', ['nearest_neighbor_tsp.h', ['../a00410.html', 1, '']]],\n+ ['network_5fsimplex_2eh_3', ['network_simplex.h', ['../a00332.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/files_d.js", "source2": "./usr/share/doc/lemon/html/search/files_d.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var searchData = [\n- ['opt2_5ftsp_2eh_0', ['opt2_tsp.h', ['../a00410.html', 1, '']]]\n+ ['opt2_5ftsp_2eh_0', ['opt2_tsp.h', ['../a00335.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/files_e.js", "source2": "./usr/share/doc/lemon/html/search/files_e.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,8 +1,8 @@\n var searchData = [\n- ['pairing_5fheap_2eh_0', ['pairing_heap.h', ['../a00227.html', 1, '']]],\n+ ['pairing_5fheap_2eh_0', ['pairing_heap.h', ['../a00251.html', 1, '']]],\n ['path_2eh_1', ['path.h', ['../a11520.html', 1, '(Global Namespace)'],\n- ['../a00266.html', 1, '(Global Namespace)']\n+ ['../a00338.html', 1, '(Global Namespace)']\n ]],\n- ['planarity_2eh_2', ['planarity.h', ['../a00185.html', 1, '']]],\n- ['preflow_2eh_3', ['preflow.h', ['../a00404.html', 1, '']]]\n+ ['planarity_2eh_2', ['planarity.h', ['../a00227.html', 1, '']]],\n+ ['preflow_2eh_3', ['preflow.h', ['../a00413.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/search/files_f.js", "source2": "./usr/share/doc/lemon/html/search/files_f.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var searchData = [\n- ['quad_5fheap_2eh_0', ['quad_heap.h', ['../a00203.html', 1, '']]]\n+ ['quad_5fheap_2eh_0', ['quad_heap.h', ['../a00329.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00365.html", "source2": "./usr/share/doc/lemon/html/a00167.html", "comments": ["Files 9% similar despite different names"], "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-My Project: lemon/binomial_heap.h File Reference\n+My Project: lemon/base.cc File Reference\n \n \n \n \n \n \n \n@@ -70,36 +70,34 @@\n
    \n \n
    \n
    \n
    \n
    \n-Classes |\n-Namespaces
    \n-
    binomial_heap.h File Reference
    Data Structures » Heap Structures
    \n+Namespaces |\n+Variables
    \n+
    base.cc File Reference
    \n \n
    \n-
    #include <vector>
    \n-#include <utility>
    \n-#include <functional>
    \n-#include <lemon/math.h>
    \n-#include <lemon/counter.h>
    \n+
    #include <lemon/tolerance.h>
    \n+#include <lemon/core.h>
    \n+#include <lemon/time_measure.h>
    \n
    \n-\n-\n-\n-\n-

    \n-Classes

    class  BinomialHeap< PR, IM, CMP >
     Binomial heap data structure. More...
     
    \n \n \n \n \n+

    \n Namespaces

    namespace  lemon
     The namespace of LEMON.
     
    \n+\n+\n+\n+\n

    \n+Variables

    const Invalid INVALID = Invalid()
     Invalid iterators.
     
    \n
    \n \n
    \n Generated on Mon Jul 25 2022 18:36:57 for My Project by \"doxygen\"/ 1.9.8\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,27 +5,24 @@\n \n My Project\n \n Loading...\n Searching...\n No Matches\n * lemon\n-Classes | Namespaces\n-binomial_heap.h File Reference\n-Data_Structures \u00bb Heap_Structures\n-#include \n-#include \n-#include \n-#include \n-#include \n- Classes\n-class \u00a0BinomialHeap<_PR,_IM,_CMP_>\n-\u00a0 Binomial heap data structure. More...\n-\u00a0\n+Namespaces | Variables\n+base.cc File Reference\n+#include \n+#include \n+#include \n Namespaces\n namespace \u00a0lemon\n \u00a0 The namespace of LEMON.\n \u00a0\n+ Variables\n+const Invalid\u00a0INVALID = Invalid()\n+\u00a0 Invalid iterators.\n+\u00a0\n \n ===============================================================================\n Generated on Mon Jul 25 2022 18:36:57 for My Project by\u00a0[doxygen]\n 1.9.8\n"}]}, {"source1": "./usr/share/doc/lemon/html/a00479.html", "source2": "./usr/share/doc/lemon/html/a00461.html", "comments": ["Files identical despite different names"], "unified_diff": null}]}]}]}]}