1.1 --- a/src/work/alpar/list_graph_demo.cc	Sat Nov 13 12:24:01 2004 +0000
     1.2 +++ b/src/work/alpar/list_graph_demo.cc	Sat Nov 13 12:53:28 2004 +0000
     1.3 @@ -111,10 +111,10 @@
     1.4      Graph::SymEdgeMap<int> sm(G);
     1.5      for(EdgeIt e(G);G.valid(e);G.next(e)) em[e]=G.id(e);
     1.6      for(EdgeIt e(G);G.valid(e);G.next(e))
     1.7 -      if(G.tail(e)<G.head(e)) sm[e]=G.id(e);
     1.8 +      if(G.source(e)<G.target(e)) sm[e]=G.id(e);
     1.9      
    1.10      for(EdgeIt e(G);G.valid(e);G.next(e))
    1.11 -      std::cout << G.id(G.tail(e)) << "->" << G.id(G.head(e))
    1.12 +      std::cout << G.id(G.source(e)) << "->" << G.id(G.target(e))
    1.13  		<< ": id=" << G.id(e) << " oppid=" << G.id(G.opposite(e))
    1.14  		<< " em=" << em[e]
    1.15  		<< " sm=" << sm[e] << "\n";