equal
deleted
inserted
replaced
28 void checkGraphCounters() { |
28 void checkGraphCounters() { |
29 const int num = 5; |
29 const int num = 5; |
30 Graph graph; |
30 Graph graph; |
31 addPetersen(graph, num); |
31 addPetersen(graph, num); |
32 bidirGraph(graph); |
32 bidirGraph(graph); |
33 check(countNodes(graph) == 2*num, "Wrong node counter."); |
33 check(countNodes(graph) == 2*num, "Wrong node number."); |
34 check(countEdges(graph) == 6*num, "Wrong edge counter."); |
34 check(countEdges(graph) == 6*num, "Wrong edge number."); |
35 for (typename Graph::NodeIt it(graph); it != INVALID; ++it) { |
35 for (typename Graph::NodeIt it(graph); it != INVALID; ++it) { |
36 check(countOutEdges(graph, it) == 3, "Wrong out degree counter."); |
36 check(countOutEdges(graph, it) == 3, "Wrong out degree number."); |
37 check(countInEdges(graph, it) == 3, "Wrong in degree counter."); |
37 check(countInEdges(graph, it) == 3, "Wrong in degree number."); |
38 } |
38 } |
39 } |
39 } |
40 |
40 |
41 } //namespace lemon |
41 } //namespace lemon |
42 |
42 |