equal
deleted
inserted
replaced
112 "Wrong OutArc list linking."); |
112 "Wrong OutArc list linking."); |
113 ++e; |
113 ++e; |
114 } |
114 } |
115 check(e==INVALID,"Wrong IncEdge list linking."); |
115 check(e==INVALID,"Wrong IncEdge list linking."); |
116 check(countIncEdges(G,n)==cnt,"Wrong IncEdge number."); |
116 check(countIncEdges(G,n)==cnt,"Wrong IncEdge number."); |
|
117 } |
|
118 |
|
119 template <class Graph> |
|
120 void checkGraphIncEdgeArcLists(const Graph &G, typename Graph::Node n, |
|
121 int cnt) |
|
122 { |
|
123 checkGraphIncEdgeList(G, n, cnt); |
|
124 checkGraphOutArcList(G, n, cnt); |
|
125 checkGraphInArcList(G, n, cnt); |
117 } |
126 } |
118 |
127 |
119 template <class Graph> |
128 template <class Graph> |
120 void checkGraphConArcList(const Graph &G, int cnt) { |
129 void checkGraphConArcList(const Graph &G, int cnt) { |
121 int i = 0; |
130 int i = 0; |