Changeset 570:eec0a62979c9 in lemon0.x for src
 Timestamp:
 05/07/04 10:02:17 (19 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@745
 Location:
 src
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

src/hugo/dijkstra.h
r542 r570 39 39 /// 40 40 ///\author Jacint Szabo 41 ///\todo We need a LengthMap typedef 41 42 #ifdef DOXYGEN 42 43 template <typename Graph, 
src/test/dijkstra_test.cc
r568 r570 6 6 7 7 const int PET_SIZE =5; 8 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 } 8 46 9 47 int main() … … 21 59 Node s, t; 22 60 LengthMap cap(G); 23 24 61 PetStruct<Graph> ps = addPetersen(G,PET_SIZE); 25 62 … … 39 76 40 77 } 41
Note: See TracChangeset
for help on using the changeset viewer.