/usr/bin/diffoscope --timeout 7200 --html /srv/reproducible-results/rbuild-debian/r-b-build.L0MwzBhL/liblemon_1.3.1+dfsg-6.diffoscope.html --text /srv/reproducible-results/rbuild-debian/r-b-build.L0MwzBhL/liblemon_1.3.1+dfsg-6.diffoscope.txt --json /srv/reproducible-results/rbuild-debian/r-b-build.L0MwzBhL/liblemon_1.3.1+dfsg-6.diffoscope.json --profile=- /srv/reproducible-results/rbuild-debian/r-b-build.L0MwzBhL/b1/liblemon_1.3.1+dfsg-6_armhf.changes /srv/reproducible-results/rbuild-debian/r-b-build.L0MwzBhL/b2/liblemon_1.3.1+dfsg-6

⊟

1.6 MB

/srv/reproducible-results/rbuild-debian/r-b-build.L0MwzBhL/b1/liblemon_1.3.1+dfsg-6_armhf.changes vs.

/srv/reproducible-results/rbuild-debian/r-b-build.L0MwzBhL/b2/liblemon_1.3.1+dfsg-6_armhf.changes ¶

⊟

697 B

Files ¶

⊟

1.6 MB

liblemon-doc_1.3.1+dfsg-6_all.deb ¶

⊟

452 B

file list ¶

⊟

1.89 KB

control.tar.xz ¶

⊟

1.87 KB

control.tar ¶

⊟

1.84 KB

./md5sums ¶

⊟

30.0 B

./md5sums ¶

Files differ

⊟

1.8 KB

line order ¶

⊟

1.59 MB

data.tar.xz ¶

⊟

1.59 MB

data.tar ¶

⊟

26.9 KB

file list ¶

⊟

3.71 KB

⊟

37.4 KB

⊟

9.87 KB

⊟

1.67 KB

⊟

7.05 KB

⊟

1.28 KB

⊟

14.1 KB

⊟

1.65 KB

⊟

7.92 KB

⊟

1.35 KB

⊟

8.82 KB

⊟

1.57 KB

⊟

8.17 KB

⊟

1.38 KB

⊟

8.25 KB

⊟

1.28 KB

⊟

7.76 KB

⊟

1.08 KB

⊟

9.15 KB

⊟

1.63 KB

⊟

11.6 KB

⊟

1.98 KB

⊟

16.6 KB

⊟

3.22 KB

⊟

11.3 KB

⊟

2.0 KB

⊟

5.32 KB

⊟

966 B

⊟

7.79 KB

⊟

1.26 KB

⊟

11.2 KB

⊟

2.35 KB

⊟

9.0 KB

⊟

1.29 KB

⊟

4.39 KB

⊟

731 B

⊟

7.62 KB

⊟

1.15 KB

⊟

7.52 KB

⊟

1.09 KB

⊟

8.81 KB

⊟

1.59 KB

⊟

8.13 KB

⊟

1.35 KB

⊟

15.5 KB

⊟

2.62 KB

⊟

32.7 KB

⊟

5.35 KB

⊟

3.85 KB

⊟

534 B

⊟

9.6 KB

⊟

1.64 KB

⊟

19.6 KB

⊟

3.62 KB

⊟

13.0 KB

⊟

1.97 KB

⊟

8.83 KB

⊟

1.5 KB

⊟

13.7 KB

⊟

2.73 KB

⊟

7.16 KB

⊟

1.19 KB

⊟

6.2 KB

⊟

1.03 KB

⊟

6.2 KB

⊟

1.13 KB

⊟

34.1 KB

⊟

6.36 KB

⊟

15.4 KB

⊟

2.47 KB

⊟

5.78 KB

⊟

1020 B

⊟

7.94 KB

⊟

1.32 KB

⊟

6.06 KB

⊟

979 B

⊟

8.81 KB

⊟

1.58 KB

⊟

8.71 KB

⊟

1.27 KB

⊟

4.1 KB

⊟

593 B

⊟

14.6 KB

⊟

2.34 KB

⊟

15.0 KB

⊟

2.89 KB

⊟

8.49 KB

⊟

1.51 KB

⊟

5.04 KB

⊟

856 B

⊟

17.7 KB

⊟

3.04 KB

⊟

8.29 KB

⊟

1.41 KB

⊟

28.7 KB

⊟

4.68 KB

⊟

4.66 KB

⊟

727 B

⊟

6.95 KB

⊟

1.22 KB

⊟

9.63 KB

⊟

1.43 KB

⊟

9.09 KB

⊟

1.41 KB

⊟

4.86 KB

⊟

775 B

⊟

7.08 KB

⊟

1.23 KB

⊟

4.51 KB

⊟

771 B

⊟

29.2 KB

⊟

5.32 KB

⊟

5.9 KB

⊟

1.34 KB

⊟

5.28 KB

⊟

942 B

⊟

15.6 KB

⊟

2.57 KB

⊟

4.57 KB

⊟

871 B

⊟

17.4 KB

⊟

3.13 KB

⊟

7.01 KB

⊟

987 B

⊟

8.76 KB

⊟

1.42 KB

⊟

21.2 KB

⊟

3.52 KB

⊟

7.96 KB

⊟

1.33 KB

⊟

15.6 KB

⊟

2.39 KB

⊟

6.09 KB

⊟

956 B

⊟

7.54 KB

⊟

1.26 KB

⊟

12.3 KB

⊟

2.16 KB

⊟

14.7 KB

⊟

2.46 KB

⊟

6.15 KB

⊟

1.03 KB

⊟

51.9 KB

⊟

8.69 KB

⊟

7.78 KB

⊟

1.32 KB

⊟

53.3 KB

⊟

8.9 KB

⊟

8.7 KB

⊟

1.38 KB

⊟

6.71 KB

⊟

1.07 KB

⊟

6.25 KB

⊟

1.06 KB

⊟

14.2 KB

⊟

2.77 KB

⊟

9.48 KB

⊟

1.57 KB

⊟

8.22 KB

⊟

1.47 KB

⊟

4.57 KB

⊟

682 B

⊟

9.8 KB

⊟

1.62 KB

⊟

4.92 KB

⊟

850 B

⊟

7.89 KB

⊟

1.4 KB

⊟

17.1 KB

⊟

2.85 KB

⊟

17.6 KB

⊟

2.5 KB

⊟

5.28 KB

⊟

804 B

⊟

18.7 KB

⊟

2.33 KB

⊟

8.81 KB

⊟

1.31 KB

⊟

30.0 KB

⊟

5.23 KB

⊟

24.6 KB

⊟

4.26 KB

⊟

17.6 KB

⊟

2.59 KB

⊟

3.11 KB

⊟

1.72 KB

⊟

2.61 KB

⊟

6.2 KB

⊟

2.51 KB

⊟

2.37 KB

⊟

2.34 KB

⊟

7.01 KB

⊟

2.47 KB

⊟

2.7 KB

⊟

3.88 KB

⊟

4.14 KB

⊟

3.18 KB

⊟

3.42 KB

⊟

4.41 KB

⊟

3.42 KB

⊟

3.5 KB

⊟

2.68 KB

⊟

3.12 KB

⊟

2.34 KB

⊟

4.92 KB

⊟

2.04 KB

⊟

2.04 KB

⊟

4.51 KB

⊟

5.17 KB

⊟

3.26 KB

⊟

4.99 KB

⊟

2.16 KB

⊟

3.96 KB

⊟

2.22 KB

⊟

1.96 KB

⊟

1.91 KB

⊟

4.07 KB

⊟

2.62 KB

⊟

1.1 KB

⊟

3.87 KB

⊟

2.77 KB

⊟

2.61 KB

⊟

1.67 KB

⊟

1.66 KB

⊟

68.0 KB

⊟

1.71 KB

⊟

2.69 KB

⊟

5.12 KB

⊟

60.4 KB

⊟

96.7 KB

⊟

96.6 KB

⊟

96.6 KB

⊟

7.01 KB

⊟

6.92 KB

⊟

4.58 KB

⊟

4.5 KB

⊟

1.57 KB

⊟

1.48 KB

⊟

5.67 KB

⊟

5.59 KB

⊟

958 B

⊟

872 B

⊟

2.49 KB

⊟

2.4 KB

⊟

6.02 KB

⊟

5.93 KB

⊟

2.7 KB

⊟

2.61 KB

⊟

1.62 KB

⊟

1.53 KB

⊟

1.37 KB

⊟

1.28 KB

⊟

4.52 KB

⊟

4.43 KB

⊟

10.9 KB

⊟

10.8 KB

⊟

18.2 KB

⊟

18.1 KB

⊟

8.61 KB

⊟

8.53 KB

⊟

5.79 KB

⊟

5.71 KB

⊟

4.07 KB

⊟

3.99 KB

⊟

7.28 KB

⊟

7.2 KB

⊟

5.03 KB

⊟

4.95 KB

⊟

1.66 KB

⊟

1.58 KB

⊟

1.81 KB

⊟

1.73 KB

⊟

4.63 KB

⊟

4.55 KB

⊟

654 B

⊟

566 B

⊟

1.11 KB

⊟

1.02 KB

⊟

712 B

⊟

622 B

⊟

864 B

⊟

774 B

⊟

526 B

⊟

436 B

⊟

296 B

⊟

206 B

⊟

292 B

⊟

202 B

⊟

2.35 KB

⊟

2.26 KB

⊟

1.05 KB

⊟

990 B

⊟

834 B

⊟

746 B

⊟

626 B

⊟

538 B

⊟

1.66 KB

⊟

1.58 KB

⊟

918 B

⊟

830 B

⊟

314 B

⊟

226 B

⊟

426 B

⊟

338 B

⊟

1.4 KB

⊟

1.32 KB

⊟

997 B

⊟

909 B

⊟

846 B

⊟

758 B

⊟

294 B

⊟

206 B

⊟

773 B

⊟

685 B

⊟

298 B

⊟

210 B

⊟

5.74 KB

./usr/share/doc/lemon/html/a00365.html vs.

Files 9% similar despite different names

⊟

865 B

⊟

115 B

./usr/share/doc/lemon/html/a00479.html vs.

Files identical despite different names


Offset 1, 7 lines modified		Offset 1, 7 lines modified

1	·f6a813914388c0f9544b4e1f1d0d1409·322252·libdevel·optional·liblemon-dev_1.3.1+dfsg-6_armhf.deb	1	·f6a813914388c0f9544b4e1f1d0d1409·322252·libdevel·optional·liblemon-dev_1.3.1+dfsg-6_armhf.deb
2	·~~fce7~~7~~5d1f731ed~~479~~20c87604d20aac0~~·347~~6976~~·doc·optional·liblemon-doc_1.3.1+dfsg-6_all.deb	2	·2b3be72465e075c495c39d2bb41f324a·3477388·doc·optional·liblemon-doc_1.3.1+dfsg-6_all.deb
3	·e1c8e9e30f07b1d73854ef9fd6e80e23·2680236·debug·optional·liblemon-utils-dbgsym_1.3.1+dfsg-6_armhf.deb	3	·e1c8e9e30f07b1d73854ef9fd6e80e23·2680236·debug·optional·liblemon-utils-dbgsym_1.3.1+dfsg-6_armhf.deb
4	·ab053ab59d47550584f5d12f8b4830e6·163884·science·optional·liblemon-utils_1.3.1+dfsg-6_armhf.deb	4	·ab053ab59d47550584f5d12f8b4830e6·163884·science·optional·liblemon-utils_1.3.1+dfsg-6_armhf.deb
5	·a4bf1acc4d8049238b7c44658a8f3a07·519204·debug·optional·liblemon1.3.1-dbgsym_1.3.1+dfsg-6_armhf.deb	5	·a4bf1acc4d8049238b7c44658a8f3a07·519204·debug·optional·liblemon1.3.1-dbgsym_1.3.1+dfsg-6_armhf.deb
6	·32d97a3a70264a571bcc3d1784b33d06·47976·libs·optional·liblemon1.3.1_1.3.1+dfsg-6_armhf.deb	6	·32d97a3a70264a571bcc3d1784b33d06·47976·libs·optional·liblemon1.3.1_1.3.1+dfsg-6_armhf.deb


Offset 1, 3 lines modified		Offset 1, 3 lines modified
1	-rw-r--r--···0········0········0········4·2022-07-25·18:36:57.000000·debian-binary	1	-rw-r--r--···0········0········0········4·2022-07-25·18:36:57.000000·debian-binary
2	-rw-r--r--···0········0········0····40~~096~~·2022-07-25·18:36:57.000000·control.tar.xz	2	-rw-r--r--···0········0········0····40272·2022-07-25·18:36:57.000000·control.tar.xz
3	-rw-r--r--···0········0········0··3436~~688~~·2022-07-25·18:36:57.000000·data.tar.xz	3	-rw-r--r--···0········0········0··3436924·2022-07-25·18:36:57.000000·data.tar.xz


Offset 2, 110 lines modified		Offset 2, 110 lines modified
2	drwxr-xr-x···0·root·········(0)·root·········(0)········0·2022-07-25·18:36:57.000000·./usr/	2	drwxr-xr-x···0·root·········(0)·root·········(0)········0·2022-07-25·18:36:57.000000·./usr/
3	drwxr-xr-x···0·root·········(0)·root·········(0)········0·2022-07-25·18:36:57.000000·./usr/share/	3	drwxr-xr-x···0·root·········(0)·root·········(0)········0·2022-07-25·18:36:57.000000·./usr/share/
4	drwxr-xr-x···0·root·········(0)·root·········(0)········0·2022-07-25·18:36:57.000000·./usr/share/doc/	4	drwxr-xr-x···0·root·········(0)·root·········(0)········0·2022-07-25·18:36:57.000000·./usr/share/doc/
5	drwxr-xr-x···0·root·········(0)·root·········(0)········0·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/	5	drwxr-xr-x···0·root·········(0)·root·········(0)········0·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/
6	drwxr-xr-x···0·root·········(0)·root·········(0)········0·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/	6	drwxr-xr-x···0·root·········(0)·root·········(0)········0·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/
7	-rw-r--r--···0·root·········(0)·root·········(0)·····1335·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/_formulas.tex.gz	7	-rw-r--r--···0·root·········(0)·root·········(0)·····1335·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/_formulas.tex.gz
8	-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	8	-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
9	-rw-r--r--···0·root·········(0)·root·········(0)····~~21942~~·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00005.html	9	-rw-r--r--···0·root·········(0)·root·········(0)····13055·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00002.html
10	-rw-r--r--···0·root·········(0)·root·········(0)····15571·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00008.html	10	-rw-r--r--···0·root·········(0)·root·········(0)····15571·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00008.html
11	-rw-r--r--···0·root·········(0)·root·········(0)····~~13055~~·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00014.html	11	-rw-r--r--···0·root·········(0)·root·········(0)····21942·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00014.html
12	-rw-r--r--···0·root·········(0)·root·········(0)·····6753·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00164.html	12	-rw-r--r--···0·root·········(0)·root·········(0)·····6753·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00164.html
13	-rw-r--r--···0·root·········(0)·root·········(0)·····4138·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00170.html
14	-rw-r--r--···0·root·········(0)·root·········(0)····12365·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00173.html
15	-rw-r--r--···0·root·········(0)·root·········(0)·····5~~479~~·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00176.html	13	-rw-r--r--···0·root·········(0)·root·········(0)·····5091·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00167.html
		14	-rw-r--r--···0·root·········(0)·root·········(0)·····7225·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00170.html
		15	-rw-r--r--···0·root·········(0)·root·········(0)·····5518·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00173.html
16	-rw-r--r--···0·root·········(0)·root·········(0)·····4676·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00179.html	16	-rw-r--r--···0·root·········(0)·root·········(0)·····6608·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00176.html
		17	-rw-r--r--···0·root·········(0)·root·········(0)·····8570·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00179.html
17	-rw-r--r--···0·root·········(0)·root·········(0)·····5404·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00182.html	18	-rw-r--r--···0·root·········(0)·root·········(0)·····7457·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00182.html
18	-rw-r--r--···0·root·········(0)·root·········(0)·····~~7538~~·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00185.html	19	-rw-r--r--···0·root·········(0)·root·········(0)·····4771·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00185.html
19	-rw-r--r--···0·root·········(0)·root·········(0)·····~~5029~~·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00188.html	20	-rw-r--r--···0·root·········(0)·root·········(0)·····6907·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00188.html
20	-rw-r--r--···0·root·········(0)·root·········(0)·····6498·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00191.html
21	-rw-r--r--···0·root·········(0)·root·········(0)·····5489·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00194.html
22	-rw-r--r--···0·root·········(0)·root·········(0)·····7252·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00197.html	21	-rw-r--r--···0·root·········(0)·root·········(0)·····7252·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00191.html
23	-rw-r--r--···0·root·········(0)·root·········(0)·····8558·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00200.html
24	-rw-r--r--···0·root·········(0)·root·········(0)·····4824·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00203.html
25	-rw-r--r--···0·root·········(0)·root·········(0)·····5303·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00206.html
26	-rw-r--r--···0·root·········(0)·root·········(0)·····9418·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00~~209~~.html	22	-rw-r--r--···0·root·········(0)·root·········(0)·····9418·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00194.html
		23	-rw-r--r--···0·root·········(0)·root·········(0)····11805·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00197.html
		24	-rw-r--r--···0·root·········(0)·root·········(0)·····6564·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00200.html
		25	-rw-r--r--···0·root·········(0)·root·········(0)·····5559·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00203.html
		26	-rw-r--r--···0·root·········(0)·root·········(0)·····7284·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00206.html
		27	-rw-r--r--···0·root·········(0)·root·········(0)·····5024·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00209.html
27	-rw-r--r--···0·root·········(0)·root·········(0)·····6907·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00212.html	28	-rw-r--r--···0·root·········(0)·root·········(0)·····6079·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00212.html
28	-rw-r--r--···0·root·········(0)·root·········(0)·····~~3960~~·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00215.html	29	-rw-r--r--···0·root·········(0)·root·········(0)·····5275·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00215.html
29	-rw-r--r--···0·root·········(0)·root·········(0)·····~~6564~~·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00218.html	30	-rw-r--r--···0·root·········(0)·root·········(0)·····5128·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00218.html
30	-rw-r--r--···0·root·········(0)·root·········(0)·····5052·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00221.html	31	-rw-r--r--···0·root·········(0)·root·········(0)·····7028·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00221.html
		32	-rw-r--r--···0·root·········(0)·root·········(0)·····3960·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00224.html
		33	-rw-r--r--···0·root·········(0)·root·········(0)·····7538·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00227.html
		34	-rw-r--r--···0·root·········(0)·root·········(0)····13145·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00230.html
		35	-rw-r--r--···0·root·········(0)·root·········(0)····25466·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00233.html
		36	-rw-r--r--···0·root·········(0)·root·········(0)·····4676·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00236.html
		37	-rw-r--r--···0·root·········(0)·root·········(0)·····8558·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00239.html
31	-rw-r--r--···0·root·········(0)·root·········(0)·····8889·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00224.html	38	-rw-r--r--···0·root·········(0)·root·········(0)·····8889·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00242.html
32	-rw-r--r--···0·root·········(0)·root·········(0)·····4891·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00227.html
33	-rw-r--r--···0·root·········(0)·root·········(0)·····5~~568~~·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00230.html	39	-rw-r--r--···0·root·········(0)·root·········(0)·····5303·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00245.html
34	-rw-r--r--···0·root·········(0)·root·········(0)·····7771·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00233.html	40	-rw-r--r--···0·root·········(0)·root·········(0)·····7771·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00248.html
35	-rw-r--r--···0·root·········(0)·root·········(0)·····4~~688~~·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00236.html	41	-rw-r--r--···0·root·········(0)·root·········(0)·····4891·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00251.html
36	-rw-r--r--···0·root·········(0)·root·········(0)·····4771·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00239.html
37	-rw-r--r--···0·root·········(0)·root·········(0)····13367·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00242.html
38	-rw-r--r--···0·root·········(0)·root·········(0)····11096·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00245.html
39	-rw-r--r--···0·root·········(0)·root·········(0)·····5159·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00248.html
40	-rw-r--r--···0·root·········(0)·root·········(0)····11805·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00251.html
41	-rw-r--r--···0·root·········(0)·root·········(0)·····6079·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00254.html	42	-rw-r--r--···0·root·········(0)·root·········(0)·····6022·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00254.html
42	-rw-r--r--···0·root·········(0)·root·········(0)·····6317·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00257.html
43	-rw-r--r--···0·root·········(0)·root·········(0)·····4047·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00260.html
44	-rw-r--r--···0·root·········(0)·root·········(0)·····9099·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00263.html
45	-rw-r--r--···0·root·········(0)·root·········(0)····13386·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00266.html
46	-rw-r--r--···0·root·········(0)·root·········(0)·····5776·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00269.html
47	-rw-r--r--···0·root·········(0)·root·········(0)·····6194·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00272.html
48	-rw-r--r--···0·root·········(0)·root·········(0)·····5091·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00275.html
49	-rw-r--r--···0·root·········(0)·root·········(0)·····5743·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00278.html
50	-rw-r--r--···0·root·········(0)·root·········(0)·····8409·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00281.html
51	-rw-r--r--···0·root·········(0)·root·········(0)·····4807·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00284.html
52	-rw-r--r--···0·root·········(0)·root·········(0)·····4820·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00287.html	43	-rw-r--r--···0·root·········(0)·root·········(0)·····4820·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00257.html
53	-rw-r--r--···0·root·········(0)·root·········(0)·····6614·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00290.html	44	-rw-r--r--···0·root·········(0)·root·········(0)·····6614·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00260.html
54	-rw-r--r--···0·root·········(0)·root·········(0)····~~·7642~~·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00293.html	45	-rw-r--r--···0·root·········(0)·root·········(0)····24968·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00263.html
55	-rw-r--r--···0·root·········(0)·root·········(0)·····5244·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00296.html	46	-rw-r--r--···0·root·········(0)·root·········(0)·····5404·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00266.html
56	-rw-r--r--···0·root·········(0)·root·········(0)····~~1146~~6·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00299.html	47	-rw-r--r--···0·root·········(0)·root·········(0)·····4956·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00269.html
		48	-rw-r--r--···0·root·········(0)·root·········(0)·····5688·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00272.html
		49	-rw-r--r--···0·root·········(0)·root·········(0)·····5244·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00275.html
		50	-rw-r--r--···0·root·········(0)·root·········(0)·····7642·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00278.html
		51	-rw-r--r--···0·root·········(0)·root·········(0)·····4688·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00281.html
57	-rw-r--r--···0·root·········(0)·root·········(0)·····4801·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00~~302~~.html	52	-rw-r--r--···0·root·········(0)·root·········(0)·····4801·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00284.html
		53	-rw-r--r--···0·root·········(0)·root·········(0)····13145·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00287.html
		54	-rw-r--r--···0·root·········(0)·root·········(0)····11757·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00290.html
58	-rw-r--r--···0·root·········(0)·root·········(0)····25466·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00~~305~~.html	55	-rw-r--r--···0·root·········(0)·root·········(0)·····5408·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00293.html
		56	-rw-r--r--···0·root·········(0)·root·········(0)·····4896·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00296.html
		57	-rw-r--r--···0·root·········(0)·root·········(0)·····9099·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00299.html
		58	-rw-r--r--···0·root·········(0)·root·········(0)·····8133·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00302.html
59	-rw-r--r--···0·root·········(0)·root·········(0)·····5128·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00308.html	59	-rw-r--r--···0·root·········(0)·root·········(0)·····4138·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00305.html
60	-rw-r--r--···0·root·········(0)·root·········(0)·····5779·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00311.html
61	-rw-r--r--···0·root·········(0)·root·········(0)·····5631·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00314.html
62	-rw-r--r--···0·root·········(0)·root·········(0)·····7028·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00317.html
63	-rw-r--r--···0·root·········(0)·root·········(0)·····4039·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00320.html	60	-rw-r--r--···0·root·········(0)·root·········(0)·····4039·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00308.html
		61	-rw-r--r--···0·root·········(0)·root·········(0)·····5920·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00311.html
		62	-rw-r--r--···0·root·········(0)·root·········(0)·····8409·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00314.html
		63	-rw-r--r--···0·root·········(0)·root·········(0)·····6194·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00317.html
64	-rw-r--r--···0·root·········(0)·root·········(0)·····~~4956~~·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00323.html	64	-rw-r--r--···0·root·········(0)·root·········(0)·····5631·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00320.html
		65	-rw-r--r--···0·root·········(0)·root·········(0)·····6937·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00323.html
65	-rw-r--r--···0·root·········(0)·root·········(0)·····~~5275~~·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00326.html	66	-rw-r--r--···0·root·········(0)·root·········(0)·····4047·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00326.html
66	-rw-r--r--···0·root·········(0)·root·········(0)····24~~968~~·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00329.html	67	-rw-r--r--···0·root·········(0)·root·········(0)·····4824·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00329.html
67	-rw-r--r--···0·root·········(0)·root·········(0)·····5~~024~~·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00332.html	68	-rw-r--r--···0·root·········(0)·root·········(0)·····5100·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00332.html
68	-rw-r--r--···0·root·········(0)·root·········(0)·····~~5559~~·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00335.html	69	-rw-r--r--···0·root·········(0)·root·········(0)·····4812·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00335.html
		70	-rw-r--r--···0·root·········(0)·root·········(0)····13386·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00338.html
69	-rw-r--r--···0·root·········(0)·root·········(0)·····5305·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00338.html	71	-rw-r--r--···0·root·········(0)·root·········(0)·····5305·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00341.html
		72	-rw-r--r--···0·root·········(0)·root·········(0)····13367·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00344.html
		73	-rw-r--r--···0·root·········(0)·root·········(0)·····5743·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00347.html
		74	-rw-r--r--···0·root·········(0)·root·········(0)·····6466·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00350.html
		75	-rw-r--r--···0·root·········(0)·root·········(0)····11468·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00353.html
		76	-rw-r--r--···0·root·········(0)·root·········(0)·····6852·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00356.html
		77	-rw-r--r--···0·root·········(0)·root·········(0)·····5489·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00359.html
		78	-rw-r--r--···0·root·········(0)·root·········(0)·····6368·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00368.html
		79	-rw-r--r--···0·root·········(0)·root·········(0)·····4807·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00371.html
70	-rw-r--r--···0·root·········(0)·root·········(0)·····3972·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00341.html	80	-rw-r--r--···0·root·········(0)·root·········(0)·····3972·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00374.html
71	-rw-r--r--···0·root·········(0)·root·········(0)·····6870·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00344.html
72	-rw-r--r--···0·root·········(0)·root·········(0)·····5518·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00347.html
73	-rw-r--r--···0·root·········(0)·root·········(0)·····7172·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00350.html
74	-rw-r--r--···0·root·········(0)·root·········(0)····13145·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00353.html
75	-rw-r--r--···0·root·········(0)·root·········(0)·····5920·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00356.html
76	-rw-r--r--···0·root·········(0)·root·········(0)····13145·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00359.html
77	-rw-r--r--···0·root·········(0)·root·········(0)·····4999·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00365.html
78	-rw-r--r--···0·root·········(0)·root·········(0)·····4750·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00368.html
79	-rw-r--r--···0·root·········(0)·root·········(0)·····7457·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00371.html
80	-rw-r--r--···0·root·········(0)·root·········(0)····11468·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00374.html	81	-rw-r--r--···0·root·········(0)·root·········(0)····11466·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00377.html
81	-rw-r--r--···0·root·········(0)·root·········(0)·····7225·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00377.html
82	-rw-r--r--···0·root·········(0)·root·········(0)·····6022·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00380.html	82	-rw-r--r--···0·root·········(0)·root·········(0)·····5052·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00380.html
		83	-rw-r--r--···0·root·········(0)·root·········(0)·····5568·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00383.html
		84	-rw-r--r--···0·root·········(0)·root·········(0)·····5159·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00386.html
83	-rw-r--r--···0·root·········(0)·root·········(0)····43970·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00383.html	85	-rw-r--r--···0·root·········(0)·root·········(0)····43970·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00389.html
84	-rw-r--r--···0·root·········(0)·root·········(0)·····7~~284~~·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00386.html	86	-rw-r--r--···0·root·········(0)·root·········(0)·····7172·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00392.html
85	-rw-r--r--···0·root·········(0)·root·········(0)·····6937·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00389.html
86	-rw-r--r--···0·root·········(0)·root·········(0)·····6368·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00392.html
87	-rw-r--r--···0·root·········(0)·root·········(0)·····5408·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00395.html	87	-rw-r--r--···0·root·········(0)·root·········(0)·····5479·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00395.html
88	-rw-r--r--···0·root·········(0)·root·········(0)·····~~4896~~·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00398.html	88	-rw-r--r--···0·root·········(0)·root·········(0)·····6317·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00398.html
89	-rw-r--r--···0·root·········(0)·root·········(0)····11757·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00401.html	89	-rw-r--r--···0·root·········(0)·root·········(0)·····5779·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00401.html
90	-rw-r--r--···0·root·········(0)·root·········(0)·····7277·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00404.html	90	-rw-r--r--···0·root·········(0)·root·········(0)·····6870·2022-07-25·18:36:57.000000·./usr/share/doc/lemon/html/a00404.html
Max diff block lines reached; 2813/27491 bytes (10.23%) of diff not shown.


Offset 1, 13 lines modified		Offset 1, 14 lines modified
1	usr/share/doc/lemon/html/_formulas.tex.gz	1	usr/share/doc/lemon/html/_formulas.tex.gz
2	usr/share/doc/lemon/html/_formulas_dark.tex.gz	2	usr/share/doc/lemon/html/_formulas_dark.tex.gz
3	usr/share/doc/lemon/html/a00005.html	3	usr/share/doc/lemon/html/a00002.html
4	usr/share/doc/lemon/html/a00008.html	4	usr/share/doc/lemon/html/a00008.html
5	usr/share/doc/lemon/html/a00014.html	5	usr/share/doc/lemon/html/a00014.html
6	usr/share/doc/lemon/html/a00164.html	6	usr/share/doc/lemon/html/a00164.html
		7	usr/share/doc/lemon/html/a00167.html
7	usr/share/doc/lemon/html/a00170.html	8	usr/share/doc/lemon/html/a00170.html
8	usr/share/doc/lemon/html/a00173.html	9	usr/share/doc/lemon/html/a00173.html
9	usr/share/doc/lemon/html/a00176.html	10	usr/share/doc/lemon/html/a00176.html
10	usr/share/doc/lemon/html/a00179.html	11	usr/share/doc/lemon/html/a00179.html
11	usr/share/doc/lemon/html/a00182.html	12	usr/share/doc/lemon/html/a00182.html
12	usr/share/doc/lemon/html/a00185.html	13	usr/share/doc/lemon/html/a00185.html
13	usr/share/doc/lemon/html/a00188.html	14	usr/share/doc/lemon/html/a00188.html


Offset 93, 15 lines modified		Offset 93, 15 lines modified
93	<div·class="line"><span·class="comment">·*·This·software·is·provided·"AS·IS"·with·no·warranty·of·any·kind,</span></div>	93	<div·class="line"><span·class="comment">·*·This·software·is·provided·"AS·IS"·with·no·warranty·of·any·kind,</span></div>
94	<div·class="line"><span·class="comment">·*·express·or·implied,·and·with·no·claim·as·to·its·suitability·for·any</span></div>	94	<div·class="line"><span·class="comment">·*·express·or·implied,·and·with·no·claim·as·to·its·suitability·for·any</span></div>
95	<div·class="line"><span·class="comment">·*·purpose.</span></div>	95	<div·class="line"><span·class="comment">·*·purpose.</span></div>
96	<div·class="line"><span·class="comment">·*</span></div>	96	<div·class="line"><span·class="comment">·*</span></div>
97	<div·class="line"><span·class="comment">·*/</span></div>	97	<div·class="line"><span·class="comment">·*/</span></div>
98	<div·class="line">·</div>	98	<div·class="line">·</div>
99	<div·class="line">·</div>	99	<div·class="line">·</div>
100	<div·class="line"><span·class="preprocessor">#include·<<a·class="code"·href="a00254.html">lemon/arg_parser.h</a>></span></div>	100	<div·class="line"><span·class="preprocessor">#include·<<a·class="code"·href="a00212.html">lemon/arg_parser.h</a>></span></div>
101	<div·class="line">·</div>	101	<div·class="line">·</div>
102	<div·class="line"><span·class="keyword">using·namespace·</span><a·class="code·hl_namespace"·href="a00554.html">lemon</a>;</div>	102	<div·class="line"><span·class="keyword">using·namespace·</span><a·class="code·hl_namespace"·href="a00554.html">lemon</a>;</div>
103	<div·class="line"><span·class="keywordtype">int</span>·main(<span·class="keywordtype">int</span>·argc,·<span·class="keywordtype">char</span>·**argv)</div>	103	<div·class="line"><span·class="keywordtype">int</span>·main(<span·class="keywordtype">int</span>·argc,·<span·class="keywordtype">char</span>·**argv)</div>
104	<div·class="line">{</div>	104	<div·class="line">{</div>
105	<div·class="line">··<span·class="comment">//·Initialize·the·argument·parser</span></div>	105	<div·class="line">··<span·class="comment">//·Initialize·the·argument·parser</span></div>
106	<div·class="line">··<a·class="code·hl_class"·href="a01617.html">ArgParser</a>·ap(argc,·argv);</div>	106	<div·class="line">··<a·class="code·hl_class"·href="a01617.html">ArgParser</a>·ap(argc,·argv);</div>
107	<div·class="line">··<span·class="keywordtype">int</span>·i;</div>	107	<div·class="line">··<span·class="keywordtype">int</span>·i;</div>


Offset 1, 15 lines modified		Offset 1, 15 lines modified
1	<!DOCTYPE·html·PUBLIC·"-//W3C//DTD·XHTML·1.0·Transitional//EN"·"https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">	1	<!DOCTYPE·html·PUBLIC·"-//W3C//DTD·XHTML·1.0·Transitional//EN"·"https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
2	<html·xmlns="http://www.w3.org/1999/xhtml"·lang="en-US">	2	<html·xmlns="http://www.w3.org/1999/xhtml"·lang="en-US">
3	<head>	3	<head>
4	<meta·http-equiv="Content-Type"·content="text/xhtml;charset=UTF-8"/>	4	<meta·http-equiv="Content-Type"·content="text/xhtml;charset=UTF-8"/>
5	<meta·http-equiv="X-UA-Compatible"·content="IE=11"/>	5	<meta·http-equiv="X-UA-Compatible"·content="IE=11"/>
6	<meta·name="generator"·content="Doxygen·1.9.8"/>	6	<meta·name="generator"·content="Doxygen·1.9.8"/>
7	<meta·name="viewport"·content="width=device-width,·initial-scale=1"/>	7	<meta·name="viewport"·content="width=device-width,·initial-scale=1"/>
8	<title>My·Project:·demo/~~lgf~~_demo.cc·File·Reference</title>	8	<title>My·Project:·demo/graph_to_eps_demo.cc·File·Reference</title>
9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>	9	<link·href="tabs.css"·rel="stylesheet"·type="text/css"/>
10	<script·type="text/javascript"·src="jquery.js"></script>	10	<script·type="text/javascript"·src="jquery.js"></script>
11	<script·type="text/javascript"·src="dynsections.js"></script>	11	<script·type="text/javascript"·src="dynsections.js"></script>
12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>	12	<link·href="search/search.css"·rel="stylesheet"·type="text/css"/>
13	<script·type="text/javascript"·src="search/searchdata.js"></script>	13	<script·type="text/javascript"·src="search/searchdata.js"></script>
14	<script·type="text/javascript"·src="search/search.js"></script>	14	<script·type="text/javascript"·src="search/search.js"></script>
15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>	15	<link·href="doxygen.css"·rel="stylesheet"·type="text/css"·/>


Offset 5, 50 lines modified		Offset 5, 22 lines modified

5	My·Project	5	My·Project

6	Loading...	6	Loading...
7	Searching...	7	Searching...
8	No·Matches	8	No·Matches
9	····*·demo	9	····*·demo
10	~~lgf~~_demo.cc·File·Reference	10	graph_to_eps_demo.cc·File·Reference
11	Demo_Programs	11	Demo_Programs
12	***·Detailed·Description·***	12	***·Detailed·Description·***
		13	This·demo·program·shows·examples·how·to·use·the·function·graphToEps().·It·takes
		14	no·input·but·simply·creates·seven·.eps·files·demonstrating·the·capability·of
		15	graphToEps(),·and·showing·how·to·draw·directed·graphs,·how·to·handle·parallel
		16	egdes,·how·to·change·the·properties·(like·color,·shape,·size,·title·etc.)·of
		17	nodes·and·arcs·individually·using·appropriate·graph·maps.
13	This·program·gives·an·example·of·how·to·read·and·write·a·digraph·and·additional
14	maps·from/to·a·stream·or·a·file·using·the·LGF·format.
15	The·"digraph.lgf"·file:
16	@nodes
17	label
18	0
19	1
20	2
21	3
22	4
23	5
24	6
25	7
26	@arcs
27	label·capacity
28	0·1·0·16
29	0·2·1·12
30	0·3·2·20
31	1·2·3·10
32	1·4·4·10
33	1·5·5·13
34	2·3·6·10
35	2·4·7·8
36	2·6·8·8
37	5·3·9·20
38	3·6·10·25
39	4·7·11·15
40	5·7·12·15
41	6·7·13·18
42	@attributes
43	source·0
44	target·7
45	And·the·program·which·reads·it·and·prints·the·digraph·to·the·standard·output:
46	/·--·mode:·C++;·indent-tabs-mode:·nil;·-*-	18	/·--·mode:·C++;·indent-tabs-mode:·nil;·-*-
47	*	19	*
48	*·This·file·is·a·part·of·LEMON,·a·generic·C++·optimization·library.	20	*·This·file·is·a·part·of·LEMON,·a·generic·C++·optimization·library.
49	*	21	*
50	*·Copyright·(C)·2003-2009	22	*·Copyright·(C)·2003-2009
51	*·Egervary·Jeno·Kombinatorikus·Optimalizalasi·Kutatocsoport	23	*·Egervary·Jeno·Kombinatorikus·Optimalizalasi·Kutatocsoport
52	*·(Egervary·Research·Group·on·Combinatorial·Optimization,·EGRES).	24	*·(Egervary·Research·Group·on·Combinatorial·Optimization,·EGRES).


Offset 81, 17 lines modified		Offset 81, 17 lines modified
81	<div·class="contents">	81	<div·class="contents">
82	<div·class="textblock"><code>#include·<iostream></code><br·/>	82	<div·class="textblock"><code>#include·<iostream></code><br·/>
83	<code>#include·<fstream></code><br·/>	83	<code>#include·<fstream></code><br·/>
84	<code>#include·<sstream></code><br·/>	84	<code>#include·<sstream></code><br·/>
85	<code>#include·<algorithm></code><br·/>	85	<code>#include·<algorithm></code><br·/>
86	<code>#include·<vector></code><br·/>	86	<code>#include·<vector></code><br·/>
87	<code>#include·<functional></code><br·/>	87	<code>#include·<functional></code><br·/>
88	<code>#include·<<a·class="el"·href="a00~~329~~.html">lemon/core.h</a>></code><br·/>	88	<code>#include·<<a·class="el"·href="a00263.html">lemon/core.h</a>></code><br·/>
89	<code>#include·<<a·class="el"·href="a00383.html">lemon/maps.h</a>></code><br·/>	89	<code>#include·<<a·class="el"·href="a00389.html">lemon/maps.h</a>></code><br·/>
90	<code>#include·<<a·class="el"·href="a00~~347~~.html">lemon/concept_check.h</a>></code><br·/>	90	<code>#include·<<a·class="el"·href="a00173.html">lemon/concept_check.h</a>></code><br·/>
91	<code>#include·<<a·class="el"·href="a11517.html">lemon/concepts/maps.h</a>></code><br·/>	91	<code>#include·<<a·class="el"·href="a11517.html">lemon/concepts/maps.h</a>></code><br·/>
92	</div><table·class="memberdecls">	92	</div><table·class="memberdecls">
93	<tr·class="heading"><td·colspan="2"><h2·class="groupheader"><a·id="nested-classes"·name="nested-classes"></a>	93	<tr·class="heading"><td·colspan="2"><h2·class="groupheader"><a·id="nested-classes"·name="nested-classes"></a>
94	Classes</h2></td></tr>	94	Classes</h2></td></tr>
95	<tr·class="memitem:"><td·class="memItemLeft"·align="right"·valign="top">class· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a03201.html">DigraphWriter<·DGR·></a></td></tr>	95	<tr·class="memitem:"><td·class="memItemLeft"·align="right"·valign="top">class· </td><td·class="memItemRight"·valign="bottom"><a·class="el"·href="a03201.html">DigraphWriter<·DGR·></a></td></tr>
96	<tr·class="memdesc:"><td·class="mdescLeft"> </td><td·class="mdescRight"><a·class="el"·href="a11511.html">LGF</a>·writer·for·directed·graphs··<a·href="a03201.html#details">More...</a><br·/></td></tr>	96	<tr·class="memdesc:"><td·class="mdescLeft"> </td><td·class="mdescRight"><a·class="el"·href="a11511.html">LGF</a>·writer·for·directed·graphs··<a·href="a03201.html#details">More...</a><br·/></td></tr>
97	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>	97	<tr·class="separator:"><td·class="memSeparator"·colspan="2"> </td></tr>


Offset 5, 21 lines modified		Offset 5, 42 lines modified

5	My·Project	5	My·Project

6	Loading...	6	Loading...
7	Searching...	7	Searching...
8	No·Matches	8	No·Matches
9	····*·lemon	9	····*·lemon
10	Namespaces
11	cplex.cc·File·Reference
12	~~#include~~·~~<iostream>~~	10	Classes·\|·Namespaces
		11	matching.h·File·Reference
		12	Algorithms·»·Matching_Algorithms
13	#include·<vector>	13	#include·<vector>
		14	#include·<queue>
14	#include·<cs~~tri~~ng>	15	#include·<set>
		16	#include·<limits>
15	#include·<lemon/cplex.h>	17	#include·<lemon/core.h>
16	#include·<~~ilcplex/cplex~~.h>	18	#include·<lemon/unionfind.h>
		19	#include·<lemon/bin_heap.h>
		20	#include·<lemon/maps.h>
		21	#include·<lemon/fractional_matching.h>
		22	·Classes
		23	class· MaxMatching<_GR_>
		24	······Maximum·cardinality·matching·in·general·graphs.·More...
		25
		26	class· MaxWeightedMatching<_GR,_WM_>
		27	······Weighted·matching·in·general·graphs.·More...
		28
		29	class· MaxWeightedMatching<_GR,_WM_>::BlossomIt
		30	······Iterator·for·obtaining·the·nodes·of·a·blossom.·More...
		31
		32	class· MaxWeightedPerfectMatching<_GR,_WM_>
		33	······Weighted·perfect·matching·in·general·graphs.·More...
		34
		35	class· MaxWeightedPerfectMatching<_GR,_WM_>::BlossomIt
		36	······Iterator·for·obtaining·the·nodes·of·a·blossom.·More...
		37
17	·Namespaces	38	·Namespaces
18	namespace· lemon	39	namespace· lemon
19	··········The·namespace·of·LEMON.	40	··········The·namespace·of·LEMON.
20		41

21	===============================================================================	42	===============================================================================
22	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]	43	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]


Offset 5, 64 lines modified		Offset 5, 26 lines modified

5	My·Project	5	My·Project

6	Loading...	6	Loading...
7	Searching...	7	Searching...
8	No·Matches	8	No·Matches
9	····*·lemon	9	····*·lemon
		10	Namespaces·\|·Functions
		11	concept_check.h·File·Reference
10	Namespaces·\|·Variables
11	color.cc·File·Reference
12	#include·<lemon/color.h>
13	·Namespaces	12	·Namespaces
14	namespace· lemon	13	namespace· lemon
15	··········The·namespace·of·LEMON.	14	··········The·namespace·of·LEMON.
16		15
17	·Variables
18	const·Color WHITE·(1,·1,·1)
19	~~··········~~·~~White·~~c~~olor~~·cons~~tant.~~	16	·Functions
		17	·template<class·Concept·>
		18	void function_requires·()
20		19
21	const·Color BLACK·(0,·0,·0)
22	···········Black·color·constant.
23		20
24	const·Color RED·(1,·0,·0)
25	~~···········R~~ed·c~~olor~~·con~~stant.~~	21	·template<typename·Concept·,·typename·Type·>
		22	void checkConcept·()
26		23
27	const·Color GREEN·(0,·1,·0)
28	···········Green·color·constant.
29
30	const·Color BLUE·(0,·0,·1)
31	···········Blue·color·constant.
32
33	const·Color YELLOW·(1,·1,·0)
34	···········Yellow·color·constant.
35
36	const·Color MAGENTA·(1,·0,·1)
37	···········Magenta·color·constant.
38
39	const·Color CYAN·(0,·1,·1)
40	···········Cyan·color·constant.
41
42	const·Color GREY·(0,·0,·0)
43	···········Grey·color·constant.
44
45	const·Color DARK_RED·(.5,·0,·0)
46	···········Dark·red·color·constant.
47
48	const·Color DARK_GREEN·(0,.5,·0)
49	···········Dark·green·color·constant.
50
51	const·Color DARK_BLUE·(0,·0,.5)
52	···········Drak·blue·color·constant.
53
54	const·Color DARK_YELLOW·(.5,.5,·0)
55	···········Dark·yellow·color·constant.
56
57	const·Color DARK_MAGENTA·(.5,·0,.5)
58	···········Dark·magenta·color·constant.
59
60	const·Color DARK_CYAN·(0,.5,.5)
61	···········Dark·cyan·color·constant.
62		24

63	===============================================================================	25	===============================================================================
64	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]	26	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]
65	·····1.9.8	27	·····1.9.8


Offset 5, 30 lines modified		Offset 5, 37 lines modified

5	My·Project	5	My·Project

6	Loading...	6	Loading...
7	Searching...	7	Searching...
8	No·Matches	8	No·Matches
9	····*·lemon	9	····*·lemon
10	Namespaces·\|·Functions	10	Classes·\|·Namespaces·\|·Functions
11	krus~~kal~~.h·File·Reference	11	euler.h·File·Reference
		12	Algorithms·»·Connectivity_and_Other_Graph_Properties
		13	***·Detailed·Description·***
		14	This·file·provides·Euler·tour·iterators·and·a·function·to·check·if·a·(di)graph
		15	is·Eulerian.
12	Algorithms·»·Minimum_Spanning_Tree_Algorithms
13	#include·<algorithm>
14	#include·<vector>
15	#include·<lemon/unionfind.h>
16	#include·<lemon/maps.h>
17	#include·<lemon/core.h>	16	#include·<lemon/core.h>
18	#include·<lemon/b~~its/~~traits.h>	17	#include·<lemon/adaptors.h>
		18	#include·<lemon/connectivity.h>
		19	#include·<list>
		20	·Classes
		21	class· DiEulerIt<_GR_>
		22	······Euler·tour·iterator·for·digraphs.·More...
		23
		24	class· EulerIt<_GR_>
		25	······Euler·tour·iterator·for·graphs.·More...
		26
19	·Namespaces	27	·Namespaces
20	namespace· lemon	28	namespace· lemon
21	··········The·namespace·of·LEMON.	29	··········The·namespace·of·LEMON.
22		30
23	·Functions	31	·Functions
		32	template<typename·GR·>
		33	bool eulerian·(const·GR·&g)
		34	····Check·if·the·given·graph·is·Eulerian.
24	template<typename·Graph·,·typename·In·,·typename·Out·>
25	Value kruskal·(const·Graph·&g,·const·In·&in,·Out·&out)
26	·····Kruskal's·algorithm·for·finding·a·minimum·cost·spanning·tree·of·a·graph.

27		35

28	===============================================================================	36	===============================================================================
29	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]	37	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]
30	·····1.9.8	38	·····1.9.8


Offset 6, 21 lines modified		Offset 6, 43 lines modified
6	My·Project	6	My·Project

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·lemon	10	····*·lemon
11	Classes·\|·Namespaces	11	Classes·\|·Namespaces
12	clp.h·File·Reference
13	#include·<vector>
14	#inc~~lud~~e·~~<st~~ring>	12	max_cardinality_search.h·File·Reference
		13	Algorithms·»·Graph_Search
		14	#include·<lemon/bin_heap.h>
		15	#include·<lemon/bucket_heap.h>
		16	#include·<lemon/error.h>
15	#include·<lemon/~~lp_~~base.h>	17	#include·<lemon/maps.h>
		18	#include·<functional>
16	·Classes	19	·Classes
17	class· ClpLp
18	~~···~~·~~··Inte~~rfa~~ce·fo~~r~~·th~~e~~·CLP·solver.·More...~~	20	struct· MaxCardinalitySearchDefaultTraits<_GR,_CAP_>
		21	·······Default·traits·class·of·MaxCardinalitySearch·class.·More...
		22
		23	·class· MaxCardinalitySearch<_GR,_CAP,_TR_>
		24	·······Maximum·Cardinality·Search·algorithm·class.·More...
		25
		26	struct· MaxCardinalitySearch<_GR,_CAP,_TR_>::SetCapacityMap<_T_>
		27	·······Named_parameter·for·setting·CapacityMap·type·More...
		28
		29	struct· MaxCardinalitySearch<_GR,_CAP,_TR_>::SetCardinalityMap<_T_>
		30	·······Named_parameter·for·setting·CardinalityMap·type·More...
		31
		32	struct· MaxCardinalitySearch<_GR,_CAP,_TR_>::SetProcessedMap<_T_>
		33	·······Named_parameter·for·setting·ProcessedMap·type·More...
		34
		35	struct· MaxCardinalitySearch<_GR,_CAP,_TR_>::SetHeap<_H,_CR_>
		36	·······Named_parameter·for·setting·heap·and·cross·reference·type·More...
		37
		38	struct· MaxCardinalitySearch<_GR,_CAP,_TR_>::SetStandardHeap<_H,_CR_>
		39	·······Named_parameter·for·setting·heap·and·cross·reference·type·with
		40	·········automatic·allocation·More...
19		41
20	·Namespaces	42	·Namespaces
21	namespace· lemon	43	namespace· lemon
22	··········The·namespace·of·LEMON.	44	··········The·namespace·of·LEMON.
23		45

24	===============================================================================	46	===============================================================================


Offset 6, 26 lines modified		Offset 6, 35 lines modified
6	My·Project	6	My·Project

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·lemon	10	····*·lemon
11	Classes·\|·Namespaces	11	Classes·\|·Namespaces
12	hypercube_graph.h·File·Reference
13	Data_Structures·»·Graph_Structures
14	#include·<ve~~ctor>~~	12	circulation.h·File·Reference
		13	Algorithms·»·Maximum_Flow_Algorithms
		14	#include·<lemon/tolerance.h>
15	#include·<lemon/core.h>	15	#include·<lemon/elevator.h>
		16	#include·<limits>
16	#include·<lemon/assert.h>
17	#include·<lemon/bits/graph_extender.h>
18	·Classes	17	·Classes
19	class· HypercubeGraph
20	~~·····~~·H~~ype~~rcube·gra~~ph·class.·~~M~~ore...~~	18	struct· CirculationDefaultTraits<_GR,_LM,_UM,_SM_>
		19	·······Default·traits·class·of·Circulation·class.·More...
21		20
22	class· HypercubeGraph::HyperMap<_T,_BF_>
23	~~····~~··Linea~~r·combination·map.·~~M~~ore...~~	21	·class· Circulation<_GR,_LM,_UM,_SM,_TR_>
		22	·······Push-relabel·algorithm·for·the·network·circulation·problem.·More...
		23
		24	struct· Circulation<_GR,_LM,_UM,_SM,_TR_>::SetFlowMap<_T_>
		25	·······Named_parameter·for·setting·FlowMap·type·More...
		26
		27	struct· Circulation<_GR,_LM,_UM,_SM,_TR_>::SetElevator<_T_>
		28	·······Named_parameter·for·setting·Elevator·type·More...
		29
		30	struct· Circulation<_GR,_LM,_UM,_SM,_TR_>::SetStandardElevator<_T_>
		31	·······Named_parameter·for·setting·Elevator·type·with·automatic·allocation
		32	·········More...
24		33
25	·Namespaces	34	·Namespaces
26	namespace· lemon	35	namespace· lemon
27	··········The·namespace·of·LEMON.	36	··········The·namespace·of·LEMON.
28		37

29	===============================================================================	38	===============================================================================


Offset 5, 42 lines modified		Offset 5, 68 lines modified

5	My·Project	5	My·Project

6	Loading...	6	Loading...
7	Searching...	7	Searching...
8	No·Matches	8	No·Matches
9	····*·lemon	9	····*·lemon
10	Classes·\|·Namespaces	10	Classes·\|·Namespaces·\|·Functions
11	smart_graph.h·File·Reference
12	~~Dat~~a~~_Stru~~c~~ture~~s·»·G~~raph_Structur~~es	11	dimacs.h·File·Reference
		12	Input-Output·»·DIMACS_Format
		13	#include·<iostream>
		14	#include·<string>
13	#include·<vector>	15	#include·<vector>
		16	#include·<limits>
14	#include·<lemon/~~core~~.h>	17	#include·<lemon/maps.h>
15	#include·<lemon/error.h>	18	#include·<lemon/error.h>
16	#include·<lemon/bits/graph_extender.h>
17	·Classes	19	·Classes
		20	struct· DimacsDescriptor
		21	·······DIMACS·file·type·descriptor.·More...
18	class· SmartDigraph
19	······A·smart·directed·graph·class.·More...
20
21	class· SmartDigraph::Snapshot
22	······Class·to·make·a·snapshot·of·the·digraph·and·to·restore·it·later.
23	········More...
24
25	class· SmartGraph
26	······A·smart·undirected·graph·class.·More...
27
28	class· SmartGraph::Snapshot
29	······Class·to·make·a·snapshot·of·the·graph·and·to·restore·it·later.·More...
30
31	class· SmartBpGraph
32	······A·smart·undirected·bipartite·graph·class.·More...
33
34	class· SmartBpGraph::Snapshot


Offset 5, 45 lines modified		Offset 5, 22 lines modified

5	My·Project	5	My·Project

6	Loading...	6	Loading...
7	Searching...	7	Searching...
8	No·Matches	8	No·Matches
9	····*·lemon	9	····*·lemon
		10	Namespaces·\|·Variables
		11	random.cc·File·Reference
10	Classes·\|·Namespaces·\|·Functions
11	planarity.h·File·Reference
12	Algorithms·»·Planar_Embedding_and_Drawing
13	#include·<vector>
14	#include·<list>
15	#include·<lemon/dfs.h>
16	#include·<lemon/bfs.h>
17	#include·<lemon/radix_sort.h>
18	#include·<lemon/maps.h>
19	#include·<lemon/path.h>
20	#include·<lemon/bucket_heap.h>
21	#include·<lemon/adaptors.h>
22	#include·<lemon/edge_set.h>
23	#include·<lemon/color.h>
24	#include·<lemon/dim2.h>	12	#include·<lemon/random.h>
25	·Classes
26	class· PlanarEmbedding<_Graph_>
27	······Planar·embedding·of·an·undirected·simple·graph.·More...
28
29	class· PlanarDrawing<_Graph_>
30	······Schnyder's·planar·drawing·algorithm.·More...
31
32	class· PlanarColoring<_Graph_>
33	······Coloring·planar·graphs.·More...
34
35	·Namespaces	13	·Namespaces
36	namespace· lemon	14	namespace· lemon
37	··········The·namespace·of·LEMON.	15	··········The·namespace·of·LEMON.
38		16
		17	·Variables
		18	Random rnd
		19	······Global·random·number·generator·instance.
39	·Functions
40	template<typename·GR·>
41	bool checkPlanarity·(const·GR·&graph)
42	····Planarity·checking·of·an·undirected·simple·graph.
43		20

44	===============================================================================	21	===============================================================================
45	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]	22	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]
46	·····1.9.8	23	·····1.9.8


Offset 5, 27 lines modified		Offset 5, 33 lines modified

5	My·Project	5	My·Project

6	Loading...	6	Loading...
7	Searching...	7	Searching...
8	No·Matches	8	No·Matches
9	····*·lemon	9	····*·lemon
		10	Namespaces·\|·Macros·\|·Typedefs
		11	lp.h·File·Reference
		12	General_Optimization_Tools·»·LP_and_MIP_Solvers
10	Classes·\|·Namespaces
11	nearest_neighbor_tsp.h·File·Reference
12	Algorithms·»·Traveling_Salesman_Problem
13	#include·<deque>
14	#include·<vector>
15	#include·<limits>
16	#include·<lemon/full_graph.h>
17	#include·<lemon/~~maps~~.h>	13	#include·<lemon/config.h>
18	·Classes
19	class· NearestNeighborTsp<_CM_>
20	······Nearest·neighbor·algorithm·for·symmetric·TSP.·More...
21
22	·Namespaces	14	·Namespaces
23	namespace· lemon	15	namespace· lemon
24	··········The·namespace·of·LEMON.	16	··········The·namespace·of·LEMON.
25		17
		18	·Macros
		19	#define LEMON_DEFAULT_LP SOLVER
		20	·······The·default·LP·solver·identifier.
		21
		22	#define LEMON_DEFAULT_MIP SOLVER
		23	·······The·default·MIP·solver·identifier.
		24
		25	·Typedefs
		26	·typedef·GlpkLp Lp
		27	···············The·default·LP·solver.
		28
		29	typedef·GlpkMip Mip
		30	···············The·default·MIP·solver.
		31

26	===============================================================================	32	===============================================================================
27	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]	33	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]
28	·····1.9.8	34	·····1.9.8


Offset 6, 36 lines modified		Offset 6, 39 lines modified
6	My·Project	6	My·Project

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·lemon	10	····*·lemon
11	Classes·\|·Namespaces	11	Classes·\|·Namespaces
12	~~edge~~_~~set~~.h·File·Reference	12	smart_graph.h·File·Reference
13	Data_Structures·»·Graph_Structures	13	Data_Structures·»·Graph_Structures
		14	#include·<vector>
14	***·Detailed·Description·***
15	Graphs·which·use·another·graph's·node-set·as·own.
16	#include·<lemon/core.h>	15	#include·<lemon/core.h>
		16	#include·<lemon/error.h>
17	#include·<lemon/bits/edge~~_set~~_extender.h>	17	#include·<lemon/bits/graph_extender.h>
18	·Classes	18	·Classes
		19	class· SmartDigraph
		20	······A·smart·directed·graph·class.·More...
19	class· ListArcSet<_GR_>
20	······Digraph·using·a·node·set·of·another·digraph·or·graph·and·an·own·arc
21	········set.·More...
22		21
23	class· ListEdgeSet<_GR_>
24	~~······~~Gra~~ph·u~~s~~ing·a·node·~~set·~~of·~~a~~nothe~~r·digraph·o~~r·gr~~ap~~h·and·a~~n·o~~wn·edge·se~~t.	22	class· SmartDigraph::Snapshot
		23	······Class·to·make·a·snapshot·of·the·digraph·and·to·restore·it·later.
25	········More...	24	········More...
26		25
		26	class· SmartGraph
		27	······A·smart·undirected·graph·class.·More...
27	class· SmartArcSet<_GR_>
28	······Digraph·using·a·node·set·of·another·digraph·or·graph·and·an·own·arc
29	········set.·More...
30		28
31	class· SmartEdgeSet<_GR_>
32	······Graph·using·a·node·set·of·another·digraph·or·graph·and·an·own·edge·set.
33	···~~·····Mo~~r~~e...~~	29	class· SmartGraph::Snapshot
		30	······Class·to·make·a·snapshot·of·the·graph·and·to·restore·it·later.·More...
		31
		32	class· SmartBpGraph
		33	······A·smart·undirected·bipartite·graph·class.·More...
		34
		35	class· SmartBpGraph::Snapshot
		36	······Class·to·make·a·snapshot·of·the·graph·and·to·restore·it·later.·More...
34		37
35	·Namespaces	38	·Namespaces
36	namespace· lemon	39	namespace· lemon
37	··········The·namespace·of·LEMON.	40	··········The·namespace·of·LEMON.
38		41

39	===============================================================================	42	===============================================================================


Offset 5, 26 lines modified		Offset 5, 58 lines modified

5	My·Project	5	My·Project

6	Loading...	6	Loading...
7	Searching...	7	Searching...
8	No·Matches	8	No·Matches
9	····*·lemon	9	····*·lemon
10	Namespaces·\|·Macros
11	assert.h·File·Reference
12	Tools_a~~nd_Utili~~ties·»·~~Exc~~e~~ption~~s	10	Classes·\|·Namespaces
		11	unionfind.h·File·Reference
		12	Data_Structures·»·Auxiliary_Data_Structures
		13	#include·<vector>
		14	#include·<list>
		15	#include·<utility>
		16	#include·<algorithm>
		17	#include·<functional>
13	#include·<lemon/error.h>	18	#include·<lemon/core.h>
		19	·Classes
		20	class· UnionFind<_IM_>
		21	······A·Union-Find·data·structure·implementation.·More...
		22
		23	class· UnionFindEnum<_IM_>
		24	······A·Union-Find·data·structure·implementation·which·is·able·to·enumerate
		25	········the·components.·More...
		26
		27	class· UnionFindEnum<_IM_>::ClassIt
		28	······LEMON·style·iterator·for·the·representant·items.·More...
		29
		30	class· UnionFindEnum<_IM_>::ItemIt
		31	······LEMON·style·iterator·for·the·items·of·a·component.·More...
		32
		33	class· ExtendFindEnum<_IM_>
		34	······A·Extend-Find·data·structure·implementation·which·is·able·to·enumerate
		35	········the·components.·More...
		36
		37	class· ExtendFindEnum<_IM_>::ClassIt
		38	······LEMON·style·iterator·for·the·classes.·More...
		39
		40	class· ExtendFindEnum<_IM_>::ItemIt
		41	······LEMON·style·iterator·for·the·items·of·a·component.·More...
		42
		43	class· HeapUnionFind<_V,_IM,_Comp_>
		44	······A·Union-Find·data·structure·implementation·which·is·able·to·store·a
		45	········priority·for·each·item·and·retrieve·the·minimum·of·each·class.·More...
		46
		47	class· HeapUnionFind<_V,_IM,_Comp_>::ItemIt
		48	······LEMON·style·iterator·for·the·items·of·a·class.·More...
		49
		50	class· HeapUnionFind<_V,_IM,_Comp_>::ClassIt
		51	······Class·iterator.·More...
		52
14	·Namespaces	53	·Namespaces
15	namespace· lemon	54	namespace· lemon
16	··········The·namespace·of·LEMON.	55	··········The·namespace·of·LEMON.
17		56
18	·Macros
19	#define LEMON_ASSERT(exp,·msg)
20	·······Macro·for·assertion·with·customizable·message.
21
22	#define LEMON_DEBUG(exp,·msg)
23	·······Macro·for·internal·assertions.
24

25	===============================================================================	57	===============================================================================
26	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]	58	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]
27	·····1.9.8	59	·····1.9.8


Offset 5, 45 lines modified		Offset 5, 32 lines modified

5	My·Project	5	My·Project

6	Loading...	6	Loading...
7	Searching...	7	Searching...
8	No·Matches	8	No·Matches
9	····*·lemon	9	····*·lemon
10	Classes·\|·Namespaces~~·\|·Functions~~	10	Classes·\|·Namespaces
		11	tolerance.h·File·Reference
		12	Tools_and_Utilities·»·Miscellaneous_Tools
11	min_cost_arborescence.h·File·Reference
12	Algorithms·»·Minimum_Spanning_Tree_Algorithms
13	#include·<vector>
14	#include·<lemon/list_graph.h>
15	#include·<lemon/bin_heap.h>
16	#include·<lemon/assert.h>
17	·Classes	13	·Classes
18	struct· MinCostArborescenceDefaultTraits<_GR,_CM_>
19	~~·······Default·traits·~~class~~·for~~·~~MinCostA~~rborescence~~·class.·More...~~	14	class· Tolerance<_T_>
		15	······A·class·to·provide·a·basic·way·to·handle·the·comparison·of·numbers·that
		16	········are·obtained·as·a·result·of·a·probably·inexact·computation.·More...
20		17
21	·class· MinCostArborescence<_GR,_CM,_TR_>
22	~~·······Minimum·Co~~st·Arborescence~~·algorithm·c~~l~~ass.·M~~or~~e...~~	18	class· Tolerance<_float_>
		19	······Float·specialization·of·Tolerance.·More...
23		20
24	struct· MinCostArborescence<_GR,_CM,_TR_>::SetArborescenceMap<_T_>
25	~~·······Named_p~~ara~~meter·for·~~s~~ettin~~g·Arborescence~~Map·type·Mor~~e...	21	class· Tolerance<_double_>
		22	······Double·specialization·of·Tolerance.·More...
26		23
		24	class· Tolerance<_long_double_>
		25	······Long·double·specialization·of·Tolerance.·More...
27	struct· MinCostArborescence<_GR,_CM,_TR_>::SetPredMap<_T_>
28	·······Named_parameter·for·setting·PredMap·type·More...
29
30	·class· MinCostArborescence<_GR,_CM,_TR_>::DualIt
31	·······LEMON·iterator·for·getting·a·dual·variable.·More...
32		26
33	·Namespaces	27	·Namespaces
34	namespace· lemon	28	namespace· lemon
35	··········The·namespace·of·LEMON.	29	··········The·namespace·of·LEMON.
36		30
37	·Functions
38	template<typename·Digraph·,·typename·CostMap·,·typename·ArborescenceMap·>
39	CostMap::Value minCostArborescence·(const·Digraph·&digraph,·const·CostMap
40	················&cost,·typename·Digraph::Node·source,·ArborescenceMap
41	················&arborescence)
42	··············Function·type·interface·for·MinCostArborescence·algorithm.
43

44	===============================================================================	31	===============================================================================
45	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]	32	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]
46	·····1.9.8	33	·····1.9.8


Offset 6, 22 lines modified		Offset 6, 27 lines modified
6	My·Project	6	My·Project

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·lemon	10	····*·lemon
11	Classes·\|·Namespaces	11	Classes·\|·Namespaces
12	quad_heap.h·File·Reference
13	~~Data_Stru~~ct~~ures·»·He~~ap_~~Structu~~res	12	grosso_locatelli_pullan_mc.h·File·Reference
		13	Algorithms·»·Approximation_Algorithms
14	#include·<vector>	14	#include·<vector>
15	#include·<utility>	15	#include·<limits>
16	#include·<fun~~ctional~~>	16	#include·<lemon/core.h>
		17	#include·<lemon/random.h>
17	·Classes	18	·Classes
18	class· QuadHeap<_PR,_IM,_CMP_>
19	~~·····~~·Four~~ary·(qu~~ate~~rnary)·heap·dat~~a~~·st~~ruc~~ture.·More...~~	19	class· GrossoLocatelliPullanMc<_GR_>
		20	······Implementation·of·the·iterated·local·search·algorithm·of·Grosso,
		21	········Locatelli,·and·Pullan·for·the·maximum·clique·problem.·More...
		22
		23	class· GrossoLocatelliPullanMc<_GR_>::CliqueNodeIt
		24	······Iterator·to·list·the·nodes·of·the·found·clique.·More...
20		25
21	·Namespaces	26	·Namespaces
22	namespace· lemon	27	namespace· lemon
23	··········The·namespace·of·LEMON.	28	··········The·namespace·of·LEMON.
24		29

25	===============================================================================	30	===============================================================================


Offset 6, 24 lines modified		Offset 6, 39 lines modified
6	My·Project	6	My·Project

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·lemon	10	····*·lemon
11	Classes·\|·Namespaces	11	Classes·\|·Namespaces
12	counter.h·File·Reference
13	~~Too~~l~~s_and~~_Uti~~lities·»~~·Mi~~scel~~lane~~ous_Tools·»~~·Time_Me~~asu~~r~~ing_and_Co~~unting	12	list_graph.h·File·Reference
		13	Data_Structures·»·Graph_Structures
		14	#include·<lemon/core.h>
		15	#include·<lemon/error.h>
		16	#include·<lemon/bits/graph_extender.h>
14	#include·<~~string~~>	17	#include·<vector>
15	#include·<iost~~ream~~>	18	#include·<list>
16	·Classes	19	·Classes
17	class· Counter
18	~~······A·~~cou~~nter~~·c~~las~~s~~.·Mo~~re~~...~~	20	class· ListDigraph
		21	······A·general·directed·graph·structure.·More...
19		22
20	class· NoCounter
21	~~·····~~·'D~~o·no~~thing~~'·ve~~r~~sion·of·Cou~~nte~~r.·M~~o~~re..~~.	23	class· ListDigraph::Snapshot
		24	······Class·to·make·a·snapshot·of·the·digraph·and·restore·it·later.·More...
		25
		26	class· ListGraph
		27	······A·general·undirected·graph·structure.·More...
		28
		29	class· ListGraph::Snapshot
		30	······Class·to·make·a·snapshot·of·the·graph·and·restore·it·later.·More...
		31
		32	class· ListBpGraph
		33	······A·general·undirected·graph·structure.·More...
		34
		35	class· ListBpGraph::Snapshot
		36	······Class·to·make·a·snapshot·of·the·graph·and·restore·it·later.·More...
22		37
23	·Namespaces	38	·Namespaces
24	namespace· lemon	39	namespace· lemon
25	··········The·namespace·of·LEMON.	40	··········The·namespace·of·LEMON.
26		41

27	===============================================================================	42	===============================================================================

+My·Project
+Loading...
+Searching...
+No·Matches
+····*·lemon
+Namespaces
+cbc.cc·File·Reference
+#include·"cbc.h"
+#include·<coin/CoinModel.hpp>
+#include·<coin/CbcModel.hpp>
+#include·<coin/OsiSolverInterface.hpp>
+#include·"coin/OsiClpSolverInterface.hpp"
+#include·"coin/CbcCutGenerator.hpp"
+#include·"coin/CbcHeuristicLocal.hpp"
+#include·"coin/CbcHeuristicGreedy.hpp"
+#include·"coin/CbcHeuristicFPump.hpp"
+#include·"coin/CbcHeuristicRINS.hpp"
+#include·"coin/CglGomory.hpp"
+#include·"coin/CglProbing.hpp"
+#include·"coin/CglKnapsackCover.hpp"
+#include·"coin/CglOddHole.hpp"
+#include·"coin/CglClique.hpp"
+#include·"coin/CglFlowCover.hpp"
+#include·"coin/CglMixedIntegerRounding.hpp"
+#include·"coin/CbcHeuristic.hpp"
+Classes·|·Namespaces
+unionfind.h·File·Reference
+Data_Structures·»·Auxiliary_Data_Structures
+#include·<vector>
+#include·<list>
+#include·<utility>
+#include·<algorithm>
+#include·<functional>
+#include·<lemon/core.h>
+·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...
+·Namespaces
+namespace· lemon
+ ··········The·namespace·of·LEMON.
+===============================================================================
+·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]


Offset 5, 33 lines modified		Offset 5, 36 lines modified

5	My·Project	5	My·Project

6	Loading...	6	Loading...
7	Searching...	7	Searching...
8	No·Matches	8	No·Matches
9	····*·lemon	9	····*·lemon
10	N~~ame~~spaces·\|·Macros~~·\|·Ty~~pedefs	10	Classes·\|·Namespaces
11	lp.h·File·Reference	11	arg_parser.h·File·Reference
12	~~Gener~~a~~l_Op~~timizati~~on_Tool~~s·»~~·LP_~~and~~_MIP~~_Solvers	12	Tools_and_Utilities·»·Miscellaneous_Tools
		13	#include·<vector>
		14	#include·<map>
		15	#include·<list>
		16	#include·<string>
		17	#include·<iostream>
		18	#include·<sstream>
		19	#include·<algorithm>
13	#include·<lemon/~~config~~.h>	20	#include·<lemon/assert.h>
		21	·Classes
		22	class· ArgParserException
		23	······Exception·used·by·ArgParser.·More...
14	·Namespaces
15	namespace· lemon
16	··········The·namespace·of·LEMON.
17
18	·Macros
19	#define LEMON_DEFAULT_LP SOLVER
20	·······The·default·LP·solver·identifier.
21		24
22	#define LEMON_DEFAULT_MIP SOLVER
23	~~·······The·defa~~ul~~t·MIP~~·s~~olve~~r·~~identifi~~er.	25	class· ArgParser
		26	······Command·line·arguments·parser.·More...
24		27
		28	class· ArgParser::RefType
		29	······Magic·type·for·operator[].·More...
25	·Typedefs
26	·typedef·GlpkLp Lp
27	···············The·default·LP·solver.
28		30
29	typedef·GlpkMip Mip
30	~~···············The~~·defa~~ult·MI~~P·s~~olv~~er.	31	·Namespaces
		32	namespace· lemon
		33	··········The·namespace·of·LEMON.
31		34

32	===============================================================================	35	===============================================================================
33	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]	36	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]
34	·····1.9.8	37	·····1.9.8


Offset 5, 17 lines modified		Offset 5, 27 lines modified

5	My·Project	5	My·Project

6	Loading...	6	Loading...
7	Searching...	7	Searching...
8	No·Matches	8	No·Matches
9	····*·lemon	9	····*·lemon
10	Namespaces
11	lp_base.cc·File·Reference
12	#i~~nclud~~e~~·<lemon/l~~p_base.h>	10	Classes·\|·Namespaces
		11	bucket_heap.h·File·Reference
		12	Data_Structures·»·Heap_Structures
		13	#include·<vector>
		14	#include·<utility>
		15	#include·<functional>
		16	·Classes
		17	class· BucketHeap<_IM,_MIN_>
		18	······Bucket·heap·data·structure.·More...
		19
		20	class· SimpleBucketHeap<_IM,_MIN_>
		21	······Simplified·bucket·heap·data·structure.·More...
		22
13	·Namespaces	23	·Namespaces
14	namespace· lemon	24	namespace· lemon
15	··········The·namespace·of·LEMON.	25	··········The·namespace·of·LEMON.
16		26

17	===============================================================================	27	===============================================================================
18	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]	28	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]


Offset 5, 27 lines modified		Offset 5, 35 lines modified

5	My·Project	5	My·Project

6	Loading...	6	Loading...
7	Searching...	7	Searching...
8	No·Matches	8	No·Matches
9	····*·lemon	9	····*·lemon
10	Classes·\|·Namespaces	10	Classes·\|·Namespaces·\|·Functions
11	insertion_tsp.h·File·Reference
12	~~Alg~~orith~~ms·»~~·~~Trave~~li~~ng_Sa~~les~~man_P~~r~~obl~~em	11	color.h·File·Reference
		12	Tools_and_Utilities·»·Miscellaneous_Tools
13	#include·<vector>	13	#include·<vector>
14	#include·<functional>
15	#include·<lemon/~~full_g~~raph.h>	14	#include·<lemon/math.h>
16	#include·<lemon/maps.h>	15	#include·<lemon/maps.h>
17	#include·<lemon/random.h>
18	·Classes	16	·Classes
19	class· InsertionTsp<_CM_>
20	~~······Insertion·~~al~~gorithm·for~~·s~~ymmetri~~c·TS~~P.·M~~or~~e...~~	17	class· Color
		18	······Data·structure·representing·RGB·colors.·More...
		19
		20	class· Palette
		21	······Map·ints·to·different·Colors.·More...
21		22
22	·Namespaces	23	·Namespaces
23	namespace· lemon	24	namespace· lemon
24	··········The·namespace·of·LEMON.	25	··········The·namespace·of·LEMON.
25		26
		27	·Functions
		28	Color distantColor·(const·Color·&c)
		29	·····Returns·a·visibly·distinct·Color.
		30
		31	Color distantBW·(const·Color·&c)
		32	·····Returns·black·for·light·colors·and·white·for·the·dark·ones.
		33

26	===============================================================================	34	===============================================================================
27	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]	35	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]
28	·····1.9.8	36	·····1.9.8


Offset 5, 30 lines modified		Offset 5, 74 lines modified

5	My·Project	5	My·Project

6	Loading...	6	Loading...
7	Searching...	7	Searching...
8	No·Matches	8	No·Matches
9	····*·lemon	9	····*·lemon
10	Classes·\|·Namespaces	10	Classes·\|·Namespaces·\|·Functions
11	~~elevator~~.h·File·Reference	11	bfs.h·File·Reference
		12	Algorithms·»·Graph_Search
		13	#include·<lemon/list_graph.h>
		14	#include·<lemon/bits/path_dump.h>
12	Data_Structures·»·Auxiliary_Data_Structures
13	***·Detailed·Description·***
14	Elevator·class·implements·an·efficient·data·structure·for·labeling·items·in
15	push-relabel·type·algorithms.
16	#include·<lemon/core.h>	15	#include·<lemon/core.h>
		16	#include·<lemon/error.h>
17	#include·<lemon/~~bits/t~~raits.h>	17	#include·<lemon/maps.h>
		18	#include·<lemon/path.h>
18	·Classes	19	·Classes
19	class· Elevator<_GR,_Item_>
20	~~······Clas~~s·for~~·handling·"labels"~~·in~~·pu~~sh-relabel·type·a~~lgor~~ithms~~.·More...~~	20	struct· BfsDefaultTraits<_GR_>
		21	·······Default·traits·class·of·Bfs·class.·More...
21		22
22	class· LinkedElevator<_GR,_Item_>
23	~~·····~~·Class~~·for·handling·"label~~s"·in~~·pu~~s~~h-relabel·type·algorithms.·More...~~	23	·class· Bfs<_GR,_TR_>
		24	·······BFS·algorithm·class.·More...
		25
		26	struct· Bfs<_GR,_TR_>::SetPredMap<_T_>
		27	·······Named_parameter·for·setting·PredMap·type.·More...
		28
		29	struct· Bfs<_GR,_TR_>::SetDistMap<_T_>
		30	·······Named_parameter·for·setting·DistMap·type.·More...
		31
		32	struct· Bfs<_GR,_TR_>::SetReachedMap<_T_>
		33	·······Named_parameter·for·setting·ReachedMap·type.·More...
		34
		35	struct· Bfs<_GR,_TR_>::SetProcessedMap<_T_>
		36	·······Named_parameter·for·setting·ProcessedMap·type.·More...
		37
		38	struct· Bfs<_GR,_TR_>::SetStandardProcessedMap
		39	·······Named_parameter·for·setting·ProcessedMap·type·to·be·Digraph::
		40	·········NodeMap<bool>.·More...
		41
		42	struct· BfsWizardDefaultTraits<_GR_>
		43	·······Default·traits·class·of·bfs()·function.·More...
		44
		45	·class· BfsWizardBase<_GR_>
		46	·······Default·traits·class·used·by·BfsWizard.·More...
		47
		48	·class· BfsWizard<_TR_>
		49	·······Auxiliary·class·for·the·function-type·interface·of·BFS·algorithm.
		50	·········More...
		51
		52	struct· BfsVisitor<_GR_>
		53	·······Visitor·class·for·BFS.·More...
		54
		55	struct· BfsVisitDefaultTraits<_GR_>
		56	·······Default·traits·class·of·BfsVisit·class.·More...
		57
		58	·class· BfsVisit<_GR,_VS,_TR_>
		59	·······BFS·algorithm·class·with·visitor·interface.·More...
		60
		61	struct· BfsVisit<_GR,_VS,_TR_>::SetReachedMap<_T_>
		62	·······Named_parameter·for·setting·ReachedMap·type.·More...
24		63
25	·Namespaces	64	·Namespaces
26	namespace· lemon	65	namespace· lemon
27	··········The·namespace·of·LEMON.	66	··········The·namespace·of·LEMON.
28		67
		68	·Functions
		69	template<class·GR·>
		70	BfsWizard<·BfsWizardBase<·GR·>·> bfs·(const·GR·&digraph)
		71	································Function-type·interface·for·BFS·algorithm.
		72

29	===============================================================================	73	===============================================================================
30	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]	74	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]
31	·····1.9.8	75	·····1.9.8

+My·Project
+Loading...
+Searching...
+No·Matches
+····*·lemon
+Namespaces·|·Functions
+connectivity.h·File·Reference
+Algorithms·»·Connectivity_and_Other_Graph_Properties
+*****·Detailed·Description·*****
+Connectivity·algorithms
+#include·<lemon/dfs.h>
+#include·<lemon/bfs.h>
+#include·<lemon/core.h>
+time_measure.h·File·Reference
+Tools_and_Utilities·»·Miscellaneous_Tools·»·Time_Measuring_and_Counting
+#include·<unistd.h>
+#include·<sys/times.h>
+#include·<sys/time.h>
+#include·<string>
+#include·<fstream>
+#include·<iostream>
+#include·<lemon/maps.h>
+#include·<lemon/adaptors.h>
+#include·<lemon/concepts/digraph.h>
+#include·<lemon/concepts/graph.h>
+#include·<lemon/concept_check.h>
+#include·<stack>
+#include·<functional>
+·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...
+·Namespaces
+namespace· lemon
+ ··········The·namespace·of·LEMON.
+·Functions
+template<class·F·>
+TimeStamp runningTimeTest·(F·f,·double·min_time=10,·unsigned·int·*num=NULL,
+···········TimeStamp·*full_time=NULL)
+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.


Offset 5, 76 lines modified		Offset 5, 51 lines modified

5	My·Project	5	My·Project

6	Loading...	6	Loading...
7	Searching...	7	Searching...
8	No·Matches	8	No·Matches
9	····*·lemon	9	····*·lemon
10	Classes·\|·Namespaces~~·\|·Functions~~	10	Classes·\|·Namespaces
11	di~~jks~~tra.h·File·Reference	11	fractional_matching.h·File·Reference
12	Algorithms·»·~~Short~~est~~_Path~~_Algorithms	12	Algorithms·»·Matching_Algorithms
		13	#include·<vector>
		14	#include·<queue>
		15	#include·<set>
13	#include·<limits>	16	#include·<limits>
14	#include·<lemon/list_graph.h>
15	#include·<lemon/bin_heap.h>
16	#include·<lemon/bits/path_dump.h>
17	#include·<lemon/core.h>	17	#include·<lemon/core.h>
		18	#include·<lemon/unionfind.h>
18	#include·<lemon/~~error~~.h>	19	#include·<lemon/bin_heap.h>
19	#include·<lemon/maps.h>	20	#include·<lemon/maps.h>
20	#include·<lemon/~~path~~.h>	21	#include·<lemon/assert.h>
		22	#include·<lemon/elevator.h>
21	·Classes	23	·Classes
		24	struct· MaxFractionalMatchingDefaultTraits<_GR_>
22	struct· DijkstraDefaultOperationTraits<_V_>
23	·······Default·operation·traits·for·the·Dijkstra·algorithm·class.·More...
24
25	struct· DijkstraDefaultTraits<_GR,_LEN_>
26	·······Default·traits·class·of·Di~~jks~~tra·class.·More...	25	·······Default·traits·class·of·MaxFractionalMatching·class.·More...
27
28	·class· Dijkstra<_GR,_LEN,_TR_>
29	·······Dijkstra·algorithm·class.·More...
30
31	struct· Dijkstra<_GR,_LEN,_TR_>::SetPredMap<_T_>
32	·······Named_parameter·for·setting·PredMap·type.·More...
33
34	struct· Dijkstra<_GR,_LEN,_TR_>::SetDistMap<_T_>
35	·······Named_parameter·for·setting·DistMap·type.·More...
36		26
37	struct· Dijkstra<_GR,_LEN,_TR_>::SetProcessedMap<_T_>
38	~~·····~~··Name~~d_par~~a~~meter·~~for·setti~~ng·Pr~~o~~cessed~~Ma~~p·type.·More...~~	27	·class· MaxFractionalMatching<_GR,_TR_>
		28	·······Max·cardinality·fractional·matching.·More...
39		29
		30	struct· MaxFractionalMatching<_GR,_TR_>::SetMatchingMap<_T_>
		31	·······Named_parameter·for·setting·MatchingMap·type·More...
40	struct· Dijkstra<_GR,_LEN,_TR_>::SetStandardProcessedMap
41	·······Named_parameter·for·setting·ProcessedMap·type·to·be·Digraph::
42	·········NodeMap<bool>.·More...
43		32
44	struct· Di~~jkstr~~a~~<_GR,_LEN~~,_TR_>::SetHe~~ap<_H,~~_CR_>	33	struct· MaxFractionalMatching<_GR,_TR_>::SetElevator<_T_>
45	·······Named_parameter·for·setting·h~~eap·~~a~~nd·c~~ro~~ss·refe~~r~~ence~~·types·More...	34	·······Named_parameter·for·setting·Elevator·type·More...
46		35
		36	struct· MaxFractionalMatching<_GR,_TR_>::SetStandardElevator<_T_>
		37	·······Named_parameter·for·setting·Elevator·type·with·automatic·allocation
		38	·········More...
47	struct· Dijkstra<_GR,_LEN,_TR_>::SetStandardHeap<_H,_CR_>
48	·······Named_parameter·for·setting·heap·and·cross·reference·types·with
49	·········automatic·allocation·More...
50
51	struct· Dijkstra<_GR,_LEN,_TR_>::SetOperationTraits<_T_>
52	·······Named_parameter·for·setting·OperationTraits·type·More...
53		39
54	struct· DijkstraWizardDefaultTraits<_GR,_LEN_>
55	·~~·····~~·Defaul~~t·trai~~t~~s·cl~~a~~ss·of~~·di~~jkstr~~a(~~)·fu~~n~~ction.·More...~~	40	·class· MaxWeightedFractionalMatching<_GR,_WM_>
		41	·······Weighted·fractional·matching·in·general·graphs.·More...
56		42
		43	·class· MaxWeightedPerfectFractionalMatching<_GR,_WM_>
		44	·······Weighted·fractional·perfect·matching·in·general·graphs.·More...
57	·class· DijkstraWizardBase<_GR,_LEN_>
58	·······Default·traits·class·used·by·DijkstraWizard.·More...
59
60	·class· DijkstraWizard<_TR_>
61	·······Auxiliary·class·for·the·function-type·interface·of·Dijkstra·algorithm.
62	·········More...
63		45
64	·Namespaces	46	·Namespaces
65	namespace· lemon	47	namespace· lemon
66	··········The·namespace·of·LEMON.	48	··········The·namespace·of·LEMON.
67		49
68	·Functions
69	template<typename·GR·,·typename·LEN·>
70	DijkstraWizard<·DijkstraWizardBase<·GR,·dijkstra·(const·GR·&digraph,·const·LEN
71	·······························LEN·>·> &length)
72	······································Function-type·interface·for·Dijkstra
73	········································algorithm.
74

75	===============================================================================	50	===============================================================================
76	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]	51	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]
77	·····1.9.8	52	·····1.9.8


Offset 5, 60 lines modified		Offset 5, 27 lines modified

5	My·Project	5	My·Project

6	Loading...	6	Loading...
7	Searching...	7	Searching...
8	No·Matches	8	No·Matches
9	····*·lemon	9	····*·lemon
10	N~~ame~~spaces·\|·~~Function~~s~~·\|·Var~~iables	10	Classes·\|·Namespaces
11	math.h·File·Reference	11	counter.h·File·Reference
12	Tools_and_Utilities·»·Miscellaneous_Tools
13	***·Detailed·Description·***
14	Some·extensions·to·the·standard·cmath·library.
15	This·file·includes·the·standard·math·library·(cmath).
16	#include·<cmath>	12	Tools_and_Utilities·»·Miscellaneous_Tools·»·Time_Measuring_and_Counting
		13	#include·<string>
		14	#include·<iostream>
		15	·Classes
		16	class· Counter
		17	······A·counter·class.·More...
		18
		19	class· NoCounter
		20	······'Do·nothing'·version·of·Counter.·More...
		21
17	·Namespaces	22	·Namespaces
18	namespace· lemon	23	namespace· lemon
19	··········The·namespace·of·LEMON.	24	··········The·namespace·of·LEMON.
20		25
21	·Functions
22	··bool isNaN·(double·v)
23	······Check·whether·the·parameter·is·NaN·or·not.
24
25	double round·(double·r)
26	······Round·a·value·to·its·closest·integer.
27
28	·Variables
29	const·long·double E·=·2.7182818284590452353602874713526625L
30	·················The·Euler·constant.
31
32	const·long·double LOG2E·=·1.4426950408889634073599246810018921L
33	·················log_2(e)
34
35	const·long·double LOG10E·=·0.4342944819032518276511289189166051L
36	·················log_10(e)
37
38	const·long·double LN2·=·0.6931471805599453094172321214581766L
39	·················ln(2)
40
41	const·long·double LN10·=·2.3025850929940456840179914546843642L
42	·················ln(10)
43
44	const·long·double PI·=·3.1415926535897932384626433832795029L
45	·················pi
46
47	const·long·double PI_2·=·1.5707963267948966192313216916397514L
48	·················pi/2
49
50	const·long·double PI_4·=·0.7853981633974483096156608458198757L
51	·················pi/4
52
53	const·long·double SQRT2·=·1.4142135623730950488016887242096981L
54	·················sqrt(2)
55
56	const·long·double SQRT1_2·=·0.7071067811865475244008443621048490L
57	·················1/sqrt(2)
58

59	===============================================================================	26	===============================================================================
60	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]	27	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]
61	·····1.9.8	28	·····1.9.8


Offset 6, 33 lines modified		Offset 6, 30 lines modified
6	My·Project	6	My·Project

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·lemon	10	····*·lemon
11	Classes·\|·Namespaces	11	Classes·\|·Namespaces
		12	gomory_hu.h·File·Reference
		13	Algorithms·»·Minimum_Cut_Algorithms
12	arg_parser.h·File·Reference
13	Tools_and_Utilities·»·Miscellaneous_Tools
14	#include·<vector>
15	#include·<map>
16	#include·<list>	14	#include·<limits>
17	#include·<string>
18	#include·<iostream>
19	#include·<sstream>
20	#include·<algorithm>
21	#include·<lemon/assert.h>	15	#include·<lemon/core.h>
		16	#include·<lemon/preflow.h>
		17	#include·<lemon/concept_check.h>
		18	#include·<lemon/concepts/maps.h>
22	·Classes	19	·Classes
23	class· ArgParserException
24	~~·····~~·Ex~~ception·~~u~~sed·by·~~ArgP~~arser.·More.~~..	20	class· GomoryHu<_GR,_CAP_>
		21	······Gomory-Hu·cut·tree·algorithm.·More...
25		22
26	class· ArgParser
27	~~····~~··Comm~~and·line·arguments·parser.·M~~ore...	23	class· GomoryHu<_GR,_CAP_>::MinCutNodeIt
		24	······Iterate·on·the·nodes·of·a·minimum·cut.·More...
28		25
29	class· ArgParser::RefType
30	~~····~~·~~·Magic·type·for·operator[].·Mor~~e...	26	class· GomoryHu<_GR,_CAP_>::MinCutEdgeIt
		27	······Iterate·on·the·edges·of·a·minimum·cut.·More...
31		28
32	·Namespaces	29	·Namespaces
33	namespace· lemon	30	namespace· lemon
34	··········The·namespace·of·LEMON.	31	··········The·namespace·of·LEMON.
35		32

36	===============================================================================	33	===============================================================================


Offset 6, 31 lines modified		Offset 6, 21 lines modified
6	My·Project	6	My·Project

7	Loading...	7	Loading...
8	Searching...	8	Searching...
9	No·Matches	9	No·Matches
10	····*·lemon	10	····*·lemon
11	Classes·\|·Namespaces	11	Classes·\|·Namespaces
		12	static_graph.h·File·Reference
		13	Data_Structures·»·Graph_Structures
12	capacity_scaling.h·File·Reference
13	Algorithms·»·Minimum_Cost_Flow_Algorithms
14	#include·<vector>
15	#include·<limits>
16	#include·<lemon/core.h>	14	#include·<lemon/core.h>
		15	#include·<lemon/bits/graph_extender.h>
17	#include·<lemon/maps.h>
18	#include·<lemon/bin_heap.h>
19	·Classes	16	·Classes
		17	class· StaticDigraph
		18	······A·static·directed·graph·class.·More...
20	struct· CapacityScalingDefaultTraits<_GR,_V,_C_>
21	·······Default·traits·class·of·CapacityScaling·algorithm.·More...
22
23	·class· CapacityScaling<_GR,_V,_C,_TR_>
24	·······Implementation·of·the·Capacity·Scaling·algorithm·for·finding·a·minimum
25	·········cost_flow.·More...
26
27	struct· CapacityScaling<_GR,_V,_C,_TR_>::SetHeap<_T_>
28	·······Named_parameter·for·setting·Heap·type.·More...
29		19
30	·Namespaces	20	·Namespaces
31	namespace· lemon	21	namespace· lemon
32	··········The·namespace·of·LEMON.	22	··········The·namespace·of·LEMON.
33		23

34	===============================================================================	24	===============================================================================


Offset 5, 19 lines modified		Offset 5, 37 lines modified

5	My·Project	5	My·Project

6	Loading...	6	Loading...
7	Searching...	7	Searching...
8	No·Matches	8	No·Matches
9	····*·lemon	9	····*·lemon
10	Namespaces
11	soplex.cc·File·Reference
12	~~#include~~·~~<iostream>~~	10	Classes·\|·Namespaces
		11	cost_scaling.h·File·Reference
		12	Algorithms·»·Minimum_Cost_Flow_Algorithms
		13	#include·<vector>
		14	#include·<deque>
		15	#include·<limits>
13	#include·<lemon/soplex.h>	16	#include·<lemon/core.h>
14	#include·<~~spx~~out.h>	17	#include·<lemon/maps.h>
		18	#include·<lemon/math.h>
		19	#include·<lemon/static_graph.h>
		20	#include·<lemon/circulation.h>
		21	#include·<lemon/bellman_ford.h>
		22	·Classes
		23	struct· CostScalingDefaultTraits<_GR,_V,_C_>
		24	·······Default·traits·class·of·CostScaling·algorithm.·More...
		25
		26	·class· CostScaling<_GR,_V,_C,_TR_>
		27	·······Implementation·of·the·Cost·Scaling·algorithm·for·finding·a·minimum
		28	·········cost_flow.·More...
		29
		30	struct· CostScaling<_GR,_V,_C,_TR_>::SetLargeCost<_T_>
		31	·······Named_parameter·for·setting·LargeCost·type.·More...
		32
15	·Namespaces	33	·Namespaces
16	namespace· lemon	34	namespace· lemon
17	··········The·namespace·of·LEMON.	35	··········The·namespace·of·LEMON.
18		36

19	===============================================================================	37	===============================================================================
20	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]	38	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]

+My·Project
+Loading...
+Searching...
+No·Matches
+····*·lemon
+Classes·|·Namespaces·|·Macros·|·Functions
+core.h·File·Reference
+*****·Detailed·Description·*****
+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.
+Input-Output·»·Postscript_Exporting
+#include·<iostream>
+#include·<fstream>
+#include·<sstream>
+#include·<algorithm>
+#include·<vector>
+#include·<algorithm>
+#include·<sys/time.h>
+#include·<ctime>
+#include·<lemon/math.h>
+#include·<lemon/config.h>
+#include·<lemon/bits/enable_if.h>
+#include·<lemon/bits/traits.h>
+#include·<lemon/assert.h>
+#include·<lemon/color.h>
+#include·<lemon/bits/bezier.h>
+#include·<lemon/error.h>
+·Classes
+struct· DefaultGraphToEpsTraits<_GR_>
+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· GraphToEps<_T_>
+·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...
+·Namespaces
+namespace· lemon
+ ··········The·namespace·of·LEMON.
+·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.
+·Functions
+template<typename·Graph·,·typename·Item·>
+····················int countItems·(const·Graph·&g)
+ ·······················Function·to·count·the·items·in·a·graph.
+template<class·GR·>
+GraphToEps<·DefaultGraphToEpsTraits<·GR·graphToEps·(GR·&g,·std::ostream
+···································>·> &os=std::cout)
+ ······································Generates·an·EPS·file·from·a·graph.
+template<typename·Graph·>
+····················int countNodes·(const·Graph·&g)
+ ·······················Function·to·count·the·nodes·in·the·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)
+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


Offset 5, 72 lines modified		Offset 5, 29 lines modified

5	My·Project	5	My·Project

6	Loading...	6	Loading...
7	Searching...	7	Searching...
8	No·Matches	8	No·Matches
9	····*·lemon	9	····*·lemon
10	Classes·\|·Namespaces~~·\|·Functions~~	10	Classes·\|·Namespaces
11	path.h·File·Reference	11	hypercube_graph.h·File·Reference
12	Data_Structures·»·Path_Structures	12	Data_Structures·»·Graph_Structures
13	#include·<vector>	13	#include·<vector>
14	#include·<algorithm>
15	#include·<lemon/error.h>
16	#include·<lemon/core.h>	14	#include·<lemon/core.h>
17	#include·<lemon/~~concep~~ts~~/pa~~th.h>	15	#include·<lemon/assert.h>
		16	#include·<lemon/bits/graph_extender.h>
18	·Classes	17	·Classes
19	class· Path<_GR_>
20	~~······A·stru~~c~~ture~~·~~for·re~~p~~res~~e~~nting·di~~rec~~ted·paths·in·a·dig~~raph~~.·More...~~	18	class· HypercubeGraph
		19	······Hypercube·graph·class.·More...
21		20
		21	class· HypercubeGraph::HyperMap<_T,_BF_>
		22	······Linear·combination·map.·More...
22	class· Path<_GR_>::ArcIt
23	······LEMON·style·iterator·for·path·arcs.·More...
24
25	class· SimplePath<_GR_>
26	······A·structure·for·representing·directed·paths·in·a·digraph.·More...
27
28	class· SimplePath<_GR_>::ArcIt
29	······Iterator·class·to·iterate·on·the·arcs·of·the·paths.·More...
30
31	class· ListPath<_GR_>
32	······A·structure·for·representing·directed·paths·in·a·digraph.·More...
33
34	class· ListPath<_GR_>::ArcIt
35	······Iterator·class·to·iterate·on·the·arcs·of·the·paths.·More...
36
37	class· StaticPath<_GR_>
38	······A·structure·for·representing·directed·paths·in·a·digraph.·More...
39
40	class· StaticPath<_GR_>::ArcIt
41	······Iterator·class·to·iterate·on·the·arcs·of·the·paths.·More...
42
43	class· PathNodeIt<_Path_>
44	······Class·which·helps·to·iterate·through·the·nodes·of·a·path.·More...
45		23
46	·Namespaces	24	·Namespaces
47	namespace· lemon	25	namespace· lemon
48	··········The·namespace·of·LEMON.	26	··········The·namespace·of·LEMON.
49		27
50	·Functions
51	template<typename·From·,·typename·To·>
52	·········void pathCopy·(const·From·&from,·To·&to)
53	·············Make·a·copy·of·a·path.
54
55	template<typename·To·,·typename·From·>
56	·········void copyPath·(To·&to,·const·From·&from)
57	·············Deprecated·version·of·pathCopy().
58
59	template<typename·Digraph·,·typename·Path·>
60	·········bool checkPath·(const·Digraph·&digraph,·const·Path·&path)
61	·············Check·the·consistency·of·a·path.
62
63	template<typename·Digraph·,·typename·Path·>
64	Digraph::Node pathSource·(const·Digraph·&digraph,·const·Path·&path)
65	·············The·source·of·a·path.
66
67	template<typename·Digraph·,·typename·Path·>
68	Digraph::Node pathTarget·(const·Digraph·&digraph,·const·Path·&path)
69	·············The·target·of·a·path.
70

71	===============================================================================	28	===============================================================================
72	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]	29	·····Generated·on·Mon·Jul·25·2022·18:36:57·for·My·Project·by [doxygen]
73	·····1.9.8	30	·····1.9.8