1 #include <iostream> |
1 #include <iostream> |
2 #include <fstream> |
2 #include <fstream> |
3 |
3 |
4 #include <smart_graph.h> |
4 #include <list_graph.hh> |
5 #include <list_graph.h> |
5 #include <dimacs.hh> |
6 #include <dimacs.h> |
|
7 #include <dijkstra.h> |
6 #include <dijkstra.h> |
8 #include <time_measure.h> |
7 #include <time_measure.h> |
9 |
8 #include <bin_heap.hh> |
10 #include <bin_heap.h> |
|
11 #include <fib_heap.h> |
|
12 |
9 |
13 using namespace hugo; |
10 using namespace hugo; |
14 |
11 |
15 int main(int, char **) { |
12 int main(int, char **) { |
16 typedef SmartGraph::Node Node; |
13 |
17 typedef SmartGraph::NodeIt NodeIt; |
14 typedef ListGraph Graph; |
18 typedef SmartGraph::InEdgeIt InEdgeIt; |
|
19 |
15 |
20 SmartGraph G; |
16 typedef Graph::Node Node; |
|
17 typedef Graph::EdgeIt EdgeIt; |
|
18 |
|
19 Graph G; |
21 Node s, t; |
20 Node s, t; |
22 SmartGraph::EdgeMap<int> cap(G); |
21 Graph::EdgeMap<int> cap(G); |
23 readDimacsMaxFlow(std::cin, G, s, t, cap); |
22 readDimacsMaxFlow(std::cin, G, s, t, cap); |
24 |
23 Timer ts; |
25 std::cout << "dijkstra demo ..." << std::endl; |
|
26 |
24 |
27 double pre_time=currTime(); |
25 std::cout << "Testing dijkstra.h with Fibonacci-heap |
28 Dijkstra<SmartGraph, int, FibHeap<SmartGraph::Node, int, |
26 implementation fib_heap.h ..." << std::endl; |
29 SmartGraph::NodeMap<int> > > dijkstra_test(G, cap); |
27 |
30 dijkstra_test.run(s); |
28 Dijkstra<Graph, int |
|
29 // , BinHeap<ListGraph::NodeIt, int, ListGraph::NodeMap<int> > |
|
30 > dijkstra_test(G, s, cap); |
|
31 ts.reset(); |
|
32 dijkstra_test.run(); |
|
33 std::cout << "elapsed time: " << ts << std::endl; |
31 double post_time=currTime(); |
34 double post_time=currTime(); |
32 |
35 |
33 std::cout << "running time with fib_heap: " |
36 std::cout << "running time: " << post_time-pre_time << " sec"<< std::endl; |
34 << post_time-pre_time << " sec"<< std::endl; |
|
35 |
37 |
36 pre_time=currTime(); |
38 EachEdgeIt e; |
37 Dijkstra<SmartGraph, int, BinHeap<SmartGraph::Node, int, |
|
38 SmartGraph::NodeMap<int> > > dijkstra_test2(G, cap); |
|
39 dijkstra_test2.run(s); |
|
40 post_time=currTime(); |
|
41 |
|
42 std::cout << "running time with bin_heap: " |
|
43 << post_time-pre_time << " sec"<< std::endl; |
|
44 |
|
45 |
39 |
46 int hiba_fib=0; |
40 int hiba=0; |
47 int hiba_bin=0; |
41 |
48 NodeIt u; |
42 int edge=0; |
49 for ( G.first(u) ; G.valid(u); G.next(u) ) { |
43 |
50 InEdgeIt e; |
44 for ( G.getFirst(e) ; G.valid(e); G.next(e) ) { |
51 for ( G.first(e,u); G.valid(e); G.next(e) ) { |
45 NodeIt u=G.tail(e); |
52 Node v=G.tail(e); |
46 NodeIt v=G.head(e); |
53 if ( dijkstra_test.dist(u) - dijkstra_test.dist(v) > cap[e] ) |
47 ++edge; |
54 { |
48 if ( dijkstra_test.dist(v) - dijkstra_test.dist(u) > cap.get(e) ) { |
55 std::cout<<"Hibas el a fibonaccis Dijkstraban: " |
49 std::cout<<"Hiba: "<<edge<<": "<<dijkstra_test.dist(v) - dijkstra_test.dist(u) - cap.get(e)<<std::endl; |
56 << dijkstra_test.dist(u) - dijkstra_test.dist(v) - |
50 ++hiba; |
57 cap[e]<<std::endl; |
|
58 ++hiba_fib; |
|
59 } |
|
60 if ( dijkstra_test2.dist(u) - dijkstra_test2.dist(v) > cap[e] ) |
|
61 { |
|
62 std::cout<<"Hibas el a binarisos Dijkstraban: " |
|
63 << dijkstra_test2.dist(u) - dijkstra_test2.dist(v) - |
|
64 cap[e]<<std::endl; |
|
65 ++hiba_bin; |
|
66 } |
|
67 if ( e==dijkstra_test.pred(u) && |
|
68 dijkstra_test.dist(u) - dijkstra_test.dist(v) != cap[e] ) |
|
69 { |
|
70 std::cout<<"Hibas fael a fibonaccis Dijkstraban: "<< |
|
71 dijkstra_test.dist(u) - dijkstra_test.dist(v)- cap[e]<<std::endl; |
|
72 ++hiba_fib; |
|
73 } |
|
74 if ( e==dijkstra_test2.pred(u) && |
|
75 dijkstra_test2.dist(u) - dijkstra_test2.dist(v) != cap[e] ) |
|
76 { |
|
77 std::cout<<"Hibas fael a binarisos Dijkstraban: "<< |
|
78 dijkstra_test2.dist(u) - dijkstra_test2.dist(v)- cap[e]<<std::endl; |
|
79 ++hiba_bin; |
|
80 } |
|
81 } |
51 } |
82 |
52 } |
83 if ( dijkstra_test.dist(u) != dijkstra_test2.dist(u) ) |
|
84 std::cout << "Nem egyezik meg a tavolsag!"<<std::endl; |
|
85 |
53 |
86 |
54 std::cout << "Osszhibas el: " << hiba << " osszel: " << G.edgeNum() << std::endl; |
87 } |
|
88 |
|
89 std::cout << "Hibas elek szama a fibonaccis Dijkstraban: " |
|
90 << hiba_fib << " a " << G.edgeNum() <<"-bol."<< std::endl; |
|
91 |
|
92 std::cout << "Hibas elek szama a binarisos Dijkstraban: " |
|
93 << hiba_bin << " a " << G.edgeNum() <<"-bol."<< std::endl; |
|
94 |
|
95 |
|
96 |
|
97 |
55 |
98 return 0; |
56 return 0; |
99 } |
57 } |