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