1.1 --- a/src/work/marci/leda_graph_demo.cc	Sat Nov 13 12:24:01 2004 +0000
     1.2 +++ b/src/work/marci/leda_graph_demo.cc	Sat Nov 13 12:53:28 2004 +0000
     1.3 @@ -38,10 +38,10 @@
     1.4  //     cout << G.id(n) << ": ";
     1.5  //     cout << "out edges: ";
     1.6  //     for(OutEdgeIt e=G.first<OutEdgeIt>(n); G.valid(e); G.next(e)) 
     1.7 -//       cout << G.id(G.tail(e)) << "-" << cap.get(e) << "->" << G.id(G.head(e)) << " ";
     1.8 +//       cout << G.id(G.source(e)) << "-" << cap.get(e) << "->" << G.id(G.target(e)) << " ";
     1.9  //     cout << "in edges: ";
    1.10  //     for(InEdgeIt e=G.first<InEdgeIt>(n); G.valid(e); G.next(e)) 
    1.11 -//       cout << G.id(G.tail(e)) << "-" << cap.get(e) << "->" << G.id(G.head(e)) << " ";
    1.12 +//       cout << G.id(G.source(e)) << "-" << cap.get(e) << "->" << G.id(G.target(e)) << " ";
    1.13  //     cout << endl;
    1.14  //   }
    1.15  
    1.16 @@ -64,7 +64,7 @@
    1.17      int i=0;
    1.18      while (max_flow_test.augmentOnShortestPath()) { 
    1.19  //     for(EdgeIt e=G.template first<EdgeIt>(); e.valid(); ++e) { 
    1.20 -//       std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") ";
    1.21 +//       std::cout<<"("<<G.source(e)<< "-"<<flow.get(e)<<"->"<<G.target(e)<<") ";
    1.22  //     }
    1.23  //     std::cout<<std::endl;
    1.24        ++i; 
    1.25 @@ -72,7 +72,7 @@
    1.26  
    1.27  //   std::cout << "maximum flow: "<< std::endl;
    1.28  //   for(EdgeIt e=G.first<EdgeIt>(); e.valid(); ++e) { 
    1.29 -//     std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") ";
    1.30 +//     std::cout<<"("<<G.source(e)<< "-"<<flow.get(e)<<"->"<<G.target(e)<<") ";
    1.31  //   }
    1.32  //   std::cout<<std::endl;
    1.33      std::cout << "elapsed time: " << ts << std::endl;