equal
  deleted
  inserted
  replaced
  
    
    
    60   //  pn = dijkstra_test.predNodeMap();  | 
    60   //  pn = dijkstra_test.predNodeMap();  | 
    61   b  = dijkstra_test.reached(n);  | 
    61   b  = dijkstra_test.reached(n);  | 
    62     | 
    62     | 
    63 }  | 
    63 }  | 
    64   | 
    64   | 
         | 
    65 void check_Dijkstra_Function_Compile()   | 
         | 
    66 { | 
         | 
    67   typedef int VType;  | 
         | 
    68   typedef concept::StaticGraph Graph;  | 
         | 
    69   | 
         | 
    70   typedef Graph::Edge Edge;  | 
         | 
    71   typedef Graph::Node Node;  | 
         | 
    72   typedef Graph::EdgeIt EdgeIt;  | 
         | 
    73   typedef Graph::NodeIt NodeIt;  | 
         | 
    74   typedef concept::ReadMap<Edge,VType> LengthMap;  | 
         | 
    75      | 
         | 
    76   dijkstra(Graph(),LengthMap(),Node()).run();  | 
         | 
    77   dijkstra(Graph(),LengthMap()).source(Node()).run();  | 
         | 
    78   dijkstra(Graph(),LengthMap())  | 
         | 
    79     .predMap(concept::WriteMap<Node,Edge>())  | 
         | 
    80     .distMap(concept::WriteMap<Node,VType>())  | 
         | 
    81     .run(Node());  | 
         | 
    82     | 
         | 
    83 }  | 
         | 
    84   | 
         | 
    85   | 
    65 int main()  | 
    86 int main()  | 
    66 { | 
    87 { | 
    67       | 
    88       | 
    68   typedef SmartGraph Graph;  | 
    89   typedef SmartGraph Graph;  | 
    69   | 
    90   |