equal
deleted
inserted
replaced
1 #include <iostream> |
1 #include <iostream> |
2 |
2 |
3 #include <lemon/list_graph.h> |
3 #include <lemon/list_graph.h> |
4 #include <lemon/dijkstra.h> |
4 #include <lemon/dijkstra.h> |
|
5 //#include <lemon/bits/item_writer.h> |
5 |
6 |
6 using namespace lemon; |
7 using namespace lemon; |
7 |
8 |
8 |
9 |
9 int main (int, char*[]) |
10 int main (int, char*[]) |
45 |
46 |
46 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; |
47 |
48 |
48 std::cout << "Dijkstra algorithm test..." << std::endl; |
49 std::cout << "Dijkstra algorithm test..." << std::endl; |
49 |
50 |
|
51 // GraphWriter<ListGraph> writer(std::cout, g); |
|
52 // writer.writeEdgeMap("capacity", length); |
|
53 // writer.writeNode("source", s); |
|
54 // writer.writeNode("target", t); |
|
55 // writer.run(); |
|
56 |
50 Dijkstra<Graph, LengthMap> dijkstra_test(g,len); |
57 Dijkstra<Graph, LengthMap> dijkstra_test(g,len); |
51 |
58 |
52 dijkstra_test.run(s); |
59 dijkstra_test.run(s); |
53 |
60 |
54 |
61 |