lemon-0.x: comparison src/test/graph

equal deleted inserted replaced

-:766118a6c65a
+:37e4c7f6e824
 						   int nn)
 {
 typename Graph::OutEdgeIt e(G,n);
 for(int i=0;i<nn;i++) {
 	check(e!=INVALID,"Wrong OutEdge list linking.");
+	check(n==G.tail(e), "Wrong OutEdge list linking.");
 	++e;
 }
 check(e==INVALID,"Wrong OutEdge list linking.");
 }
 						  int nn)
 {
 typename Graph::InEdgeIt e(G,n);
 for(int i=0;i<nn;i++) {
 	check(e!=INVALID,"Wrong InEdge list linking.");
+	check(n==G.head(e), "Wrong InEdge list linking.");
 	++e;
 }
 check(e==INVALID,"Wrong InEdge list linking.");
 }