1.1 --- a/demo/dijkstra_demo.cc Mon Jun 27 20:44:29 2005 +0000
1.2 +++ b/demo/dijkstra_demo.cc Tue Jun 28 13:47:16 2005 +0000
1.3 @@ -2,6 +2,7 @@
1.4
1.5 #include <lemon/list_graph.h>
1.6 #include <lemon/dijkstra.h>
1.7 +//#include <lemon/bits/item_writer.h>
1.8
1.9 using namespace lemon;
1.10
1.11 @@ -47,6 +48,12 @@
1.12
1.13 std::cout << "Dijkstra algorithm test..." << std::endl;
1.14
1.15 +// GraphWriter<ListGraph> writer(std::cout, g);
1.16 +// writer.writeEdgeMap("capacity", length);
1.17 +// writer.writeNode("source", s);
1.18 +// writer.writeNode("target", t);
1.19 +// writer.run();
1.20 +
1.21 Dijkstra<Graph, LengthMap> dijkstra_test(g,len);
1.22
1.23 dijkstra_test.run(s);