# HG changeset patch
# User athos
# Date 1119966436 0
# Node ID 5815b382421b82dfe07e2b555a16638de3a2a570
# Parent  c2c76e4598f6472f0437285b25b8730727e0c177
Some modifications.

diff -r c2c76e4598f6 -r 5815b382421b demo/dijkstra_demo.cc
--- a/demo/dijkstra_demo.cc	Mon Jun 27 20:44:29 2005 +0000
+++ b/demo/dijkstra_demo.cc	Tue Jun 28 13:47:16 2005 +0000
@@ -2,6 +2,7 @@
 
 #include <lemon/list_graph.h>
 #include <lemon/dijkstra.h>
+//#include <lemon/bits/item_writer.h>
 
 using namespace lemon;
 
@@ -47,6 +48,12 @@
 
     std::cout << "Dijkstra algorithm test..." << std::endl;
 
+//     GraphWriter<ListGraph> writer(std::cout, g);
+//     writer.writeEdgeMap("capacity", length);
+//     writer.writeNode("source", s);
+//     writer.writeNode("target", t);
+//     writer.run();
+
     Dijkstra<Graph, LengthMap> dijkstra_test(g,len);
     
     dijkstra_test.run(s);
diff -r c2c76e4598f6 -r 5815b382421b doc/quicktour.dox
--- a/doc/quicktour.dox	Mon Jun 27 20:44:29 2005 +0000
+++ b/doc/quicktour.dox	Tue Jun 28 13:47:16 2005 +0000
@@ -265,11 +265,9 @@
 
 <tt>./lp_maxflow_demo < ?????????.lgf</tt>
 
-where ?????????.lgf is a file in the lemon format containing a maxflow instance (designated "source", "target" nodes and "capacity" map).
+where ?????????.lgf is a file in the lemon format containing a maxflow instance (designated "source", "target" nodes and "capacity" map on the edges).
 
 
-See the whole code in \ref lp_demo.cc.
-
 
 </ol>
 </ul>