1.1 --- a/src/test/graph_test.h	Mon Oct 04 16:03:25 2004 +0000
     1.2 +++ b/src/test/graph_test.h	Mon Oct 04 17:13:21 2004 +0000
     1.3 @@ -298,6 +298,7 @@
     1.4        typename Graph::OutEdgeIt e(G,n);
     1.5        for(int i=0;i<nn;i++) {
     1.6  	check(e!=INVALID,"Wrong OutEdge list linking.");
     1.7 +	check(n==G.tail(e), "Wrong OutEdge list linking.");
     1.8  	++e;
     1.9        }
    1.10        check(e==INVALID,"Wrong OutEdge list linking.");
    1.11 @@ -310,6 +311,7 @@
    1.12        typename Graph::InEdgeIt e(G,n);
    1.13        for(int i=0;i<nn;i++) {
    1.14  	check(e!=INVALID,"Wrong InEdge list linking.");
    1.15 +	check(n==G.head(e), "Wrong InEdge list linking.");
    1.16  	++e;
    1.17        }
    1.18        check(e==INVALID,"Wrong InEdge list linking.");