marci@58: #ifndef BFS_ITERATOR_HH
marci@58: #define BFS_ITERATOR_HH
marci@42: 
marci@42: #include <queue>
marci@42: #include <stack>
marci@75: #include <utility>
marci@75: #include <graph_wrapper.h>
marci@42: 
alpar@105: namespace hugo {
marci@42: 
marci@42:   template <typename Graph>
marci@42:   struct bfs {
marci@42:     typedef typename Graph::NodeIt NodeIt;
marci@42:     typedef typename Graph::EdgeIt EdgeIt;
marci@42:     typedef typename Graph::EachNodeIt EachNodeIt;
marci@42:     typedef typename Graph::OutEdgeIt OutEdgeIt;
marci@42:     Graph& G;
marci@42:     NodeIt s;
marci@42:     typename Graph::NodeMap<bool> reached;
marci@42:     typename Graph::NodeMap<EdgeIt> pred;
marci@42:     typename Graph::NodeMap<int> dist;
marci@42:     std::queue<NodeIt> bfs_queue;
marci@42:     bfs(Graph& _G, NodeIt _s) : G(_G), s(_s), reached(_G), pred(_G), dist(_G) { 
marci@42:       bfs_queue.push(s); 
marci@42:       for(EachNodeIt i=G.template first<EachNodeIt>(); i.valid(); ++i) 
marci@42: 	reached.set(i, false);
marci@42:       reached.set(s, true);
marci@42:       dist.set(s, 0); 
marci@42:     }
marci@42:     
marci@42:     void run() {
marci@42:       while (!bfs_queue.empty()) {
marci@42: 	NodeIt v=bfs_queue.front();
marci@42: 	OutEdgeIt e=G.template first<OutEdgeIt>(v);
marci@42: 	bfs_queue.pop();
marci@42: 	for( ; e.valid(); ++e) {
marci@42: 	  NodeIt w=G.bNode(e);
marci@42: 	  std::cout << "scan node " << G.id(w) << " from node " << G.id(v) << std::endl;
marci@42: 	  if (!reached.get(w)) {
marci@42: 	    std::cout << G.id(w) << " is newly reached :-)" << std::endl;
marci@42: 	    bfs_queue.push(w);
marci@42: 	    dist.set(w, dist.get(v)+1);
marci@42: 	    pred.set(w, e);
marci@42: 	    reached.set(w, true);
marci@42: 	  } else {
marci@42: 	    std::cout << G.id(w) << " is already reached" << std::endl;
marci@42: 	  }
marci@42: 	}
marci@42:       }
marci@42:     }
marci@42:   };
marci@42: 
marci@42:   template <typename Graph> 
marci@42:   struct bfs_visitor {
marci@42:     typedef typename Graph::NodeIt NodeIt;
marci@42:     typedef typename Graph::EdgeIt EdgeIt;
marci@42:     typedef typename Graph::OutEdgeIt OutEdgeIt;
marci@42:     Graph& G;
marci@42:     bfs_visitor(Graph& _G) : G(_G) { }
marci@42:     void at_previously_reached(OutEdgeIt& e) { 
marci@42:       //NodeIt v=G.aNode(e);
marci@42:       NodeIt w=G.bNode(e);
marci@42:       std::cout << G.id(w) << " is already reached" << std::endl;
marci@42:    }
marci@42:     void at_newly_reached(OutEdgeIt& e) { 
marci@42:       //NodeIt v=G.aNode(e);
marci@42:       NodeIt w=G.bNode(e);
marci@42:       std::cout << G.id(w) << " is newly reached :-)" << std::endl;
marci@42:     }
marci@42:   };
marci@42: 
marci@42:   template <typename Graph, typename ReachedMap, typename visitor_type>
marci@42:   struct bfs_iterator {
marci@42:     typedef typename Graph::NodeIt NodeIt;
marci@42:     typedef typename Graph::EdgeIt EdgeIt;
marci@42:     typedef typename Graph::OutEdgeIt OutEdgeIt;
marci@42:     Graph& G;
marci@42:     std::queue<OutEdgeIt>& bfs_queue;
marci@42:     ReachedMap& reached;
marci@42:     visitor_type& visitor;
marci@42:     void process() {
marci@42:       while ( !bfs_queue.empty() && !bfs_queue.front().valid() ) { bfs_queue.pop(); } 
marci@42:       if (bfs_queue.empty()) return;
marci@42:       OutEdgeIt e=bfs_queue.front();
marci@42:       //NodeIt v=G.aNode(e);
marci@42:       NodeIt w=G.bNode(e);
marci@42:       if (!reached.get(w)) {
marci@42: 	visitor.at_newly_reached(e);
marci@42: 	bfs_queue.push(G.template first<OutEdgeIt>(w));
marci@42: 	reached.set(w, true);
marci@42:       } else {
marci@42: 	visitor.at_previously_reached(e);
marci@42:       }
marci@42:     }
marci@42:     bfs_iterator(Graph& _G, std::queue<OutEdgeIt>& _bfs_queue, ReachedMap& _reached, visitor_type& _visitor) : G(_G), bfs_queue(_bfs_queue), reached(_reached), visitor(_visitor) { 
marci@42:       //while ( !bfs_queue.empty() && !bfs_queue.front().valid() ) { bfs_queue.pop(); } 
marci@42:       valid();
marci@42:     }
marci@42:     bfs_iterator<Graph, ReachedMap, visitor_type>& operator++() { 
marci@42:       //while ( !bfs_queue.empty() && !bfs_queue.front().valid() ) { bfs_queue.pop(); } 
marci@42:       //if (bfs_queue.empty()) return *this;
marci@42:       if (!valid()) return *this;
marci@42:       ++(bfs_queue.front());
marci@42:       //while ( !bfs_queue.empty() && !bfs_queue.front().valid() ) { bfs_queue.pop(); } 
marci@42:       valid();
marci@42:       return *this;
marci@42:     }
marci@42:     //void next() { 
marci@42:     //  while ( !bfs_queue.empty() && !bfs_queue.front().valid() ) { bfs_queue.pop(); } 
marci@42:     //  if (bfs_queue.empty()) return;
marci@42:     //  ++(bfs_queue.front());
marci@42:     //  while ( !bfs_queue.empty() && !bfs_queue.front().valid() ) { bfs_queue.pop(); } 
marci@42:     //}
marci@42:     bool valid() { 
marci@42:       while ( !bfs_queue.empty() && !bfs_queue.front().valid() ) { bfs_queue.pop(); } 
marci@42:       if (bfs_queue.empty()) return false; else return true;
marci@42:     }
marci@42:     //bool finished() { 
marci@42:     //  while ( !bfs_queue.empty() && !bfs_queue.front().valid() ) { bfs_queue.pop(); } 
marci@42:     //  if (bfs_queue.empty()) return true; else return false;
marci@42:     //}
marci@42:     operator EdgeIt () { return bfs_queue.front(); }
marci@42: 
marci@42:   };
marci@42: 
marci@42:   template <typename Graph, typename ReachedMap>
marci@42:   struct bfs_iterator1 {
marci@42:     typedef typename Graph::NodeIt NodeIt;
marci@42:     typedef typename Graph::EdgeIt EdgeIt;
marci@42:     typedef typename Graph::OutEdgeIt OutEdgeIt;
marci@42:     Graph& G;
marci@42:     std::queue<OutEdgeIt>& bfs_queue;
marci@42:     ReachedMap& reached;
marci@42:     bool _newly_reached;
marci@42:     bfs_iterator1(Graph& _G, std::queue<OutEdgeIt>& _bfs_queue, ReachedMap& _reached) : G(_G), bfs_queue(_bfs_queue), reached(_reached) { 
marci@42:       valid();
marci@42:       if (!bfs_queue.empty() && bfs_queue.front().valid()) { 
marci@42: 	OutEdgeIt e=bfs_queue.front();
marci@42: 	NodeIt w=G.bNode(e);
marci@42: 	if (!reached.get(w)) {
marci@42: 	  bfs_queue.push(G.template first<OutEdgeIt>(w));
marci@42: 	  reached.set(w, true);
marci@42: 	  _newly_reached=true;
marci@42: 	} else {
marci@42: 	  _newly_reached=false;
marci@42: 	}
marci@42:       }
marci@42:     }
marci@42:     bfs_iterator1<Graph, ReachedMap>& operator++() { 
marci@42:       if (!valid()) return *this;
marci@42:       ++(bfs_queue.front());
marci@42:       valid();
marci@42:       if (!bfs_queue.empty() && bfs_queue.front().valid()) { 
marci@42: 	OutEdgeIt e=bfs_queue.front();
marci@42: 	NodeIt w=G.bNode(e);
marci@42: 	if (!reached.get(w)) {
marci@42: 	  bfs_queue.push(G.template first<OutEdgeIt>(w));
marci@42: 	  reached.set(w, true);
marci@42: 	  _newly_reached=true;
marci@42: 	} else {
marci@42: 	  _newly_reached=false;
marci@42: 	}
marci@42:       }
marci@42:       return *this;
marci@42:     }
marci@42:     bool valid() { 
marci@42:       while ( !bfs_queue.empty() && !bfs_queue.front().valid() ) { bfs_queue.pop(); } 
marci@42:       if (bfs_queue.empty()) return false; else return true;
marci@42:     }
marci@42:     operator OutEdgeIt() { return bfs_queue.front(); }
marci@42:     //ize
marci@42:     bool newly_reached() { return _newly_reached; }
marci@42: 
marci@42:   };
marci@42: 
marci@42:   template <typename Graph, typename OutEdgeIt, typename ReachedMap>
marci@42:   struct BfsIterator {
marci@42:     typedef typename Graph::NodeIt NodeIt;
marci@42:     Graph& G;
marci@42:     std::queue<OutEdgeIt>& bfs_queue;
marci@42:     ReachedMap& reached;
marci@42:     bool b_node_newly_reached;
marci@42:     OutEdgeIt actual_edge;
marci@42:     BfsIterator(Graph& _G, 
marci@42: 		std::queue<OutEdgeIt>& _bfs_queue, 
marci@42: 		ReachedMap& _reached) : 
marci@42:       G(_G), bfs_queue(_bfs_queue), reached(_reached) { 
marci@42:       actual_edge=bfs_queue.front();
marci@42:       if (actual_edge.valid()) { 
marci@42: 	NodeIt w=G.bNode(actual_edge);
marci@42: 	if (!reached.get(w)) {
marci@42: 	  bfs_queue.push(G.firstOutEdge(w));
marci@42: 	  reached.set(w, true);
marci@42: 	  b_node_newly_reached=true;
marci@42: 	} else {
marci@42: 	  b_node_newly_reached=false;
marci@42: 	}
marci@42:       }
marci@42:     }
marci@42:     BfsIterator<Graph, OutEdgeIt, ReachedMap>& 
marci@42:     operator++() { 
marci@42:       if (bfs_queue.front().valid()) { 
marci@42: 	++(bfs_queue.front());
marci@42: 	actual_edge=bfs_queue.front();
marci@42: 	if (actual_edge.valid()) {
marci@42: 	  NodeIt w=G.bNode(actual_edge);
marci@42: 	  if (!reached.get(w)) {
marci@42: 	    bfs_queue.push(G.firstOutEdge(w));
marci@42: 	    reached.set(w, true);
marci@42: 	    b_node_newly_reached=true;
marci@42: 	  } else {
marci@42: 	    b_node_newly_reached=false;
marci@42: 	  }
marci@42: 	}
marci@42:       } else {
marci@42: 	bfs_queue.pop(); 
marci@42: 	actual_edge=bfs_queue.front();
marci@42: 	if (actual_edge.valid()) {
marci@42: 	  NodeIt w=G.bNode(actual_edge);
marci@42: 	  if (!reached.get(w)) {
marci@42: 	    bfs_queue.push(G.firstOutEdge(w));
marci@42: 	    reached.set(w, true);
marci@42: 	    b_node_newly_reached=true;
marci@42: 	  } else {
marci@42: 	    b_node_newly_reached=false;
marci@42: 	  }
marci@42: 	}
marci@42:       }
marci@42:       return *this;
marci@42:     }
marci@42:     bool finished() { return bfs_queue.empty(); }
marci@42:     operator OutEdgeIt () { return actual_edge; }
marci@42:     bool bNodeIsNewlyReached() { return b_node_newly_reached; }
marci@42:     bool aNodeIsExamined() { return !(actual_edge.valid()); }
marci@42:   };
marci@42: 
marci@42: 
marci@42:   template <typename Graph, typename OutEdgeIt, typename ReachedMap>
marci@42:   struct DfsIterator {
marci@42:     typedef typename Graph::NodeIt NodeIt;
marci@42:     Graph& G;
marci@42:     std::stack<OutEdgeIt>& bfs_queue;
marci@42:     ReachedMap& reached;
marci@42:     bool b_node_newly_reached;
marci@42:     OutEdgeIt actual_edge;
marci@42:     DfsIterator(Graph& _G, 
marci@42: 		std::stack<OutEdgeIt>& _bfs_queue, 
marci@42: 		ReachedMap& _reached) : 
marci@42:       G(_G), bfs_queue(_bfs_queue), reached(_reached) { 
marci@42:       actual_edge=bfs_queue.top();
marci@42:       if (actual_edge.valid()) { 
marci@42: 	NodeIt w=G.bNode(actual_edge);
marci@42: 	if (!reached.get(w)) {
marci@42: 	  bfs_queue.push(G.firstOutEdge(w));
marci@42: 	  reached.set(w, true);
marci@42: 	  b_node_newly_reached=true;
marci@42: 	} else {
marci@42: 	  ++(bfs_queue.top());
marci@42: 	  b_node_newly_reached=false;
marci@42: 	}
marci@42:       } else {
marci@42: 	bfs_queue.pop();
marci@42:       }
marci@42:     }
marci@42:     DfsIterator<Graph, OutEdgeIt, ReachedMap>& 
marci@42:     operator++() { 
marci@42:       actual_edge=bfs_queue.top();
marci@42:       if (actual_edge.valid()) { 
marci@42: 	NodeIt w=G.bNode(actual_edge);
marci@42: 	if (!reached.get(w)) {
marci@42: 	  bfs_queue.push(G.firstOutEdge(w));
marci@42: 	  reached.set(w, true);
marci@42: 	  b_node_newly_reached=true;
marci@42: 	} else {
marci@42: 	  ++(bfs_queue.top());
marci@42: 	  b_node_newly_reached=false;
marci@42: 	}
marci@42:       } else {
marci@42: 	bfs_queue.pop();
marci@42:       }
marci@42:       return *this;
marci@42:     }
marci@42:     bool finished() { return bfs_queue.empty(); }
marci@42:     operator OutEdgeIt () { return actual_edge; }
marci@42:     bool bNodeIsNewlyReached() { return b_node_newly_reached; }
marci@99:     bool aNodeIsExamined() { return !(actual_edge.valid()); }
marci@42:   };
marci@42: 
marci@42:   template <typename Graph, typename OutEdgeIt, typename ReachedMap>
marci@42:   struct BfsIterator1 {
marci@42:     typedef typename Graph::NodeIt NodeIt;
marci@42:     Graph& G;
marci@42:     std::queue<OutEdgeIt>& bfs_queue;
marci@42:     ReachedMap& reached;
marci@42:     bool b_node_newly_reached;
marci@42:     OutEdgeIt actual_edge;
marci@42:     BfsIterator1(Graph& _G, 
marci@42: 		std::queue<OutEdgeIt>& _bfs_queue, 
marci@42: 		ReachedMap& _reached) : 
marci@42:       G(_G), bfs_queue(_bfs_queue), reached(_reached) { 
marci@42:       actual_edge=bfs_queue.front();
marci@42:       if (actual_edge.valid()) { 
marci@42:       	NodeIt w=G.bNode(actual_edge);
marci@42: 	if (!reached.get(w)) {
marci@42: 	  bfs_queue.push(OutEdgeIt(G, w));
marci@42: 	  reached.set(w, true);
marci@42: 	  b_node_newly_reached=true;
marci@42: 	} else {
marci@42: 	  b_node_newly_reached=false;
marci@42: 	}
marci@42:       }
marci@42:     }
marci@42:     void next() { 
marci@42:       if (bfs_queue.front().valid()) { 
marci@42: 	++(bfs_queue.front());
marci@42: 	actual_edge=bfs_queue.front();
marci@42: 	if (actual_edge.valid()) {
marci@42: 	  NodeIt w=G.bNode(actual_edge);
marci@42: 	  if (!reached.get(w)) {
marci@42: 	    bfs_queue.push(OutEdgeIt(G, w));
marci@42: 	    reached.set(w, true);
marci@42: 	    b_node_newly_reached=true;
marci@42: 	  } else {
marci@42: 	    b_node_newly_reached=false;
marci@42: 	  }
marci@42: 	}
marci@42:       } else {
marci@42: 	bfs_queue.pop(); 
marci@42: 	actual_edge=bfs_queue.front();
marci@42: 	if (actual_edge.valid()) {
marci@42: 	  NodeIt w=G.bNode(actual_edge);
marci@42: 	  if (!reached.get(w)) {
marci@42: 	    bfs_queue.push(OutEdgeIt(G, w));
marci@42: 	    reached.set(w, true);
marci@42: 	    b_node_newly_reached=true;
marci@42: 	  } else {
marci@42: 	    b_node_newly_reached=false;
marci@42: 	  }
marci@42: 	}
marci@42:       }
marci@42:       //return *this;
marci@42:     }
marci@42:     bool finished() { return bfs_queue.empty(); }
marci@42:     operator OutEdgeIt () { return actual_edge; }
marci@42:     bool bNodeIsNewlyReached() { return b_node_newly_reached; }
marci@42:     bool aNodeIsExamined() { return !(actual_edge.valid()); }
marci@42:   };
marci@42: 
marci@42: 
marci@42:   template <typename Graph, typename OutEdgeIt, typename ReachedMap>
marci@42:   struct DfsIterator1 {
marci@42:     typedef typename Graph::NodeIt NodeIt;
marci@42:     Graph& G;
marci@42:     std::stack<OutEdgeIt>& bfs_queue;
marci@42:     ReachedMap& reached;
marci@42:     bool b_node_newly_reached;
marci@42:     OutEdgeIt actual_edge;
marci@42:     DfsIterator1(Graph& _G, 
marci@42: 		std::stack<OutEdgeIt>& _bfs_queue, 
marci@42: 		ReachedMap& _reached) : 
marci@42:       G(_G), bfs_queue(_bfs_queue), reached(_reached) { 
marci@42:       //actual_edge=bfs_queue.top();
marci@42:       //if (actual_edge.valid()) { 
marci@42:       //	NodeIt w=G.bNode(actual_edge);
marci@42:       //if (!reached.get(w)) {
marci@42:       //  bfs_queue.push(OutEdgeIt(G, w));
marci@42:       //  reached.set(w, true);
marci@42:       //  b_node_newly_reached=true;
marci@42:       //} else {
marci@42:       //  ++(bfs_queue.top());
marci@42:       //  b_node_newly_reached=false;
marci@42:       //}
marci@42:       //} else {
marci@42:       //	bfs_queue.pop();
marci@42:       //}
marci@42:     }
marci@42:     void next() { 
marci@42:       actual_edge=bfs_queue.top();
marci@42:       if (actual_edge.valid()) { 
marci@42: 	NodeIt w=G.bNode(actual_edge);
marci@42: 	if (!reached.get(w)) {
marci@42: 	  bfs_queue.push(OutEdgeIt(G, w));
marci@42: 	  reached.set(w, true);
marci@42: 	  b_node_newly_reached=true;
marci@42: 	} else {
marci@42: 	  ++(bfs_queue.top());
marci@42: 	  b_node_newly_reached=false;
marci@42: 	}
marci@42:       } else {
marci@42: 	bfs_queue.pop();
marci@42:       }
marci@42:       //return *this;
marci@42:     }
marci@42:     bool finished() { return bfs_queue.empty(); }
marci@42:     operator OutEdgeIt () { return actual_edge; }
marci@42:     bool bNodeIsNewlyReached() { return b_node_newly_reached; }
marci@42:     bool aNodeIsLeaved() { return !(actual_edge.valid()); }
marci@42:   };
marci@42: 
marci@58:   template <typename Graph, typename OutEdgeIt, typename ReachedMap>
marci@58:   class BfsIterator2 {
marci@58:     typedef typename Graph::NodeIt NodeIt;
marci@58:     const Graph& G;
marci@58:     std::queue<OutEdgeIt> bfs_queue;
marci@58:     ReachedMap reached;
marci@58:     bool b_node_newly_reached;
marci@58:     OutEdgeIt actual_edge;
marci@58:   public:
marci@58:     BfsIterator2(const Graph& _G) : G(_G), reached(G, false) { }
marci@64:     void pushAndSetReached(NodeIt s) { 
marci@58:       reached.set(s, true);
marci@58:       if (bfs_queue.empty()) {
marci@58: 	bfs_queue.push(G.template first<OutEdgeIt>(s));
marci@58: 	actual_edge=bfs_queue.front();
marci@58: 	if (actual_edge.valid()) { 
marci@58: 	  NodeIt w=G.bNode(actual_edge);
marci@58: 	  if (!reached.get(w)) {
marci@58: 	    bfs_queue.push(G.template first<OutEdgeIt>(w));
marci@58: 	    reached.set(w, true);
marci@58: 	    b_node_newly_reached=true;
marci@58: 	  } else {
marci@58: 	    b_node_newly_reached=false;
marci@58: 	  }
marci@58: 	} //else {
marci@58: 	//}
marci@58:       } else {
marci@58: 	bfs_queue.push(G.template first<OutEdgeIt>(s));
marci@58:       }
marci@58:     }
marci@58:     BfsIterator2<Graph, OutEdgeIt, ReachedMap>& 
marci@58:     operator++() { 
marci@58:       if (bfs_queue.front().valid()) { 
marci@58: 	++(bfs_queue.front());
marci@58: 	actual_edge=bfs_queue.front();
marci@58: 	if (actual_edge.valid()) {
marci@58: 	  NodeIt w=G.bNode(actual_edge);
marci@58: 	  if (!reached.get(w)) {
marci@58: 	    bfs_queue.push(G.template first<OutEdgeIt>(w));
marci@58: 	    reached.set(w, true);
marci@58: 	    b_node_newly_reached=true;
marci@58: 	  } else {
marci@58: 	    b_node_newly_reached=false;
marci@58: 	  }
marci@58: 	}
marci@58:       } else {
marci@58: 	bfs_queue.pop(); 
marci@58: 	if (!bfs_queue.empty()) {
marci@58: 	  actual_edge=bfs_queue.front();
marci@64: 	  if (actual_edge.valid()) {
marci@64: 	    NodeIt w=G.bNode(actual_edge);
marci@64: 	    if (!reached.get(w)) {
marci@64: 	      bfs_queue.push(G.template first<OutEdgeIt>(w));
marci@64: 	      reached.set(w, true);
marci@64: 	      b_node_newly_reached=true;
marci@64: 	    } else {
marci@64: 	      b_node_newly_reached=false;
marci@64: 	    }
marci@58: 	  }
marci@58: 	}
marci@58:       }
marci@58:       return *this;
marci@58:     }
marci@58:     bool finished() const { return bfs_queue.empty(); }
marci@58:     operator OutEdgeIt () const { return actual_edge; }
marci@58:     bool isBNodeNewlyReached() const { return b_node_newly_reached; }
marci@58:     bool isANodeExamined() const { return !(actual_edge.valid()); }
marci@58:     const ReachedMap& getReachedMap() const { return reached; }
marci@58:     const std::queue<OutEdgeIt>& getBfsQueue() const { return bfs_queue; }
marci@58:  };
marci@58: 
marci@75: 
marci@75:   template <typename Graph, typename OutEdgeIt, typename ReachedMap>
marci@75:   class BfsIterator3 {
marci@75:     typedef typename Graph::NodeIt NodeIt;
marci@75:     const Graph& G;
marci@75:     std::queue< std::pair<NodeIt, OutEdgeIt> > bfs_queue;
marci@75:     ReachedMap reached;
marci@75:     bool b_node_newly_reached;
marci@75:     OutEdgeIt actual_edge;
marci@75:   public:
marci@75:     BfsIterator3(const Graph& _G) : G(_G), reached(G, false) { }
marci@75:     void pushAndSetReached(NodeIt s) { 
marci@75:       reached.set(s, true);
marci@75:       if (bfs_queue.empty()) {
marci@75: 	bfs_queue.push(std::pair<NodeIt, OutEdgeIt>(s, G.template first<OutEdgeIt>(s)));
marci@75: 	actual_edge=bfs_queue.front().second;
marci@75: 	if (actual_edge.valid()) { 
marci@75: 	  NodeIt w=G.bNode(actual_edge);
marci@75: 	  if (!reached.get(w)) {
marci@75: 	    bfs_queue.push(std::pair<NodeIt, OutEdgeIt>(w, G.template first<OutEdgeIt>(w)));
marci@75: 	    reached.set(w, true);
marci@75: 	    b_node_newly_reached=true;
marci@75: 	  } else {
marci@75: 	    b_node_newly_reached=false;
marci@75: 	  }
marci@75: 	} //else {
marci@75: 	//}
marci@75:       } else {
marci@75: 	bfs_queue.push(std::pair<NodeIt, OutEdgeIt>(s, G.template first<OutEdgeIt>(s)));
marci@75:       }
marci@75:     }
marci@75:     BfsIterator3<Graph, OutEdgeIt, ReachedMap>& 
marci@75:     operator++() { 
marci@75:       if (bfs_queue.front().second.valid()) { 
marci@75: 	++(bfs_queue.front().second);
marci@75: 	actual_edge=bfs_queue.front().second;
marci@75: 	if (actual_edge.valid()) {
marci@75: 	  NodeIt w=G.bNode(actual_edge);
marci@75: 	  if (!reached.get(w)) {
marci@75: 	    bfs_queue.push(std::pair<NodeIt, OutEdgeIt>(w, G.template first<OutEdgeIt>(w)));
marci@75: 	    reached.set(w, true);
marci@75: 	    b_node_newly_reached=true;
marci@75: 	  } else {
marci@75: 	    b_node_newly_reached=false;
marci@75: 	  }
marci@75: 	}
marci@75:       } else {
marci@75: 	bfs_queue.pop(); 
marci@75: 	if (!bfs_queue.empty()) {
marci@75: 	  actual_edge=bfs_queue.front().second;
marci@75: 	  if (actual_edge.valid()) {
marci@75: 	    NodeIt w=G.bNode(actual_edge);
marci@75: 	    if (!reached.get(w)) {
marci@75: 	      bfs_queue.push(std::pair<NodeIt, OutEdgeIt>(w, G.template first<OutEdgeIt>(w)));
marci@75: 	      reached.set(w, true);
marci@75: 	      b_node_newly_reached=true;
marci@75: 	    } else {
marci@75: 	      b_node_newly_reached=false;
marci@75: 	    }
marci@75: 	  }
marci@75: 	}
marci@75:       }
marci@75:       return *this;
marci@75:     }
marci@75:     bool finished() const { return bfs_queue.empty(); }
marci@75:     operator OutEdgeIt () const { return actual_edge; }
marci@75:     bool isBNodeNewlyReached() const { return b_node_newly_reached; }
marci@75:     bool isANodeExamined() const { return !(actual_edge.valid()); }
marci@75:     NodeIt aNode() const { return bfs_queue.front().first; }
marci@75:     NodeIt bNode() const { return G.bNode(actual_edge); }
marci@75:     const ReachedMap& getReachedMap() const { return reached; }
marci@75:     //const std::queue< std::pair<NodeIt, OutEdgeIt> >& getBfsQueue() const { return bfs_queue; }
marci@75:  };
marci@75: 
marci@144: 
marci@144:   template <typename Graph, typename OutEdgeIt, 
marci@144: 	    typename ReachedMap=typename Graph::NodeMap<bool> >
marci@75:   class BfsIterator4 {
marci@75:     typedef typename Graph::NodeIt NodeIt;
marci@75:     const Graph& G;
marci@75:     std::queue<NodeIt> bfs_queue;
marci@144:     ReachedMap& reached;
marci@75:     bool b_node_newly_reached;
marci@75:     OutEdgeIt actual_edge;
marci@144:     bool own_reached_map;
marci@75:   public:
marci@144:     BfsIterator4(const Graph& _G, ReachedMap& _reached) : 
marci@144:       G(_G), reached(_reached), 
marci@144:       own_reached_map(false) { }
marci@144:     BfsIterator4(const Graph& _G) : 
marci@144:       G(_G), reached(*(new ReachedMap(G /*, false*/))), 
marci@144:       own_reached_map(true) { }
marci@144:     ~BfsIterator4() { if (own_reached_map) delete &reached; }
marci@75:     void pushAndSetReached(NodeIt s) { 
marci@75:       reached.set(s, true);
marci@75:       if (bfs_queue.empty()) {
marci@75: 	bfs_queue.push(s);
marci@75: 	G.getFirst(actual_edge, s);
marci@75: 	if (actual_edge.valid()) { 
marci@75: 	  NodeIt w=G.bNode(actual_edge);
marci@75: 	  if (!reached.get(w)) {
marci@75: 	    bfs_queue.push(w);
marci@75: 	    reached.set(w, true);
marci@75: 	    b_node_newly_reached=true;
marci@75: 	  } else {
marci@75: 	    b_node_newly_reached=false;
marci@75: 	  }
marci@75: 	} 
marci@75:       } else {
marci@75: 	bfs_queue.push(s);
marci@75:       }
marci@75:     }
marci@75:     BfsIterator4<Graph, OutEdgeIt, ReachedMap>& 
marci@75:     operator++() { 
marci@75:       if (actual_edge.valid()) { 
marci@75: 	++actual_edge;
marci@75: 	if (actual_edge.valid()) {
marci@75: 	  NodeIt w=G.bNode(actual_edge);
marci@75: 	  if (!reached.get(w)) {
marci@75: 	    bfs_queue.push(w);
marci@75: 	    reached.set(w, true);
marci@75: 	    b_node_newly_reached=true;
marci@75: 	  } else {
marci@75: 	    b_node_newly_reached=false;
marci@75: 	  }
marci@75: 	}
marci@75:       } else {
marci@75: 	bfs_queue.pop(); 
marci@75: 	if (!bfs_queue.empty()) {
marci@75: 	  G.getFirst(actual_edge, bfs_queue.front());
marci@75: 	  if (actual_edge.valid()) {
marci@75: 	    NodeIt w=G.bNode(actual_edge);
marci@75: 	    if (!reached.get(w)) {
marci@75: 	      bfs_queue.push(w);
marci@75: 	      reached.set(w, true);
marci@75: 	      b_node_newly_reached=true;
marci@75: 	    } else {
marci@75: 	      b_node_newly_reached=false;
marci@75: 	    }
marci@75: 	  }
marci@75: 	}
marci@75:       }
marci@75:       return *this;
marci@75:     }
marci@75:     bool finished() const { return bfs_queue.empty(); }
marci@75:     operator OutEdgeIt () const { return actual_edge; }
marci@75:     bool isBNodeNewlyReached() const { return b_node_newly_reached; }
marci@75:     bool isANodeExamined() const { return !(actual_edge.valid()); }
marci@75:     NodeIt aNode() const { return bfs_queue.front(); }
marci@75:     NodeIt bNode() const { return G.bNode(actual_edge); }
marci@75:     const ReachedMap& getReachedMap() const { return reached; }
marci@75:     const std::queue<NodeIt>& getBfsQueue() const { return bfs_queue; }
marci@144:  };  
marci@75: 
marci@144:   template <typename Graph, typename OutEdgeIt, 
marci@144: 	    typename ReachedMap=typename Graph::NodeMap<bool> >
marci@144:   class DfsIterator4 {
marci@99:     typedef typename Graph::NodeIt NodeIt;
marci@99:     const Graph& G;
marci@99:     std::stack<OutEdgeIt> dfs_stack;
marci@99:     bool b_node_newly_reached;
marci@99:     OutEdgeIt actual_edge;
marci@99:     NodeIt actual_node;
marci@144:     ReachedMap& reached;
marci@144:     bool own_reached_map;
marci@144:   public:
marci@144:     DfsIterator4(const Graph& _G, ReachedMap& _reached) : 
marci@144:       G(_G), reached(_reached), 
marci@144:       own_reached_map(false) { }
marci@144:     DfsIterator4(const Graph& _G) : 
marci@144:       G(_G), reached(*(new ReachedMap(G /*, false*/))), 
marci@144:       own_reached_map(true) { }
marci@144:     ~DfsIterator4() { if (own_reached_map) delete &reached; }
marci@99:     void pushAndSetReached(NodeIt s) { 
marci@133:       actual_node=s;
marci@99:       reached.set(s, true);
marci@99:       dfs_stack.push(G.template first<OutEdgeIt>(s)); 
marci@99:     }
marci@99:     DfsIterator4<Graph, OutEdgeIt, ReachedMap>& 
marci@99:     operator++() { 
marci@99:       actual_edge=dfs_stack.top();
marci@99:       //actual_node=G.aNode(actual_edge);
marci@99:       if (actual_edge.valid()) { 
marci@99: 	NodeIt w=G.bNode(actual_edge);
marci@99: 	actual_node=w;
marci@99: 	if (!reached.get(w)) {
marci@99: 	  dfs_stack.push(G.template first<OutEdgeIt>(w));
marci@99: 	  reached.set(w, true);
marci@99: 	  b_node_newly_reached=true;
marci@99: 	} else {
marci@133: 	  actual_node=G.aNode(actual_edge);
marci@99: 	  ++(dfs_stack.top());
marci@99: 	  b_node_newly_reached=false;
marci@99: 	}
marci@99:       } else {
marci@99: 	//actual_node=G.aNode(dfs_stack.top());
marci@99: 	dfs_stack.pop();
marci@99:       }
marci@99:       return *this;
marci@99:     }
marci@99:     bool finished() const { return dfs_stack.empty(); }
marci@99:     operator OutEdgeIt () const { return actual_edge; }
marci@99:     bool isBNodeNewlyReached() const { return b_node_newly_reached; }
marci@99:     bool isANodeExamined() const { return !(actual_edge.valid()); }
marci@133:     NodeIt aNode() const { return actual_node; /*FIXME*/}
marci@99:     NodeIt bNode() const { return G.bNode(actual_edge); }
marci@99:     const ReachedMap& getReachedMap() const { return reached; }
marci@99:     const std::stack<OutEdgeIt>& getDfsStack() const { return dfs_stack; }
marci@99:   };
marci@99: 
marci@99: 
marci@99: 
marci@75:   template <typename GraphWrapper, typename ReachedMap>
marci@75:   class BfsIterator5 {
marci@75:     typedef typename GraphWrapper::NodeIt NodeIt;
marci@75:     typedef typename GraphWrapper::OutEdgeIt OutEdgeIt;
marci@75:     GraphWrapper gw;
marci@75:     std::queue<NodeIt> bfs_queue;
marci@75:     ReachedMap reached;
marci@75:     bool b_node_newly_reached;
marci@75:     OutEdgeIt actual_edge;
marci@75:   public:
marci@75:     BfsIterator5(GraphWrapper _gw) : 
marci@75:       gw(_gw), reached(_gw.getGraph()) { }
marci@75:     void pushAndSetReached(NodeIt s) { 
marci@75:       reached.set(s, true);
marci@75:       if (bfs_queue.empty()) {
marci@75: 	bfs_queue.push(s);
marci@75: 	gw.getFirst(actual_edge, s);
marci@75: 	if (actual_edge.valid()) { 
marci@75: 	  NodeIt w=gw.bNode(actual_edge);
marci@75: 	  if (!reached.get(w)) {
marci@75: 	    bfs_queue.push(w);
marci@75: 	    reached.set(w, true);
marci@75: 	    b_node_newly_reached=true;
marci@75: 	  } else {
marci@75: 	    b_node_newly_reached=false;
marci@75: 	  }
marci@75: 	} 
marci@75:       } else {
marci@75: 	bfs_queue.push(s);
marci@75:       }
marci@75:     }
marci@75:     BfsIterator5<GraphWrapper, ReachedMap>& 
marci@75:     operator++() { 
marci@75:       if (actual_edge.valid()) { 
marci@75: 	++actual_edge;
marci@75: 	if (actual_edge.valid()) {
marci@75: 	  NodeIt w=gw.bNode(actual_edge);
marci@75: 	  if (!reached.get(w)) {
marci@75: 	    bfs_queue.push(w);
marci@75: 	    reached.set(w, true);
marci@75: 	    b_node_newly_reached=true;
marci@75: 	  } else {
marci@75: 	    b_node_newly_reached=false;
marci@75: 	  }
marci@75: 	}
marci@75:       } else {
marci@75: 	bfs_queue.pop(); 
marci@75: 	if (!bfs_queue.empty()) {
marci@75: 	  gw.getFirst(actual_edge, bfs_queue.front());
marci@75: 	  if (actual_edge.valid()) {
marci@75: 	    NodeIt w=gw.bNode(actual_edge);
marci@75: 	    if (!reached.get(w)) {
marci@75: 	      bfs_queue.push(w);
marci@75: 	      reached.set(w, true);
marci@75: 	      b_node_newly_reached=true;
marci@75: 	    } else {
marci@75: 	      b_node_newly_reached=false;
marci@75: 	    }
marci@75: 	  }
marci@75: 	}
marci@75:       }
marci@75:       return *this;
marci@75:     }
marci@75:     bool finished() const { return bfs_queue.empty(); }
marci@75:     operator OutEdgeIt () const { return actual_edge; }
marci@75:     bool isBNodeNewlyReached() const { return b_node_newly_reached; }
marci@75:     bool isANodeExamined() const { return !(actual_edge.valid()); }
marci@75:     NodeIt aNode() const { return bfs_queue.front(); }
marci@75:     NodeIt bNode() const { return gw.bNode(actual_edge); }
marci@75:     const ReachedMap& getReachedMap() const { return reached; }
marci@75:     const std::queue<NodeIt>& getBfsQueue() const { return bfs_queue; }
marci@75:  };
marci@75: 
marci@75: 
marci@75: 
alpar@105: } // namespace hugo
marci@42: 
marci@58: #endif //BFS_ITERATOR_HH