Changes in test/graph_utils_test.cc [324:fafece417795:220:a5d8c039f218] in lemon
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
test/graph_utils_test.cc
r324 r220 36 36 { 37 37 Digraph digraph; 38 typename Digraph::template NodeMap<int> nodes(digraph);39 std::vector<Node> invNodes;40 38 for (int i = 0; i < 10; ++i) { 41 invNodes.push_back(digraph.addNode()); 42 nodes[invNodes.back()]=invNodes.size()-1; 43 } 39 digraph.addNode(); 40 } 41 DescriptorMap<Digraph, Node> nodes(digraph); 42 typename DescriptorMap<Digraph, Node>::InverseMap invNodes(nodes); 44 43 for (int i = 0; i < 100; ++i) { 45 44 int src = rnd[invNodes.size()]; … … 48 47 } 49 48 typename Digraph::template ArcMap<bool> found(digraph, false); 49 DescriptorMap<Digraph, Arc> arcs(digraph); 50 50 for (NodeIt src(digraph); src != INVALID; ++src) { 51 51 for (NodeIt trg(digraph); trg != INVALID; ++trg) { … … 111 111 TEMPLATE_GRAPH_TYPEDEFS(Graph); 112 112 Graph graph; 113 typename Graph::template NodeMap<int> nodes(graph);114 std::vector<Node> invNodes;115 113 for (int i = 0; i < 10; ++i) { 116 invNodes.push_back(graph.addNode()); 117 nodes[invNodes.back()]=invNodes.size()-1; 118 } 114 graph.addNode(); 115 } 116 DescriptorMap<Graph, Node> nodes(graph); 117 typename DescriptorMap<Graph, Node>::InverseMap invNodes(nodes); 119 118 for (int i = 0; i < 100; ++i) { 120 119 int src = rnd[invNodes.size()]; … … 123 122 } 124 123 typename Graph::template EdgeMap<int> found(graph, 0); 124 DescriptorMap<Graph, Edge> edges(graph); 125 125 for (NodeIt src(graph); src != INVALID; ++src) { 126 126 for (NodeIt trg(graph); trg != INVALID; ++trg) {
Note: See TracChangeset
for help on using the changeset viewer.