equal
deleted
inserted
replaced
129 |
129 |
130 template <typename Heap> |
130 template <typename Heap> |
131 void dijkstraHeapTest(const Digraph& digraph, const IntArcMap& length, |
131 void dijkstraHeapTest(const Digraph& digraph, const IntArcMap& length, |
132 Node source) { |
132 Node source) { |
133 |
133 |
134 typename Dijkstra<Digraph, IntArcMap>::template DefStandardHeap<Heap>:: |
134 typename Dijkstra<Digraph, IntArcMap>::template SetStandardHeap<Heap>:: |
135 Create dijkstra(digraph, length); |
135 Create dijkstra(digraph, length); |
136 |
136 |
137 dijkstra.run(source); |
137 dijkstra.run(source); |
138 |
138 |
139 for(ArcIt a(digraph); a != INVALID; ++a) { |
139 for(ArcIt a(digraph); a != INVALID; ++a) { |