1.1 --- a/demo/dijkstra_demo.cc	Wed Jun 29 19:44:30 2005 +0000
     1.2 +++ b/demo/dijkstra_demo.cc	Thu Jun 30 16:13:30 2005 +0000
     1.3 @@ -2,7 +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 +//#include <lemon/graph_writer.h>
     1.9  
    1.10  using namespace lemon;
    1.11  
    1.12 @@ -49,7 +49,7 @@
    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.writeEdgeMap("capacity", len);
    1.18  //     writer.writeNode("source", s);
    1.19  //     writer.writeNode("target", t);
    1.20  //     writer.run();