equal
deleted
inserted
replaced
45 and iterate on its nodes and edges. This example also shows how to |
45 and iterate on its nodes and edges. This example also shows how to |
46 give a map on the edges of the graph. The type Listgraph is one of |
46 give a map on the edges of the graph. The type Listgraph is one of |
47 the LEMON graph types: the typedefs in the beginning are for |
47 the LEMON graph types: the typedefs in the beginning are for |
48 convenience and we will assume them later as well. |
48 convenience and we will assume them later as well. |
49 |
49 |
50 \include hello_lemon.cc |
50 \dontinclude hello_lemon.cc |
|
51 \skip include |
|
52 \until } |
51 |
53 |
52 See the whole program in file \ref hello_lemon.cc in the \c demo subdir of |
54 See the whole program in file \ref hello_lemon.cc in the \c demo subdir of |
53 LEMON package. |
55 LEMON package. |
54 |
56 |
55 If you want to read more on the LEMON graph structures and |
57 If you want to read more on the LEMON graph structures and |
93 \endverbatim |
95 \endverbatim |
94 |
96 |
95 Finally let us give a simple example that reads a graph from a file and writes |
97 Finally let us give a simple example that reads a graph from a file and writes |
96 it to the standard output. |
98 it to the standard output. |
97 |
99 |
98 \include reader_writer_demo.cc |
100 \dontinclude reader_writer_demo.cc |
|
101 \skip include |
|
102 \until return |
|
103 \until } |
99 |
104 |
100 See the whole program in file \ref reader_writer_demo.cc. |
105 See the whole program in file \ref reader_writer_demo.cc. |
101 |
106 |
102 <li> The following code shows how to read a graph from a stream |
107 <li> The following code shows how to read a graph from a stream |
103 (e.g. a file) in the DIMACS file format (find the documentation of the |
108 (e.g. a file) in the DIMACS file format (find the documentation of the |