1.1 --- a/src/work/marci/bipartite_matching_try_2.cc	Fri Apr 30 17:48:50 2004 +0000
     1.2 +++ b/src/work/marci/bipartite_matching_try_2.cc	Fri Apr 30 18:43:18 2004 +0000
     1.3 @@ -76,11 +76,14 @@
     1.4    FOR_EACH_LOC(EdgeIt, e, g) std::cout << e << " ";
     1.5    std::cout << std::endl;
     1.6  
     1.7 +  std::cout << "Nodes:" << std::endl;
     1.8 +  FOR_EACH_LOC(Graph::NodeIt, v, g) std::cout << v << " ";
     1.9 +  std::cout << std::endl;
    1.10    std::cout << "Nodes in T:" << std::endl;
    1.11 -  FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, g.T_CLASS) std::cout << v << " ";
    1.12 +  FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::T_CLASS) std::cout << v << " ";
    1.13    std::cout << std::endl;
    1.14    std::cout << "Nodes in S:" << std::endl;
    1.15 -  FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, g.S_CLASS) std::cout << v << " ";
    1.16 +  FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::S_CLASS) std::cout << v << " ";
    1.17    std::cout << std::endl;
    1.18  
    1.19    std::cout << "Erasing the first node..." << std::endl;
    1.20 @@ -92,10 +95,10 @@
    1.21    std::cout << std::endl;
    1.22  
    1.23    std::cout << "Nodes in T:" << std::endl;
    1.24 -  FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, g.T_CLASS) std::cout << v << " ";
    1.25 +  FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::T_CLASS) std::cout << v << " ";
    1.26    std::cout << std::endl;
    1.27    std::cout << "Nodes in S:" << std::endl;
    1.28 -  FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, g.S_CLASS) std::cout << v << " ";
    1.29 +  FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::S_CLASS) std::cout << v << " ";
    1.30    std::cout << std::endl;
    1.31  
    1.32    typedef stGraphWrapper<Graph> stGW;