[578] | 1 | #include "test_tools.h" |
---|
[568] | 2 | #include <hugo/smart_graph.h> |
---|
| 3 | #include <hugo/dijkstra.h> |
---|
| 4 | |
---|
| 5 | using namespace hugo; |
---|
| 6 | |
---|
| 7 | const int PET_SIZE =5; |
---|
| 8 | |
---|
[570] | 9 | |
---|
| 10 | void check_Dijkstra_SmartGraph_BinHeap_Compile() |
---|
| 11 | { |
---|
| 12 | typedef int VType; |
---|
| 13 | typedef SmartGraph Graph; |
---|
| 14 | |
---|
| 15 | typedef Graph::Edge Edge; |
---|
| 16 | typedef Graph::Node Node; |
---|
| 17 | typedef Graph::EdgeIt EdgeIt; |
---|
| 18 | typedef Graph::NodeIt NodeIt; |
---|
| 19 | typedef Graph::EdgeMap<VType> LengthMap; |
---|
| 20 | |
---|
| 21 | typedef Dijkstra<Graph, LengthMap> DType; |
---|
| 22 | |
---|
| 23 | Graph G; |
---|
| 24 | Node n; |
---|
| 25 | Edge e; |
---|
| 26 | VType l; |
---|
| 27 | bool b; |
---|
| 28 | DType::DistMap d(G); |
---|
| 29 | DType::PredMap p(G); |
---|
| 30 | DType::PredNodeMap pn(G); |
---|
| 31 | LengthMap cap(G); |
---|
| 32 | |
---|
| 33 | DType dijkstra_test(G,cap); |
---|
| 34 | |
---|
| 35 | dijkstra_test.run(n); |
---|
| 36 | |
---|
| 37 | l = dijkstra_test.dist(n); |
---|
| 38 | e = dijkstra_test.pred(n); |
---|
| 39 | n = dijkstra_test.predNode(n); |
---|
| 40 | d = dijkstra_test.distMap(); |
---|
| 41 | p = dijkstra_test.predMap(); |
---|
| 42 | pn = dijkstra_test.predNodeMap(); |
---|
| 43 | b = dijkstra_test.reached(n); |
---|
| 44 | |
---|
| 45 | } |
---|
| 46 | |
---|
[568] | 47 | int main() |
---|
| 48 | { |
---|
| 49 | |
---|
| 50 | typedef SmartGraph Graph; |
---|
| 51 | |
---|
| 52 | typedef Graph::Edge Edge; |
---|
| 53 | typedef Graph::Node Node; |
---|
| 54 | typedef Graph::EdgeIt EdgeIt; |
---|
| 55 | typedef Graph::NodeIt NodeIt; |
---|
| 56 | typedef Graph::EdgeMap<int> LengthMap; |
---|
| 57 | |
---|
| 58 | Graph G; |
---|
| 59 | Node s, t; |
---|
| 60 | LengthMap cap(G); |
---|
| 61 | PetStruct<Graph> ps = addPetersen(G,PET_SIZE); |
---|
[578] | 62 | |
---|
[568] | 63 | for(int i=0;i<PET_SIZE;i++) { |
---|
| 64 | cap[ps.outcir[i]]=4; |
---|
| 65 | cap[ps.incir[i]]=1; |
---|
| 66 | cap[ps.chords[i]]=10; |
---|
| 67 | } |
---|
| 68 | s=ps.outer[0]; |
---|
| 69 | t=ps.inner[1]; |
---|
| 70 | |
---|
| 71 | Dijkstra<Graph, LengthMap> |
---|
| 72 | dijkstra_test(G, cap); |
---|
| 73 | dijkstra_test.run(s); |
---|
| 74 | |
---|
| 75 | check(dijkstra_test.dist(t)==13,"Dijkstra found a wrong path."); |
---|
[585] | 76 | |
---|
| 77 | |
---|
| 78 | for(EdgeIt e(G); G.valid(e); G.next(e)) { |
---|
| 79 | Node u=G.tail(e); |
---|
| 80 | Node v=G.head(e); |
---|
| 81 | check( !dijkstra_test.reached(u) || |
---|
| 82 | (dijkstra_test.dist(v) - dijkstra_test.dist(u) <= cap[e]), |
---|
| 83 | "dist(head)-dist(tail)- edge_length= " |
---|
| 84 | << dijkstra_test.dist(v) - dijkstra_test.dist(u) |
---|
| 85 | - cap[e]); |
---|
| 86 | } |
---|
| 87 | |
---|
| 88 | ///\bug This works only for integer lengths |
---|
| 89 | for(NodeIt v(G); G.valid(v); G.next(v)) |
---|
| 90 | if ( dijkstra_test.reached(v) ) { |
---|
| 91 | Edge e=dijkstra_test.pred(v); |
---|
| 92 | Node u=G.tail(e); |
---|
| 93 | check(dijkstra_test.dist(v) - dijkstra_test.dist(u) == cap[e], |
---|
| 94 | "Bad shortest path tree edge! Difference: " |
---|
| 95 | << std::abs(dijkstra_test.dist(v) - dijkstra_test.dist(u) |
---|
| 96 | - cap[e])); |
---|
| 97 | } |
---|
[568] | 98 | } |
---|