Changeset 2260:4274224f8a7d in lemon-0.x for test/dijkstra_test.cc
- Timestamp:
- 10/24/06 19:19:16 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3016
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
test/dijkstra_test.cc
r2247 r2260 22 22 #include <lemon/path.h> 23 23 #include <lemon/maps.h> 24 #include <lemon/concept /graph.h>25 #include <lemon/concept /maps.h>24 #include <lemon/concepts/graph.h> 25 #include <lemon/concepts/maps.h> 26 26 using namespace lemon; 27 27 … … 32 32 { 33 33 typedef int VType; 34 typedef concept ::Graph Graph;34 typedef concepts::Graph Graph; 35 35 36 36 typedef Graph::Edge Edge; … … 38 38 typedef Graph::EdgeIt EdgeIt; 39 39 typedef Graph::NodeIt NodeIt; 40 typedef concept ::ReadMap<Edge,VType> LengthMap;40 typedef concepts::ReadMap<Edge,VType> LengthMap; 41 41 42 42 typedef Dijkstra<Graph, LengthMap> DType; … … 71 71 { 72 72 typedef int VType; 73 typedef concept ::Graph Graph;73 typedef concepts::Graph Graph; 74 74 75 75 typedef Graph::Edge Edge; … … 77 77 typedef Graph::EdgeIt EdgeIt; 78 78 typedef Graph::NodeIt NodeIt; 79 typedef concept ::ReadMap<Edge,VType> LengthMap;79 typedef concepts::ReadMap<Edge,VType> LengthMap; 80 80 81 81 Graph g; … … 83 83 dijkstra(g,LengthMap()).source(Node()).run(); 84 84 dijkstra(g,LengthMap()) 85 .predMap(concept ::WriteMap<Node,Edge>())86 .distMap(concept ::WriteMap<Node,VType>())85 .predMap(concepts::WriteMap<Node,Edge>()) 86 .distMap(concepts::WriteMap<Node,VType>()) 87 87 .run(Node()); 88 88
Note: See TracChangeset
for help on using the changeset viewer.