1.1 --- a/src/work/alpar/boolmap_iter.cc	Sat Nov 13 12:24:01 2004 +0000
     1.2 +++ b/src/work/alpar/boolmap_iter.cc	Sat Nov 13 12:53:28 2004 +0000
     1.3 @@ -119,13 +119,13 @@
     1.4    std::cout << true << '\n';
     1.5  
     1.6    for(EdgeIt e(G);G.valid(e);G.next(e))
     1.7 -    std::cout << G.id(G.tail(e)) << "->" << G.id(G.head(e))
     1.8 +    std::cout << G.id(G.source(e)) << "->" << G.id(G.target(e))
     1.9        << ": " << map[e] << '\n';
    1.10    std::cout << "True Edges:\n";
    1.11    for(BoolIterEdgeMap<Graph>::TrueIterator i(map);i;++i)
    1.12 -    std::cout << G.id(G.tail(i)) << "->" << G.id(G.head(i)) << '\n';
    1.13 +    std::cout << G.id(G.source(i)) << "->" << G.id(G.target(i)) << '\n';
    1.14    std::cout << "False Edges:\n";
    1.15    for(BoolIterEdgeMap<Graph>::FalseIterator i(map);i;++i)
    1.16 -    std::cout << G.id(G.tail(i)) << "->" << G.id(G.head(i)) << '\n';
    1.17 +    std::cout << G.id(G.source(i)) << "->" << G.id(G.target(i)) << '\n';
    1.18  }
    1.19