test/heap_test.h
changeset 1751 a2a454f1232d
parent 1728 eb8bb91ba9e2
child 1763 49045f2d28d4
equal deleted inserted replaced
1:59ffde8511c0 2:1cfa00dbbb81
    76   typedef typename Graph::Node Node;
    76   typedef typename Graph::Node Node;
    77   typedef typename Graph::Edge Edge;
    77   typedef typename Graph::Edge Edge;
    78   typedef typename Graph::NodeIt NodeIt;
    78   typedef typename Graph::NodeIt NodeIt;
    79   typedef typename Graph::EdgeIt EdgeIt;
    79   typedef typename Graph::EdgeIt EdgeIt;
    80 
    80 
    81   typename Dijkstra<Graph, LengthMap>::template DefHeap<Heap>::
    81   typename Dijkstra<Graph, LengthMap>::template DefStandardHeap<Heap>::
    82     Create dijkstra(graph, length);
    82     Create dijkstra(graph, length);
    83 
    83 
    84   dijkstra.run(start);
    84   dijkstra.run(start);
    85 
    85 
    86   for(EdgeIt e(graph); e!=INVALID; ++e) {
    86   for(EdgeIt e(graph); e!=INVALID; ++e) {