src/test/dijkstra_heap_test.cc
changeset 837 2d50d1f045c5
parent 776 f2994a2b10b2
child 906 17f31d280385
equal deleted inserted replaced
5:fd2ce66047de 6:ed8c816c543f
    29 
    29 
    30   typedef Graph::Edge Edge;
    30   typedef Graph::Edge Edge;
    31   typedef Graph::Node Node;
    31   typedef Graph::Node Node;
    32   typedef Graph::EdgeIt EdgeIt;
    32   typedef Graph::EdgeIt EdgeIt;
    33   typedef Graph::NodeIt NodeIt;
    33   typedef Graph::NodeIt NodeIt;
    34   typedef Graph::EdgeMap<int> LengthMap;
    34   typedef Graph::template EdgeMap<int> LengthMap;
    35 
    35 
    36   Graph G;
    36   Graph G;
    37   Node s, t;
    37   Node s, t;
    38   LengthMap cap(G);
    38   LengthMap cap(G);
    39   readDimacsMaxFlow(std::cin, G, s, t, cap);
    39   readDimacsMaxFlow(std::cin, G, s, t, cap);