3 * This file is a part of LEMON, a generic C++ optimization library
5 * Copyright (C) 2003-2006
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
9 * Permission to use, modify and distribute this software is granted
10 * provided that this copyright notice appears in all copies. For
11 * precise terms see the accompanying LICENSE file.
13 * This software is provided "AS IS" with no warranty of any kind,
14 * express or implied, and with no claim as to its suitability for any
19 #include "test_tools.h"
20 #include <lemon/smart_graph.h>
21 #include <lemon/dijkstra.h>
22 #include <lemon/path.h>
23 #include <lemon/maps.h>
24 #include <lemon/concepts/graph.h>
25 #include <lemon/concepts/maps.h>
26 using namespace lemon;
29 const int PET_SIZE =5;
32 void check_Dijkstra_BinHeap_Compile()
35 typedef concepts::Graph Graph;
37 typedef Graph::Edge Edge;
38 typedef Graph::Node Node;
39 typedef Graph::EdgeIt EdgeIt;
40 typedef Graph::NodeIt NodeIt;
41 typedef concepts::ReadMap<Edge,VType> LengthMap;
43 typedef Dijkstra<Graph, LengthMap> DType;
52 // DType::PredNodeMap pn(G);
55 DType dijkstra_test(G,cap);
59 l = dijkstra_test.dist(n);
60 e = dijkstra_test.predEdge(n);
61 n = dijkstra_test.predNode(n);
62 d = dijkstra_test.distMap();
63 p = dijkstra_test.predMap();
64 // pn = dijkstra_test.predNodeMap();
65 b = dijkstra_test.reached(n);
68 dijkstra_test.getPath(pp,n);
71 void check_Dijkstra_Function_Compile()
74 typedef concepts::Graph Graph;
76 typedef Graph::Edge Edge;
77 typedef Graph::Node Node;
78 typedef Graph::EdgeIt EdgeIt;
79 typedef Graph::NodeIt NodeIt;
80 typedef concepts::ReadMap<Edge,VType> LengthMap;
83 dijkstra(g,LengthMap(),Node()).run();
84 dijkstra(g,LengthMap()).source(Node()).run();
85 dijkstra(g,LengthMap())
86 .predMap(concepts::WriteMap<Node,Edge>())
87 .distMap(concepts::WriteMap<Node,VType>())
96 typedef SmartGraph Graph;
98 typedef Graph::Edge Edge;
99 typedef Graph::Node Node;
100 typedef Graph::EdgeIt EdgeIt;
101 typedef Graph::NodeIt NodeIt;
102 typedef Graph::EdgeMap<int> LengthMap;
107 PetStruct<Graph> ps = addPetersen(G,PET_SIZE);
109 for(int i=0;i<PET_SIZE;i++) {
112 cap[ps.chords[i]]=10;
117 Dijkstra<Graph, LengthMap>
118 dijkstra_test(G, cap);
119 dijkstra_test.run(s);
121 check(dijkstra_test.dist(t)==13,"Dijkstra found a wrong path.");
125 check(dijkstra_test.getPath(p,t),"getPath() failed to set the path.");
126 check(p.length()==4,"getPath() found a wrong path.");
129 for(EdgeIt e(G); e!=INVALID; ++e) {
132 check( !dijkstra_test.reached(u) ||
133 (dijkstra_test.dist(v) - dijkstra_test.dist(u) <= cap[e]),
134 "dist(target)-dist(source)- edge_length= "
135 << dijkstra_test.dist(v) - dijkstra_test.dist(u)
139 ///\bug This works only for integer lengths
140 for(NodeIt v(G); v!=INVALID; ++v){
141 check(dijkstra_test.reached(v),"Each node should be reached.");
142 if ( dijkstra_test.predEdge(v)!=INVALID ) {
143 Edge e=dijkstra_test.predEdge(v);
145 check(u==dijkstra_test.predNode(v),"Wrong tree.");
146 check(dijkstra_test.dist(v) - dijkstra_test.dist(u) == cap[e],
147 "Wrong distance! Difference: "
148 << std::abs(dijkstra_test.dist(v) - dijkstra_test.dist(u)
155 NullMap<Node,Edge> myPredMap;
156 dijkstra(G,cap).predMap(myPredMap).run(s);