Changeset 977:48962802d168 in lemon-0.x for src/test
- Timestamp:
- 11/10/04 21:14:32 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1365
- Location:
- src/test
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
src/test/graph_utils_test.cc
r946 r977 3 3 #include <iostream> 4 4 #include <vector> 5 6 #include <lemon/graph_utils.h> 5 7 6 8 #include <lemon/list_graph.h> … … 23 25 checkGraphCounters<SmartGraph>(); 24 26 } 27 { 28 int num = 5; 29 FullGraph fg(num); 30 check(countNodes(fg) == num, "FullGraph: wrong node number."); 31 check(countEdges(fg) == num*num, "FullGraph: wrong edge number."); 32 } 25 33 26 34 std::cout << __FILE__ ": All tests passed.\n"; -
src/test/graph_utils_test.h
r946 r977 31 31 addPetersen(graph, num); 32 32 bidirGraph(graph); 33 check(countNodes(graph) == 2*num, "Wrong node counter.");34 check(countEdges(graph) == 6*num, "Wrong edge counter.");33 check(countNodes(graph) == 2*num, "Wrong node number."); 34 check(countEdges(graph) == 6*num, "Wrong edge number."); 35 35 for (typename Graph::NodeIt it(graph); it != INVALID; ++it) { 36 check(countOutEdges(graph, it) == 3, "Wrong out degree counter.");37 check(countInEdges(graph, it) == 3, "Wrong in degree counter.");36 check(countOutEdges(graph, it) == 3, "Wrong out degree number."); 37 check(countInEdges(graph, it) == 3, "Wrong in degree number."); 38 38 } 39 39 }
Note: See TracChangeset
for help on using the changeset viewer.