equal
deleted
inserted
replaced
93 \endcode |
93 \endcode |
94 |
94 |
95 And finally you can start the process with \ref lemon::Bfs::start "start()", or |
95 And finally you can start the process with \ref lemon::Bfs::start "start()", or |
96 you can write your own loop to process the nodes one-by-one. |
96 you can write your own loop to process the nodes one-by-one. |
97 |
97 |
98 \todo demo for bfs advanced control |
98 \todo Demo for Bfs advanced control. |
99 |
99 |
100 \subsection Dfs |
100 \subsection Dfs |
101 Since Dfs is very similar to Bfs with a few tiny differences we only see a bit more complex example |
101 Since Dfs is very similar to Bfs with a few tiny differences we only see a bit more complex example |
102 to demonstrate Dfs's capabilities. |
102 to demonstrate Dfs's capabilities. |
103 |
103 |
147 \skip std |
147 \skip std |
148 \until endl |
148 \until endl |
149 |
149 |
150 The program is to be found in the \ref demo directory: \ref topological_ordering.cc |
150 The program is to be found in the \ref demo directory: \ref topological_ordering.cc |
151 |
151 |
|
152 \todo Check the linking of the demo file, the code samples are missing. |
|
153 |
152 More algorithms are described in the \ref algorithms2 "second part". |
154 More algorithms are described in the \ref algorithms2 "second part". |
153 */ |
155 */ |
154 } |
156 } |