src/test/dijkstra_test.cc
changeset 959 c80ef5912903
parent 921 818510fa3d99
child 986 e997802b855c
equal deleted inserted replaced
10:538ca60ba54b 11:4b93464d3222
    15  */
    15  */
    16 
    16 
    17 #include "test_tools.h"
    17 #include "test_tools.h"
    18 #include <lemon/smart_graph.h>
    18 #include <lemon/smart_graph.h>
    19 #include <lemon/dijkstra.h>
    19 #include <lemon/dijkstra.h>
    20 #include<lemon/skeletons/graph.h>
    20 #include <lemon/concept/graph.h>
    21 #include<lemon/skeletons/maps.h>
    21 #include <lemon/concept/maps.h>
    22 using namespace lemon;
    22 using namespace lemon;
    23 
    23 
    24 const int PET_SIZE =5;
    24 const int PET_SIZE =5;
    25 
    25 
    26 
    26 
    27 void check_Dijkstra_BinHeap_Compile() 
    27 void check_Dijkstra_BinHeap_Compile() 
    28 {
    28 {
    29   typedef int VType;
    29   typedef int VType;
    30   typedef skeleton::StaticGraph Graph;
    30   typedef concept::StaticGraph Graph;
    31 
    31 
    32   typedef Graph::Edge Edge;
    32   typedef Graph::Edge Edge;
    33   typedef Graph::Node Node;
    33   typedef Graph::Node Node;
    34   typedef Graph::EdgeIt EdgeIt;
    34   typedef Graph::EdgeIt EdgeIt;
    35   typedef Graph::NodeIt NodeIt;
    35   typedef Graph::NodeIt NodeIt;
    36   typedef skeleton::ReadMap<Edge,VType> LengthMap;
    36   typedef concept::ReadMap<Edge,VType> LengthMap;
    37  
    37  
    38   typedef Dijkstra<Graph, LengthMap> DType;
    38   typedef Dijkstra<Graph, LengthMap> DType;
    39   
    39   
    40   Graph G;
    40   Graph G;
    41   Node n;
    41   Node n;