1.1 --- a/demo/graph_orientation.cc	Fri Jan 27 08:17:25 2006 +0000
     1.2 +++ b/demo/graph_orientation.cc	Fri Jan 27 08:18:47 2006 +0000
     1.3 @@ -70,7 +70,7 @@
     1.4    ListGraph::NodeMap<int> def(g); //deficiency of the nodes
     1.5    def = subMap(f,InDegMap<ListGraph>(g));
     1.6    
     1.7 -  IterableBoolNodeMap<ListGraph> active(g,false);
     1.8 +  IterableBoolMap<ListGraph, Node> active(g,false);
     1.9    for(NodeIt n(g);n!=INVALID;++n) active[n]=(def[n]>0);
    1.10    
    1.11    ListGraph::EdgeMap<bool> rev(g,false); // rev[e]==true <=> e is be 
    1.12 @@ -79,7 +79,7 @@
    1.13    int nodeNum=countNodes(g);
    1.14    
    1.15    Node act;
    1.16 -  while((act=IterableBoolNodeMap<ListGraph>::TrueIt(active))!=INVALID) {
    1.17 +  while((act=IterableBoolMap<ListGraph, Node>::TrueIt(active))!=INVALID) {
    1.18      std::cout << "Process node " << label[act]
    1.19  	      << " (def=" << def[act]
    1.20  	      << " lev=" << level[act] << "): ";