equal
deleted
inserted
replaced
42 len.set(v2_v5, 8); |
42 len.set(v2_v5, 8); |
43 len.set(v3_v5, 5); |
43 len.set(v3_v5, 5); |
44 len.set(v4_t, 8); |
44 len.set(v4_t, 8); |
45 len.set(v5_t, 8); |
45 len.set(v5_t, 8); |
46 |
46 |
|
47 std::cout << "This program is a simple demo of the LEMON Dijkstra class."<<std::endl; |
|
48 std::cout << "We calculate the shortest path from node s to node t in a graph."<<std::endl; |
|
49 std::cout <<std::endl; |
|
50 |
|
51 |
47 std::cout << "The id of s is " << g.id(s)<< ", the id of t is " << g.id(t)<<"."<<std::endl; |
52 std::cout << "The id of s is " << g.id(s)<< ", the id of t is " << g.id(t)<<"."<<std::endl; |
48 |
53 |
49 std::cout << "Dijkstra algorithm test..." << std::endl; |
54 std::cout << "Dijkstra algorithm test..." << std::endl; |
50 |
55 |
51 |
56 |