demo/dijkstra_demo.cc
changeset 1529 c914e7ec2b7b
parent 1526 8c14aa8f27a2
child 1530 d99c3c84f797
equal deleted inserted replaced
2:5247082a022b 3:762cf806d8cb
    46 
    46 
    47     std::cout << "The id of s is " << g.id(s)<< ", the id of t is " << g.id(t)<<"."<<std::endl;
    47     std::cout << "The id of s is " << g.id(s)<< ", the id of t is " << g.id(t)<<"."<<std::endl;
    48 
    48 
    49     std::cout << "Dijkstra algorithm test..." << std::endl;
    49     std::cout << "Dijkstra algorithm test..." << std::endl;
    50 
    50 
    51 //     GraphWriter<ListGraph> writer(std::cout, g);
       
    52 //     writer.writeEdgeMap("capacity", len);
       
    53 //     writer.writeNode("source", s);
       
    54 //     writer.writeNode("target", t);
       
    55 //     writer.run();
       
    56 
    51 
    57     Dijkstra<Graph, LengthMap> dijkstra_test(g,len);
    52     Dijkstra<Graph, LengthMap> dijkstra_test(g,len);
    58     
    53     
    59     dijkstra_test.run(s);
    54     dijkstra_test.run(s);
    60 
    55