Changeset 2335:27aa03cd3121 in lemon-0.x for test/path_test.cc

Timestamp:

01/08/07 11:39:59 (17 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3123

Message:

New path concept and path structures

TODO: BellmanFord::negativeCycle()

File:

• test/path_test.cc (modified) (1 diff)

test/path_test.cc

@@ -32 +32 @@
 
 void check_concepts() {
-  checkConcept<concepts::Path<concepts::Graph>, 
-    concepts::Path<concepts::Graph> >();
-  checkConcept<concepts::Path<concepts::Graph>, 
-    Path<concepts::Graph> >();
+  checkConcept<concepts::Path<ListGraph>, concepts::Path<ListGraph> >();
   checkConcept<concepts::Path<ListGraph>, Path<ListGraph> >();
+  checkConcept<concepts::Path<ListGraph>, SimplePath<ListGraph> >();
+  checkConcept<concepts::Path<ListGraph>, StaticPath<ListGraph> >();
+  checkConcept<concepts::Path<ListGraph>, ListPath<ListGraph> >();
 }
 
 int main() {
-  check_concepts();
-  
-  ListGraph g;
-  
-  ListGraph::Node n1 = g.addNode();
-  ListGraph::Node n2 = g.addNode();
-  ListGraph::Node n3 = g.addNode();
-  ListGraph::Node n4 = g.addNode();
-  ListGraph::Node n5 = g.addNode();
- 
-  ListGraph::Edge e1 = g.addEdge(n1, n2);
-  ListGraph::Edge e2 = g.addEdge(n2, n3);
-  ListGraph::Edge e3 = g.addEdge(n3, n4);
-  ListGraph::Edge e4 = g.addEdge(n4, n5);
-  ListGraph::Edge e5 = g.addEdge(n5, n1);
-
-  {
-    Path<ListGraph> p(g);
-
-    check(p.empty(), "Wrong Path");
-    check(p.length() == 0, "Wrong Path");
-    
-    {
-      Path<ListGraph>::Builder b(p);
-      b.setStartNode(n3);
-      b.commit();
-    }
-
-    check(!p.empty(), "Wrong Path");
-    check(p.length() == 0, "Wrong Path");
-    check(p.source() == n3, "Wrong Path");
-    check(p.target() == n3, "Wrong Path");
-
-    {
-      Path<ListGraph>::Builder b(p);
-      b.pushBack(e3);
-      b.pushBack(e4);
-      b.pushFront(e2);
-      b.commit();
-    }
-
-    check(!p.empty(), "Wrong Path");
-    check(p.length() == 3, "Wrong Path");
-    check(p.source() == n2, "Wrong Path");
-    check(p.target() == n5, "Wrong Path");
-    
-    {
-      Path<ListGraph>::NodeIt it(p);
-      check((ListGraph::Node)it == n2, "Wrong Path"); ++it;
-      check((ListGraph::Node)it == n3, "Wrong Path"); ++it;
-      check((ListGraph::Node)it == n4, "Wrong Path"); ++it;
-      check((ListGraph::Node)it == n5, "Wrong Path"); ++it;
-      check((ListGraph::Node)it == INVALID, "Wrong Path");
-    }
-
-    {
-      Path<ListGraph>::EdgeIt it(p);
-      check((ListGraph::Edge)it == e2, "Wrong Path"); ++it;
-      check((ListGraph::Edge)it == e3, "Wrong Path"); ++it;
-      check((ListGraph::Edge)it == e4, "Wrong Path"); ++it;
-      check((ListGraph::Edge)it == INVALID, "Wrong Path");
-    }
-    
-  }
-  
+  check_concepts();  
   return 0;
 }