marci@174: // -*- c++ -*-
marci@259: #ifndef HUGO_GRAPH_WRAPPER_H
marci@259: #define HUGO_GRAPH_WRAPPER_H
marci@76: 
marci@174: #include <invalid.h>
marci@174: 
alpar@105: namespace hugo {
marci@76: 
marci@312: //   template<typename Graph>
marci@312: //   class TrivGraphWrapper {
marci@312: //   protected:
marci@312: //     Graph* graph;
marci@76:   
marci@312: //   public:
marci@312: // //    typedef Graph BaseGraph;
marci@312: //     typedef Graph ParentGraph;
marci@303: 
marci@312: // //     TrivGraphWrapper() : graph(0) { }
marci@312: //     TrivGraphWrapper(Graph& _graph) : graph(&_graph) { }
marci@312: // //     void setGraph(Graph& _graph) { graph = &_graph; }
marci@312: // //     Graph& getGraph() const { return *graph; }
marci@76: 
marci@312: //     typedef typename Graph::Node Node;
marci@312: //     class NodeIt : public Graph::NodeIt { 
marci@312: //     public:
marci@312: //       NodeIt() { }
marci@312: //       NodeIt(const typename Graph::NodeIt& n) : Graph::NodeIt(n) { }
marci@312: //       NodeIt(const Invalid& i) : Graph::NodeIt(i) { }
marci@312: //       NodeIt(const TrivGraphWrapper<Graph>& _G) : 
marci@312: // 	Graph::NodeIt(*(_G.graph)) { }
marci@312: //     };
marci@312: //     typedef typename Graph::Edge Edge;
marci@312: //     class OutEdgeIt : public Graph::OutEdgeIt { 
marci@312: //     public:
marci@312: //       OutEdgeIt() { }
marci@312: //       OutEdgeIt(const typename Graph::OutEdgeIt& e) : Graph::OutEdgeIt(e) { }
marci@312: //       OutEdgeIt(const Invalid& i) : Graph::OutEdgeIt(i) { }
marci@312: //       OutEdgeIt(const TrivGraphWrapper<Graph>& _G, const Node& n) : 
marci@312: // 	Graph::OutEdgeIt(*(_G.graph), n) { }
marci@312: //     };
marci@312: //     class InEdgeIt : public Graph::InEdgeIt { 
marci@312: //     public:
marci@312: //       InEdgeIt() { }
marci@312: //       InEdgeIt(const typename Graph::InEdgeIt& e) : Graph::InEdgeIt(e) { }
marci@312: //       InEdgeIt(const Invalid& i) : Graph::InEdgeIt(i) { }
marci@312: //       InEdgeIt(const TrivGraphWrapper<Graph>& _G, const Node& n) : 
marci@312: // 	Graph::InEdgeIt(*(_G.graph), n) { }
marci@312: //     };
marci@312: //     //typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@312: //     class EdgeIt : public Graph::EdgeIt { 
marci@312: //     public:
marci@312: //       EdgeIt() { }
marci@312: //       EdgeIt(const typename Graph::EdgeIt& e) : Graph::EdgeIt(e) { }
marci@312: //       EdgeIt(const Invalid& i) : Graph::EdgeIt(i) { }
marci@312: //       EdgeIt(const TrivGraphWrapper<Graph>& _G) : 
marci@312: // 	Graph::EdgeIt(*(_G.graph)) { }
marci@312: //     };
marci@168: 
marci@312: //     NodeIt& first(NodeIt& i) const { 
marci@312: //       i=NodeIt(*this);
marci@265: //       return i;
marci@265: //     }
marci@312: //     OutEdgeIt& first(OutEdgeIt& i, const Node& p) const { 
marci@312: //       i=OutEdgeIt(*this, p);
marci@265: //       return i;
marci@265: //     }
marci@312: //     InEdgeIt& first(InEdgeIt& i, const Node& p) const { 
marci@312: //       i=InEdgeIt(*this, p);
marci@312: //       return i;
marci@312: //     }
marci@312: //     EdgeIt& first(EdgeIt& i) const { 
marci@312: //       i=EdgeIt(*this);
marci@312: //       return i;
marci@312: //     }
marci@312: // //     template<typename I> I& first(I& i) const { 
marci@312: // //       i=I(*this);
marci@312: // //       return i;
marci@312: // //     }
marci@312: // //     template<typename I, typename P> I& first(I& i, const P& p) const { 
marci@312: // //       i=I(*this, p);
marci@312: // //       return i;
marci@312: // //     }
marci@76:     
marci@312: // //    template<typename I> I getNext(const I& i) const { 
marci@312: // //      return graph->getNext(i); }
marci@76: 
marci@312: //     NodeIt& next(NodeIt& i) const { graph->next(i); return i; }
marci@312: //     OutEdgeIt& next(OutEdgeIt& i) const { graph->next(i); return i; }
marci@312: //     InEdgeIt& next(InEdgeIt& i) const { graph->next(i); return i; }
marci@312: //     EdgeIt& next(EdgeIt& i) const { graph->next(i); return i; }
marci@312: // //    template<typename I> I& next(I &i) const { graph->next(i); return i; }    
marci@312: //     template< typename It > It first() const { 
marci@312: //       It e; this->first(e); return e; }
marci@76: 
marci@312: //     template< typename It > It first(const Node& v) const { 
marci@312: //       It e; this->first(e, v); return e; }
marci@76: 
marci@312: //     Node head(const Edge& e) const { return graph->head(e); }
marci@312: //     Node tail(const Edge& e) const { return graph->tail(e); }
marci@155: 
marci@312: //     template<typename I> bool valid(const I& i) const { 
marci@312: //       return graph->valid(i); }
marci@155:   
marci@312: //     //template<typename I> void setInvalid(const I &i);
marci@312: //     //{ return graph->setInvalid(i); }
marci@155: 
marci@312: //     int nodeNum() const { return graph->nodeNum(); }
marci@312: //     int edgeNum() const { return graph->edgeNum(); }
marci@76:   
marci@312: //     template<typename I> Node aNode(const I& e) const { 
marci@312: //       return graph->aNode(e); }
marci@312: //     template<typename I> Node bNode(const I& e) const { 
marci@312: //       return graph->bNode(e); }
marci@76:   
marci@312: //     Node addNode() const { return graph->addNode(); }
marci@312: //     Edge addEdge(const Node& tail, const Node& head) const { 
marci@312: //       return graph->addEdge(tail, head); }
marci@76:   
marci@312: //     template<typename I> void erase(const I& i) const { graph->erase(i); }
marci@76:   
marci@312: //     void clear() const { graph->clear(); }
marci@155:     
marci@312: //     template<typename T> class NodeMap : public Graph::NodeMap<T> { 
marci@303: //     public:
marci@312: //       NodeMap(const TrivGraphWrapper<Graph>& _G) :  
marci@312: // 	Graph::NodeMap<T>(*(_G.graph)) { }
marci@312: //       NodeMap(const TrivGraphWrapper<Graph>& _G, T a) : 
marci@312: // 	Graph::NodeMap<T>(*(_G.graph), a) { }
marci@303: //     };
marci@266: 
marci@312: //     template<typename T> class EdgeMap : public Graph::EdgeMap<T> { 
marci@303: //     public:
marci@312: //       EdgeMap(const TrivGraphWrapper<Graph>& _G) :  
marci@312: // 	Graph::EdgeMap<T>(*(_G.graph)) { }
marci@312: //       EdgeMap(const TrivGraphWrapper<Graph>& _G, T a) : 
marci@312: // 	Graph::EdgeMap<T>(*(_G.graph), a) { }
marci@303: //     };
marci@312: 
marci@312: // //     template<typename Map, typename T> class NodeMapWrapper {
marci@312: // //     protected:
marci@312: // //       Map* map;
marci@312: // //     public:
marci@312: // //       NodeMapWrapper(Map& _map) : map(&_map) { }
marci@312: // //       void set(Node n, T a) { map->set(n, a); }
marci@312: // //       T get(Node n) const { return map->get(n); }
marci@312: // //     };
marci@312: 
marci@312: // //     template<typename Map, typename T> class EdgeMapWrapper {
marci@312: // //     protected:
marci@312: // //       Map* map;
marci@312: // //     public:
marci@312: // //       EdgeMapWrapper(Map& _map) : map(&_map) { }
marci@312: // //       void set(Edge n, T a) { map->set(n, a); }
marci@312: // //       T get(Edge n) const { return map->get(n); }
marci@312: // //     };
marci@312: //   };
marci@76: 
marci@303: 
marci@303:   template<typename Graph>
marci@303:   class GraphWrapper {
marci@212:   protected:
marci@303:     Graph* graph;
marci@212:   
marci@212:   public:
marci@311:     typedef Graph BaseGraph;
marci@303:     typedef Graph ParentGraph;
marci@212: 
marci@303: //     GraphWrapper() : graph(0) { }
marci@303:     GraphWrapper(Graph& _graph) : graph(&_graph) { }
marci@303: //     void setGraph(Graph& _graph) { graph=&_graph; }
marci@303: //     Graph& getGraph() const { return *graph; }
marci@303:  
marci@303:     typedef typename Graph::Node Node;
marci@303:     class NodeIt : public Graph::NodeIt { 
marci@312:       typedef typename Graph::NodeIt GraphNodeIt;
marci@265:     public:
marci@265:       NodeIt() { }
marci@303:       NodeIt(const typename Graph::NodeIt& n) : Graph::NodeIt(n) { }
marci@303:       NodeIt(const Invalid& i) : Graph::NodeIt(i) { }
marci@303:       NodeIt(const GraphWrapper<Graph>& _G) : 
marci@303: 	Graph::NodeIt(*(_G.graph)) { }
marci@312: //      operator Node() const { 
marci@312: //	std::cout << "ize" << std::endl; 
marci@312: //	return Node(this->GraphNodeIt); 
marci@312: //      }
marci@265:     };
marci@303:     typedef typename Graph::Edge Edge;
marci@303:     class OutEdgeIt : public Graph::OutEdgeIt { 
marci@312:       typedef typename Graph::OutEdgeIt GraphOutEdgeIt;
marci@265:     public:
marci@265:       OutEdgeIt() { }
marci@303:       OutEdgeIt(const typename Graph::OutEdgeIt& e) : Graph::OutEdgeIt(e) { }
marci@303:       OutEdgeIt(const Invalid& i) : Graph::OutEdgeIt(i) { }
marci@303:       OutEdgeIt(const GraphWrapper<Graph>& _G, const Node& n) : 
marci@303: 	Graph::OutEdgeIt(*(_G.graph), n) { }
marci@312: //      operator Edge() const { 
marci@312: //	std::cout << "ize" << std::endl; 
marci@312: //	return Edge(this->GraphOutEdgeIt); 
marci@312: //      }
marci@265:     };
marci@303:     class InEdgeIt : public Graph::InEdgeIt { 
marci@312:       typedef typename Graph::InEdgeIt GraphInEdgeIt;
marci@265:     public:
marci@265:       InEdgeIt() { }
marci@303:       InEdgeIt(const typename Graph::InEdgeIt& e) : Graph::InEdgeIt(e) { }
marci@303:       InEdgeIt(const Invalid& i) : Graph::InEdgeIt(i) { }
marci@303:       InEdgeIt(const GraphWrapper<Graph>& _G, const Node& n) : 
marci@303: 	Graph::InEdgeIt(*(_G.graph), n) { }
marci@312: //      operator Edge() const { 
marci@312: //	std::cout << "ize" << std::endl; 
marci@312: //	return Edge(this->InOutEdgeIt); 
marci@312: //      }
marci@265:     };
marci@303:     //typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@303:     class EdgeIt : public Graph::EdgeIt { 
marci@312:       typedef typename Graph::EdgeIt GraphEdgeIt;
marci@265:     public:
marci@265:       EdgeIt() { }
marci@303:       EdgeIt(const typename Graph::EdgeIt& e) : Graph::EdgeIt(e) { }
marci@303:       EdgeIt(const Invalid& i) : Graph::EdgeIt(i) { }
marci@303:       EdgeIt(const GraphWrapper<Graph>& _G) : 
marci@303: 	Graph::EdgeIt(*(_G.graph)) { }
marci@312: //      operator Edge() const { 
marci@312: //	std::cout << "ize" << std::endl; 
marci@312: //	return Edge(this->GraphEdgeIt); 
marci@312: //      }
marci@265:     };
marci@303:    
marci@303:     NodeIt& first(NodeIt& i) const { 
marci@303:       i=NodeIt(*this);
marci@265:       return i;
marci@265:     }
marci@303:     OutEdgeIt& first(OutEdgeIt& i, const Node& p) const { 
marci@303:       i=OutEdgeIt(*this, p);
marci@303:       return i;
marci@303:     }
marci@303:     InEdgeIt& first(InEdgeIt& i, const Node& p) const { 
marci@303:       i=InEdgeIt(*this, p);
marci@303:       return i;
marci@303:     }
marci@311:     EdgeIt& first(EdgeIt& i) const { 
marci@311:       i=EdgeIt(*this);
marci@311:       return i;
marci@311:     }
marci@312: //     template<typename I> I& first(I& i) const {       
marci@312: //       i=I(*this);
marci@312: //       return i;
marci@312: //     }
marci@303: //     template<typename I, typename P> I& first(I& i, const P& p) const { 
marci@303: //       i=I(*this, p);
marci@303: //       return i; 
marci@303: //     }
marci@212:     
marci@303: //    template<typename I> I getNext(const I& i) const { 
marci@303: //      return gw.getNext(i); }
marci@312: 
marci@311:     NodeIt& next(NodeIt& i) const { graph->next(i); return i; }
marci@311:     OutEdgeIt& next(OutEdgeIt& i) const { graph->next(i); return i; }
marci@311:     InEdgeIt& next(InEdgeIt& i) const { graph->next(i); return i; }
marci@311:     EdgeIt& next(EdgeIt& i) const { graph->next(i); return i; }    
marci@312: //    template<typename I> I& next(I &i) const { graph->next(i); return i; }    
marci@212:     template< typename It > It first() const { 
marci@212:       It e; this->first(e); return e; }
marci@212: 
marci@212:     template< typename It > It first(const Node& v) const { 
marci@212:       It e; this->first(e, v); return e; }
marci@212: 
marci@303:     Node head(const Edge& e) const { return graph->head(e); }
marci@303:     Node tail(const Edge& e) const { return graph->tail(e); }
marci@312: //    Node tail(const OutEdgeIt& e) const { return graph->tail(Edge(e)); }
marci@212: 
marci@303:     template<typename I> bool valid(const I& i) const { 
marci@303:       return graph->valid(i); }
marci@212:   
marci@212:     //template<typename I> void setInvalid(const I &i);
marci@212:     //{ return graph->setInvalid(i); }
marci@212: 
marci@303:     int nodeNum() const { return graph->nodeNum(); }
marci@303:     int edgeNum() const { return graph->edgeNum(); }
marci@212:   
marci@303:     template<typename I> Node aNode(const I& e) const { 
marci@303:       return graph->aNode(e); }
marci@303:     template<typename I> Node bNode(const I& e) const { 
marci@303:       return graph->bNode(e); }
marci@212:   
marci@303:     Node addNode() const { return graph->addNode(); }
marci@212:     Edge addEdge(const Node& tail, const Node& head) const { 
marci@303:       return graph->addEdge(tail, head); }
marci@212:   
marci@303:     template<typename I> void erase(const I& i) const { graph->erase(i); }
marci@212:   
marci@303:     void clear() const { graph->clear(); }
marci@212:     
marci@303:     template<typename T> class NodeMap : public Graph::NodeMap<T> { 
marci@212:     public:
marci@303:       NodeMap(const GraphWrapper<Graph>& _G) :  
marci@303: 	Graph::NodeMap<T>(*(_G.graph)) { }
marci@303:       NodeMap(const GraphWrapper<Graph>& _G, T a) : 
marci@303: 	Graph::NodeMap<T>(*(_G.graph), a) { }
marci@212:     };
marci@212: 
marci@303:     template<typename T> class EdgeMap : public Graph::EdgeMap<T> { 
marci@212:     public:
marci@303:       EdgeMap(const GraphWrapper<Graph>& _G) :  
marci@303: 	Graph::EdgeMap<T>(*(_G.graph)) { }
marci@303:       EdgeMap(const GraphWrapper<Graph>& _G, T a) : 
marci@303: 	Graph::EdgeMap<T>(*(_G.graph), a) { }
marci@212:     };
marci@212:   };
marci@212: 
marci@303: 
marci@230: //   template<typename Graph>
marci@230: //   class RevGraphWrapper
marci@230: //   {
marci@230: //   protected:
marci@230: //     Graph* graph;
marci@230:   
marci@230: //   public:
marci@303: //     typedef Graph ParentGraph;
marci@230: 
marci@230: //     typedef typename Graph::Node Node;    
marci@230: //     typedef typename Graph::NodeIt NodeIt;
marci@230:   
marci@230: //     typedef typename Graph::Edge Edge;
marci@230: //     typedef typename Graph::OutEdgeIt InEdgeIt;
marci@230: //     typedef typename Graph::InEdgeIt OutEdgeIt;
marci@230: //     //typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@230: //     typedef typename Graph::EdgeIt EdgeIt;
marci@230: 
marci@230: //     //RevGraphWrapper() : graph(0) { }
marci@230: //     RevGraphWrapper(Graph& _graph) : graph(&_graph) { }
marci@230: 
marci@230: //     void setGraph(Graph& _graph) { graph = &_graph; }
marci@230: //     Graph& getGraph() const { return (*graph); }
marci@230:     
marci@230: //     template<typename I> I& first(I& i) const { return graph->first(i); }
marci@230: //     template<typename I, typename P> I& first(I& i, const P& p) const { 
marci@230: //       return graph->first(i, p); }
marci@230: 
marci@230: //     template<typename I> I getNext(const I& i) const { 
marci@230: //       return graph->getNext(i); }
marci@230: //     template<typename I> I& next(I &i) const { return graph->next(i); }    
marci@230: 
marci@230: //     template< typename It > It first() const { 
marci@230: //       It e; first(e); return e; }
marci@230: 
marci@230: //     template< typename It > It first(const Node& v) const { 
marci@230: //       It e; first(e, v); return e; }
marci@230: 
marci@230: //     Node head(const Edge& e) const { return graph->tail(e); }
marci@230: //     Node tail(const Edge& e) const { return graph->head(e); }
marci@230:   
marci@230: //     template<typename I> bool valid(const I& i) const 
marci@230: //       { return graph->valid(i); }
marci@230:   
marci@230: //     //template<typename I> void setInvalid(const I &i);
marci@230: //     //{ return graph->setInvalid(i); }
marci@230:   
marci@230: //     template<typename I> Node aNode(const I& e) const { 
marci@230: //       return graph->aNode(e); }
marci@230: //     template<typename I> Node bNode(const I& e) const { 
marci@230: //       return graph->bNode(e); }
marci@230: 
marci@230: //     Node addNode() const { return graph->addNode(); }
marci@230: //     Edge addEdge(const Node& tail, const Node& head) const { 
marci@230: //       return graph->addEdge(tail, head); }
marci@230:   
marci@230: //     int nodeNum() const { return graph->nodeNum(); }
marci@230: //     int edgeNum() const { return graph->edgeNum(); }
marci@230:   
marci@230: //     template<typename I> void erase(const I& i) const { graph->erase(i); }
marci@230:   
marci@230: //     void clear() const { graph->clear(); }
marci@230: 
marci@230: //     template<typename T> class NodeMap : public Graph::NodeMap<T> { 
marci@230: //     public:
marci@230: //       NodeMap(const RevGraphWrapper<Graph>& _G) : 
marci@230: // 	Graph::NodeMap<T>(_G.getGraph()) { }
marci@230: //       NodeMap(const RevGraphWrapper<Graph>& _G, T a) : 
marci@230: // 	Graph::NodeMap<T>(_G.getGraph(), a) { }
marci@230: //     };
marci@230: 
marci@230: //     template<typename T> class EdgeMap : public Graph::EdgeMap<T> { 
marci@230: //     public:
marci@230: //       EdgeMap(const RevGraphWrapper<Graph>& _G) : 
marci@230: // 	Graph::EdgeMap<T>(_G.getGraph()) { }
marci@230: //       EdgeMap(const RevGraphWrapper<Graph>& _G, T a) : 
marci@230: // 	Graph::EdgeMap<T>(_G.getGraph(), a) { }
marci@230: //     };
marci@230: //   };
marci@230: 
marci@235: 
marci@303:   template<typename Graph>
marci@303:   class RevGraphWrapper : public GraphWrapper<Graph> {
marci@230:   public:
marci@303:     typedef typename GraphWrapper<Graph>::Node Node;
marci@303:     typedef typename GraphWrapper<Graph>::Edge Edge;
marci@279:     //FIXME 
marci@303:     //If Graph::OutEdgeIt is not defined
marci@279:     //and we do not want to use RevGraphWrapper::InEdgeIt,
marci@279:     //this won't work, because of typedef
marci@279:     //OR
marci@279:     //graphs have to define their non-existing iterators to void
marci@279:     //Unfortunately all the typedefs are instantiated in templates, 
marci@279:     //unlike other stuff
marci@303:     typedef typename GraphWrapper<Graph>::OutEdgeIt InEdgeIt;
marci@303:     typedef typename GraphWrapper<Graph>::InEdgeIt OutEdgeIt;
marci@237: 
marci@303: //     RevGraphWrapper() : GraphWrapper<Graph>() { }
marci@303:     RevGraphWrapper(Graph& _graph) : GraphWrapper<Graph>(_graph) { }  
marci@238: 
marci@237:     Node head(const Edge& e) const 
marci@303:       { return GraphWrapper<Graph>::tail(e); }
marci@237:     Node tail(const Edge& e) const 
marci@303:       { return GraphWrapper<Graph>::head(e); }
marci@76:   };
marci@76: 
marci@263:   //Subgraph on the same node-set and partial edge-set
marci@311:   template<typename Graph, typename NodeFilterMap, 
marci@311: 	   typename EdgeFilterMap>
marci@303:   class SubGraphWrapper : public GraphWrapper<Graph> {
marci@263:   protected:
marci@311:     NodeFilterMap* node_filter_map;
marci@311:     EdgeFilterMap* edge_filter_map;
marci@263:   public:
marci@311: //     SubGraphWrapper() : GraphWrapper<Graph>(), filter_map(0) { }
marci@311:     SubGraphWrapper(Graph& _graph, NodeFilterMap& _node_filter_map, 
marci@311: 		    EdgeFilterMap& _edge_filter_map) : 
marci@311:       GraphWrapper<Graph>(_graph), node_filter_map(&_node_filter_map), 
marci@311:       edge_filter_map(&_edge_filter_map) { }  
marci@263: 
marci@263: 
marci@311:     typedef typename Graph::Node Node;
marci@311:     class NodeIt : public Graph::NodeIt { 
marci@311: //      typedef typename Graph::NodeIt GraphNodeIt;
marci@311:     public:
marci@311:       NodeIt() { }
marci@311:       NodeIt(const typename Graph::NodeIt& n) : Graph::NodeIt(n) { }
marci@311:       NodeIt(const Invalid& i) : Graph::NodeIt(i) { }
marci@311:       NodeIt(const SubGraphWrapper<Graph, NodeFilterMap, EdgeFilterMap>& _G) : 
marci@311: 	Graph::NodeIt(*(_G.graph)) { 
marci@311: 	while (_G.graph->valid((*this)/*.GraphNodeIt*/) && 
marci@311: 	       !(*(_G.node_filter_map))[(*this)/*.GraphNodeIt*/]) 
marci@311: 	  _G.graph->next((*this)/*.GraphNodeIt*/);
marci@311:       }
marci@311:     };
marci@311:     typedef typename Graph::Edge Edge;
marci@311:     class OutEdgeIt : public Graph::OutEdgeIt { 
marci@311: //      typedef typename Graph::OutEdgeIt GraphOutEdgeIt;
marci@311:     public:
marci@311:       OutEdgeIt() { }
marci@311:       OutEdgeIt(const typename Graph::OutEdgeIt& e) : Graph::OutEdgeIt(e) { }
marci@311:       OutEdgeIt(const Invalid& i) : Graph::OutEdgeIt(i) { }
marci@311:       OutEdgeIt(const SubGraphWrapper<Graph, NodeFilterMap, EdgeFilterMap>& 
marci@311: 		_G, const Node& n) : 
marci@311: 	Graph::OutEdgeIt(*(_G.graph), n) { 
marci@311: 	while (_G.graph->valid((*this)/*.GraphOutEdgeIt*/) && 
marci@311: 	       !(*(_G.edge_filter_map))[(*this)/*.GraphOutEdgeIt*/]) 
marci@311: 	  _G.graph->next((*this)/*.GraphOutEdgeIt*/);
marci@311:       }
marci@311:     };
marci@311:     class InEdgeIt : public Graph::InEdgeIt { 
marci@311: //      typedef typename Graph::InEdgeIt GraphInEdgeIt;
marci@311:     public:
marci@311:       InEdgeIt() { }
marci@311:       InEdgeIt(const typename Graph::InEdgeIt& e) : Graph::InEdgeIt(e) { }
marci@311:       InEdgeIt(const Invalid& i) : Graph::InEdgeIt(i) { }
marci@311:       InEdgeIt(const SubGraphWrapper<Graph, NodeFilterMap, EdgeFilterMap>& _G, 
marci@311: 	       const Node& n) : 
marci@311: 	Graph::InEdgeIt(*(_G.graph), n) { 
marci@311: 	while (_G.graph->valid((*this)/*.GraphInEdgeIt*/) && 
marci@311: 	       !(*(_G.edge_filter_map))[(*this)/*.GraphInEdgeIt*/]) 
marci@311: 	  _G.graph->next((*this)/*.GraphInEdgeIt*/);
marci@311:       }
marci@311:     };
marci@311: //     //typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@311:     class EdgeIt : public Graph::EdgeIt { 
marci@311: //      typedef typename Graph::EdgeIt GraphEdgeIt;
marci@311:     public:
marci@311:       EdgeIt() { }
marci@311:       EdgeIt(const typename Graph::EdgeIt& e) : Graph::EdgeIt(e) { }
marci@311:       EdgeIt(const Invalid& i) : Graph::EdgeIt(i) { }
marci@311:       EdgeIt(const SubGraphWrapper<Graph, NodeFilterMap, EdgeFilterMap>& _G) : 
marci@311: 	Graph::EdgeIt(*(_G.graph)) { 
marci@311: 	while (_G.graph->valid((*this)/*.GraphEdgeIt*/) && 
marci@311: 	       !(*(_G.edge_filter_map))[(*this)/*.GraphEdgeIt*/]) 
marci@311: 	  _G.graph->next((*this)/*.GraphEdgeIt*/);
marci@311:       }
marci@311:     };
marci@311:    
marci@311:     NodeIt& first(NodeIt& i) const {
marci@311:       i=NodeIt(*this);
marci@263:       return i;
marci@263:     }
marci@311:     OutEdgeIt& first(OutEdgeIt& i, const Node& n) const {
marci@311:       i=OutEdgeIt(*this, n);
marci@311:       return i;
marci@311:     }
marci@311:     InEdgeIt& first(InEdgeIt& i, const Node& n) const {
marci@311:       i=InEdgeIt(*this, n);
marci@311:       return i;
marci@311:     }
marci@311:     EdgeIt& first(EdgeIt& i) const {
marci@311:       i=EdgeIt(*this);
marci@263:       return i;
marci@263:     }
marci@263:     
marci@311: //     template<typename I> I& first(I& i) const { 
marci@311: //       graph->first(i); 
marci@311: //       //while (graph->valid(i) && !filter_map->get(i)) { graph->next(i); }
marci@311: //       while (graph->valid(i) && !(*edge_filter_map)[i]) { graph->next(i); }
marci@311: //       return i;
marci@311: //     }
marci@311: //     template<typename I, typename P> I& first(I& i, const P& p) const { 
marci@311: //       graph->first(i, p); 
marci@311: // //      while (graph->valid(i) && !filter_map->get(i)) { graph->next(i); }
marci@311: //       while (graph->valid(i) && !(*edge_filter_map)[i]) { graph->next(i); }
marci@311: //       return i;
marci@311: //     }
marci@311: 
marci@311:     NodeIt& next(NodeIt& i) const {
marci@311:       graph->next(i); 
marci@311:       while (graph->valid(i) && !(*node_filter_map)[i]) { graph->next(i); }
marci@311:       return i;
marci@311:     }
marci@311:     OutEdgeIt& next(OutEdgeIt& i) const {
marci@311:       graph->next(i); 
marci@311:       while (graph->valid(i) && !(*edge_filter_map)[i]) { graph->next(i); }
marci@311:       return i;
marci@311:     }
marci@311:     InEdgeIt& next(InEdgeIt& i) const {
marci@311:       graph->next(i); 
marci@311:       while (graph->valid(i) && !(*edge_filter_map)[i]) { graph->next(i); }
marci@311:       return i;
marci@311:     }
marci@311:     EdgeIt& next(EdgeIt& i) const {
marci@311:       graph->next(i); 
marci@311:       while (graph->valid(i) && !(*edge_filter_map)[i]) { graph->next(i); }
marci@311:       return i;
marci@311:     }
marci@311: 
marci@263:     //template<typename I> I getNext(const I& i) const { 
marci@263:     //  return gw.getNext(i); 
marci@263:     //}
marci@311: //     template<typename I> I& next(I &i) const { 
marci@311: //       graph->next(i); 
marci@311: // //      while (graph->valid(i) && !filter_map-get(i)) { graph->next(i); }
marci@311: //       while (graph->valid(i) && !(*edge_filter_map)[i]) { graph->next(i); }
marci@311: //       return i;
marci@311: //     }
marci@263:     
marci@263:     template< typename It > It first() const { 
marci@263:       It e; this->first(e); return e; }
marci@263:     
marci@263:     template< typename It > It first(const Node& v) const { 
marci@263:       It e; this->first(e, v); return e; }
marci@263:   };
marci@155: 
marci@238: //   template<typename GraphWrapper>
marci@236: //   class UndirGraphWrapper {
marci@236: //   protected:
marci@238: //     //Graph* graph;
marci@238: //     GraphWrapper gw;
marci@238: 
marci@236: //   public:
marci@303: //     typedef GraphWrapper ParentGraph;
marci@236: 
marci@238: //     typedef typename GraphWrapper::Node Node;
marci@238: //     typedef typename GraphWrapper::NodeIt NodeIt;
marci@236: 
marci@236: //     //typedef typename Graph::Edge Edge;
marci@236: //     //typedef typename Graph::OutEdgeIt OutEdgeIt;
marci@236: //     //typedef typename Graph::InEdgeIt InEdgeIt;
marci@236: //     //typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@236: //     //typedef typename Graph::EdgeIt EdgeIt;
marci@236: 
marci@236: //     //private:
marci@238: //     typedef typename GraphWrapper::Edge GraphEdge;
marci@238: //     typedef typename GraphWrapper::OutEdgeIt GraphOutEdgeIt;
marci@238: //     typedef typename GraphWrapper::InEdgeIt GraphInEdgeIt;
marci@236: //     //public:
marci@236: 
marci@236: //     //UndirGraphWrapper() : graph(0) { }
marci@238: //     UndirGraphWrapper(GraphWrapper _gw) : gw(_gw) { }
marci@236: 
marci@238: //     //void setGraph(Graph& _graph) { graph = &_graph; }
marci@238: //     //Graph& getGraph() const { return (*graph); }
marci@236:   
marci@236: //     class Edge {
marci@238: //       friend class UndirGraphWrapper<GraphWrapper>;
marci@236: //       bool out_or_in; //true iff out
marci@236: //       GraphOutEdgeIt out;
marci@236: //       GraphInEdgeIt in;
marci@236: //     public:
marci@236: //       Edge() : out_or_in(), out(), in() { }
marci@236: //       Edge(const Invalid& i) : out_or_in(false), out(), in(i) { }
marci@236: //       operator GraphEdge() const {
marci@236: // 	if (out_or_in) return(out); else return(in);
marci@236: //       }
marci@236: //       friend bool operator==(const Edge& u, const Edge& v) { 
marci@236: // 	if (v.out_or_in) 
marci@236: // 	  return (u.out_or_in && u.out==v.out);
marci@236: // 	else
marci@236: // 	  return (!u.out_or_in && u.in==v.in);
marci@236: //       } 
marci@236: //       friend bool operator!=(const Edge& u, const Edge& v) { 
marci@236: // 	if (v.out_or_in) 
marci@236: // 	  return (!u.out_or_in || u.out!=v.out);
marci@236: // 	else
marci@236: // 	  return (u.out_or_in || u.in!=v.in);
marci@236: //       } 
marci@236: //     };
marci@236: 
marci@236: //     class OutEdgeIt : public Edge {
marci@238: //       friend class UndirGraphWrapper<GraphWrapper>;
marci@236: //     public:
marci@236: //       OutEdgeIt() : Edge() { }
marci@236: //       OutEdgeIt(const Invalid& i) : Edge(i) { }
marci@238: //       OutEdgeIt(const UndirGraphWrapper<GraphWrapper>& _G, const Node& n) 
marci@238: // 	: Edge() { 
marci@236: // 	out_or_in=true;
marci@238: // 	_G.gw.first(out, n);
marci@238: // 	if (!(_G.gw.valid(out))) {
marci@236: // 	  out_or_in=false;
marci@238: // 	  _G.gw.first(in, n);
marci@236: // 	}
marci@236: //       }
marci@236: //     };
marci@236: 
marci@236: //     OutEdgeIt& first(OutEdgeIt& e, const Node& n) const {
marci@236: //       e.out_or_in=true;
marci@238: //       gw.first(e.out, n);
marci@238: //       if (!(gw.valid(e.out))) {
marci@236: // 	e.out_or_in=false;
marci@238: // 	gw.first(e.in, n);
marci@236: //       }
marci@236: //       return e;
marci@236: //     }
marci@236: 
marci@236: //     OutEdgeIt& next(OutEdgeIt& e) const {
marci@236: //       if (e.out_or_in) {
marci@238: // 	Node n=gw.tail(e.out);
marci@238: // 	gw.next(e.out);
marci@238: // 	if (!gw.valid(e.out)) {
marci@236: // 	  e.out_or_in=false;
marci@238: // 	  gw.first(e.in, n);
marci@236: // 	}
marci@236: //       } else {
marci@238: // 	gw.next(e.in);
marci@236: //       }
marci@236: //       return e;
marci@236: //     }
marci@236: 
marci@236: //     Node aNode(const OutEdgeIt& e) const { 
marci@238: //       if (e.out_or_in) return gw.tail(e); else return gw.head(e); }
marci@236: //     Node bNode(const OutEdgeIt& e) const { 
marci@238: //       if (e.out_or_in) return gw.head(e); else return gw.tail(e); }
marci@236: 
marci@236: //     typedef OutEdgeIt InEdgeIt; 
marci@236: 
marci@238: //     template<typename I> I& first(I& i) const { return gw.first(i); }
marci@236: // //     template<typename I, typename P> I& first(I& i, const P& p) const { 
marci@236: // //       return graph->first(i, p); }
marci@236:     
marci@236: //     template<typename I> I getNext(const I& i) const { 
marci@238: //       return gw.getNext(i); }
marci@238: //     template<typename I> I& next(I &i) const { return gw.next(i); }    
marci@236: 
marci@236: //     template< typename It > It first() const { 
marci@236: //       It e; first(e); return e; }
marci@236: 
marci@236: //     template< typename It > It first(const Node& v) const { 
marci@236: //       It e; first(e, v); return e; }
marci@236: 
marci@238: //     Node head(const Edge& e) const { return gw.head(e); }
marci@238: //     Node tail(const Edge& e) const { return gw.tail(e); }
marci@236: 
marci@236: //     template<typename I> bool valid(const I& i) const 
marci@238: //       { return gw.valid(i); }
marci@236:   
marci@236: //     //template<typename I> void setInvalid(const I &i);
marci@236: //     //{ return graph->setInvalid(i); }
marci@236: 
marci@238: //     int nodeNum() const { return gw.nodeNum(); }
marci@238: //     int edgeNum() const { return gw.edgeNum(); }
marci@236:   
marci@236: // //     template<typename I> Node aNode(const I& e) const { 
marci@236: // //       return graph->aNode(e); }
marci@236: // //     template<typename I> Node bNode(const I& e) const { 
marci@236: // //       return graph->bNode(e); }
marci@236:   
marci@238: //     Node addNode() const { return gw.addNode(); }
marci@236: // // FIXME: ez igy nem jo, mert nem
marci@236: // //    Edge addEdge(const Node& tail, const Node& head) const { 
marci@236: // //      return graph->addEdge(tail, head); }
marci@236:   
marci@238: //     template<typename I> void erase(const I& i) const { gw.erase(i); }
marci@236:   
marci@238: //     void clear() const { gw.clear(); }
marci@236:     
marci@238: //     template<typename T> class NodeMap : public GraphWrapper::NodeMap<T> { 
marci@236: //     public:
marci@238: //       NodeMap(const UndirGraphWrapper<GraphWrapper>& _G) : 
marci@238: // 	GraphWrapper::NodeMap<T>(_G.gw) { }
marci@238: //       NodeMap(const UndirGraphWrapper<GraphWrapper>& _G, T a) : 
marci@238: // 	GraphWrapper::NodeMap<T>(_G.gw, a) { }
marci@236: //     };
marci@236: 
marci@238: //     template<typename T> class EdgeMap : public GraphWrapper::EdgeMap<T> { 
marci@236: //     public:
marci@238: //       EdgeMap(const UndirGraphWrapper<GraphWrapper>& _G) : 
marci@238: // 	GraphWrapper::EdgeMap<T>(_G.gw) { }
marci@238: //       EdgeMap(const UndirGraphWrapper<GraphWrapper>& _G, T a) : 
marci@238: // 	GraphWrapper::EdgeMap<T>(_G.gw, a) { }
marci@236: //     };
marci@236: //   };
marci@236: 
marci@236: 
marci@303:   template<typename Graph>
marci@303:   class UndirGraphWrapper : public GraphWrapper<Graph> {
marci@199:   protected:
marci@303:     typedef typename Graph::Edge GraphEdge;
marci@303:     typedef typename Graph::OutEdgeIt GraphOutEdgeIt;
marci@303:     typedef typename Graph::InEdgeIt GraphInEdgeIt;    
marci@303:   public:
marci@303:     typedef typename GraphWrapper<Graph>::Node Node;
marci@303:     typedef typename GraphWrapper<Graph>::NodeIt NodeIt;
marci@236: 
marci@303: //     UndirGraphWrapper() : GraphWrapper<Graph>() { }
marci@303:     UndirGraphWrapper(Graph& _graph) : GraphWrapper<Graph>(_graph) { }  
marci@158: 
marci@174:     class Edge {
marci@303:       friend class UndirGraphWrapper<Graph>;
marci@279:     protected:
marci@158:       bool out_or_in; //true iff out
marci@158:       GraphOutEdgeIt out;
marci@158:       GraphInEdgeIt in;
marci@158:     public:
marci@174:       Edge() : out_or_in(), out(), in() { }
marci@174:       Edge(const Invalid& i) : out_or_in(false), out(), in(i) { }
marci@174:       operator GraphEdge() const {
marci@158: 	if (out_or_in) return(out); else return(in);
marci@158:       }
marci@239: //FIXME
marci@239: //2 edges are equal if they "refer" to the same physical edge 
marci@239: //is it good?
marci@174:       friend bool operator==(const Edge& u, const Edge& v) { 
marci@174: 	if (v.out_or_in) 
marci@239: 	  if (u.out_or_in) return (u.out==v.out); else return (u.out==v.in);
marci@239: 	//return (u.out_or_in && u.out==v.out);
marci@174: 	else
marci@239: 	  if (u.out_or_in) return (u.out==v.in); else return (u.in==v.in);
marci@239: 	//return (!u.out_or_in && u.in==v.in);
marci@174:       } 
marci@174:       friend bool operator!=(const Edge& u, const Edge& v) { 
marci@174: 	if (v.out_or_in) 
marci@239: 	  if (u.out_or_in) return (u.out!=v.out); else return (u.out!=v.in);
marci@239: 	//return (!u.out_or_in || u.out!=v.out);
marci@174: 	else
marci@239: 	  if (u.out_or_in) return (u.out!=v.in); else return (u.in!=v.in);
marci@239: 	//return (u.out_or_in || u.in!=v.in);
marci@174:       } 
marci@158:     };
marci@158: 
marci@174:     class OutEdgeIt : public Edge {
marci@303:       friend class UndirGraphWrapper<Graph>;
marci@158:     public:
marci@174:       OutEdgeIt() : Edge() { }
marci@174:       OutEdgeIt(const Invalid& i) : Edge(i) { }
marci@303:       OutEdgeIt(const UndirGraphWrapper<Graph>& _G, const Node& n) 
marci@236: 	: Edge() { 
marci@303: 	out_or_in=true; _G.graph->first(out, n);
marci@303: 	if (!(_G.graph->valid(out))) { out_or_in=false; _G.graph->first(in, n);	}
marci@158:       }
marci@158:     };
marci@158: 
marci@238:     typedef OutEdgeIt InEdgeIt; 
marci@238: 
marci@238:     class EdgeIt : public Edge {
marci@303:       friend class UndirGraphWrapper<Graph>;
marci@238:     protected:
marci@238:       NodeIt v;
marci@238:     public:
marci@238:       EdgeIt() : Edge() { }
marci@238:       EdgeIt(const Invalid& i) : Edge(i) { }
marci@303:       EdgeIt(const UndirGraphWrapper<Graph>& _G) 
marci@238: 	: Edge() { 
marci@238: 	out_or_in=true;
marci@238: 	//Node v;
marci@238: 	_G.first(v);
marci@303: 	if (_G.valid(v)) _G.graph->first(out); else out=INVALID;
marci@303: 	while (_G.valid(v) && !_G.graph->valid(out)) { 
marci@303: 	  _G.graph->next(v); 
marci@303: 	  if (_G.valid(v)) _G.graph->first(out); 
marci@238: 	}
marci@238:       }
marci@238:     };
marci@238: 
marci@212:     OutEdgeIt& first(OutEdgeIt& e, const Node& n) const {
marci@303:       e.out_or_in=true; graph->first(e.out, n);
marci@303:       if (!(graph->valid(e.out))) { e.out_or_in=false; graph->first(e.in, n); }
marci@158:       return e;
marci@158:     }
marci@158: 
marci@238:     EdgeIt& first(EdgeIt& e) const {
marci@238:       e.out_or_in=true;
marci@238:       //NodeIt v;
marci@238:       first(e.v);
marci@303:       if (valid(e.v)) graph->first(e.out, e.v); else e.out=INVALID;
marci@303:       while (valid(e.v) && !graph->valid(e.out)) { 
marci@303: 	graph->next(e.v); 
marci@303: 	if (valid(e.v)) graph->first(e.out, e.v); 
marci@238:       }
marci@238:       return e;
marci@238:     }
marci@238: 
marci@303:     template<typename I> I& first(I& i) const { graph->first(i); return i; }
marci@238:     template<typename I, typename P> I& first(I& i, const P& p) const { 
marci@303:       graph->first(i, p); return i; }
marci@238: 
marci@158:     OutEdgeIt& next(OutEdgeIt& e) const {
marci@158:       if (e.out_or_in) {
marci@303: 	Node n=graph->tail(e.out);
marci@303: 	graph->next(e.out);
marci@303: 	if (!graph->valid(e.out)) { e.out_or_in=false; graph->first(e.in, n); }
marci@158:       } else {
marci@303: 	graph->next(e.in);
marci@158:       }
marci@158:       return e;
marci@158:     }
marci@158: 
marci@238:     EdgeIt& next(EdgeIt& e) const {
marci@238:       //NodeIt v=tail(e);
marci@303:       graph->next(e.out);
marci@303:       while (valid(e.v) && !graph->valid(e.out)) { 
marci@238: 	next(e.v); 
marci@303: 	if (valid(e.v)) graph->first(e.out, e.v); 
marci@238:       }
marci@238:       return e;
marci@238:     }
marci@158: 
marci@305:     template<typename I> I& next(I &i) const { graph->next(i); return i; }    
marci@265: //    template<typename I> I getNext(const I& i) const { return gw.getNext(i); }
marci@158: 
marci@158:     template< typename It > It first() const { 
marci@303:       It e; this->first(e); return e; }
marci@158: 
marci@174:     template< typename It > It first(const Node& v) const { 
marci@303:       It e; this->first(e, v); return e; }
marci@158: 
marci@238: //    Node head(const Edge& e) const { return gw.head(e); }
marci@238: //    Node tail(const Edge& e) const { return gw.tail(e); }
marci@158: 
marci@238: //    template<typename I> bool valid(const I& i) const 
marci@238: //      { return gw.valid(i); }
marci@158:   
marci@238: //    int nodeNum() const { return gw.nodeNum(); }
marci@238: //    int edgeNum() const { return gw.edgeNum(); }
marci@158:   
marci@174: //     template<typename I> Node aNode(const I& e) const { 
marci@158: //       return graph->aNode(e); }
marci@174: //     template<typename I> Node bNode(const I& e) const { 
marci@158: //       return graph->bNode(e); }
marci@238: 
marci@238:     Node aNode(const OutEdgeIt& e) const { 
marci@303:       if (e.out_or_in) return graph->tail(e); else return graph->head(e); }
marci@238:     Node bNode(const OutEdgeIt& e) const { 
marci@303:       if (e.out_or_in) return graph->head(e); else return graph->tail(e); }
marci@158:   
marci@238: //    Node addNode() const { return gw.addNode(); }
marci@238: 
marci@231: // FIXME: ez igy nem jo, mert nem
marci@231: //    Edge addEdge(const Node& tail, const Node& head) const { 
marci@231: //      return graph->addEdge(tail, head); }
marci@158:   
marci@238: //    template<typename I> void erase(const I& i) const { gw.erase(i); }
marci@158:   
marci@238: //    void clear() const { gw.clear(); }
marci@158:     
marci@303: //     template<typename T> class NodeMap : public Graph::NodeMap<T> { 
marci@238: //     public:
marci@303: //       NodeMap(const UndirGraphWrapper<Graph>& _G) : 
marci@303: // 	Graph::NodeMap<T>(_G.gw) { }
marci@303: //       NodeMap(const UndirGraphWrapper<Graph>& _G, T a) : 
marci@303: // 	Graph::NodeMap<T>(_G.gw, a) { }
marci@238: //     };
marci@168: 
marci@238: //     template<typename T> class EdgeMap : 
marci@303: //       public GraphWrapperSkeleton<Graph>::EdgeMap<T> { 
marci@238: //     public:
marci@303: //       EdgeMap(const UndirGraphWrapper<Graph>& _G) : 
marci@303: // 	GraphWrapperSkeleton<Graph>::EdgeMap<T>(_G.gw) { }
marci@303: //       EdgeMap(const UndirGraphWrapper<Graph>& _G, T a) : 
marci@303: // 	Graph::EdgeMap<T>(_G.gw, a) { }
marci@238: //     };
marci@238:    };
marci@158: 
marci@158: 
marci@158: 
marci@236: 
marci@236: 
marci@155: //   template<typename Graph>
marci@155: //   class SymGraphWrapper
marci@155: //   {
marci@155: //     Graph* graph;
marci@76:   
marci@155: //   public:
marci@303: //     typedef Graph ParentGraph;
marci@155: 
marci@174: //     typedef typename Graph::Node Node;
marci@174: //     typedef typename Graph::Edge Edge;
marci@174:   
marci@155: //     typedef typename Graph::NodeIt NodeIt;
marci@155:     
marci@155: //     //FIXME tag-ekkel megcsinalni, hogy abbol csinaljon
marci@155: //     //iranyitatlant, ami van
marci@155: //     //mert csak 1 dolgot lehet be typedef-elni
marci@155: //     typedef typename Graph::OutEdgeIt SymEdgeIt;
marci@155: //     //typedef typename Graph::InEdgeIt SymEdgeIt;
marci@155: //     //typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@174: //     typedef typename Graph::EdgeIt EdgeIt;
marci@155: 
marci@155: //     int nodeNum() const { return graph->nodeNum(); }
marci@155: //     int edgeNum() const { return graph->edgeNum(); }
marci@155:     
marci@212: //     template<typename I> I& first(I& i) const { return graph->first(i); }
marci@212: //     template<typename I, typename P> I& first(I& i, const P& p) const { 
marci@212: //       return graph->first(i, p); }
marci@155: //     //template<typename I> I next(const I i); { return graph->goNext(i); }
marci@155: //     //template<typename I> I &goNext(I &i); { return graph->goNext(i); }
marci@155: 
marci@155: //     template< typename It > It first() const { 
marci@212: //       It e; first(e); return e; }
marci@155: 
marci@174: //     template< typename It > It first(Node v) const { 
marci@212: //       It e; first(e, v); return e; }
marci@155: 
marci@174: //     Node head(const Edge& e) const { return graph->head(e); }
marci@174: //     Node tail(const Edge& e) const { return graph->tail(e); }
marci@155:   
marci@174: //     template<typename I> Node aNode(const I& e) const { 
marci@155: //       return graph->aNode(e); }
marci@174: //     template<typename I> Node bNode(const I& e) const { 
marci@155: //       return graph->bNode(e); }
marci@155:   
marci@155: //     //template<typename I> bool valid(const I i);
marci@155: //     //{ return graph->valid(i); }
marci@155:   
marci@155: //     //template<typename I> void setInvalid(const I &i);
marci@155: //     //{ return graph->setInvalid(i); }
marci@155:   
marci@174: //     Node addNode() { return graph->addNode(); }
marci@174: //     Edge addEdge(const Node& tail, const Node& head) { 
marci@155: //       return graph->addEdge(tail, head); }
marci@155:   
marci@155: //     template<typename I> void erase(const I& i) { graph->erase(i); }
marci@155:   
marci@155: //     void clear() { graph->clear(); }
marci@155:   
marci@155: //     template<typename T> class NodeMap : public Graph::NodeMap<T> { };
marci@155: //     template<typename T> class EdgeMap : public Graph::EdgeMap<T> { };
marci@155:   
marci@155: //     void setGraph(Graph& _graph) { graph = &_graph; }
marci@155: //     Graph& getGraph() { return (*graph); }
marci@155: 
marci@155: //     //SymGraphWrapper() : graph(0) { }
marci@155: //     SymGraphWrapper(Graph& _graph) : graph(&_graph) { }
marci@155: //   };
marci@155: 
marci@155: 
marci@303:   template<typename Graph, typename Number, typename FlowMap, typename CapacityMap>
marci@311:   class ResGraphWrapper : public GraphWrapper<Graph> {
marci@199:   protected:
marci@303:     typedef typename Graph::OutEdgeIt GraphOutEdgeIt;
marci@303:     typedef typename Graph::InEdgeIt GraphInEdgeIt;
marci@303:     typedef typename Graph::Edge GraphEdge;
marci@155:     FlowMap* flow;
marci@155:     const CapacityMap* capacity;
marci@155:   public:
marci@168: 
marci@303:     ResGraphWrapper(Graph& _graph, FlowMap& _flow, 
marci@266: 		    const CapacityMap& _capacity) : 
marci@303:       GraphWrapper<Graph>(_graph), flow(&_flow), capacity(&_capacity) { }
marci@168: 
marci@174:     class Edge; 
marci@155:     class OutEdgeIt; 
marci@174:     friend class Edge; 
marci@155:     friend class OutEdgeIt; 
marci@76: 
marci@311:     typedef typename GraphWrapper<Graph>::Node Node;
marci@311:     typedef typename GraphWrapper<Graph>::NodeIt NodeIt;
marci@174:     class Edge {
marci@303:       friend class ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>;
marci@155:     protected:
marci@168:       bool out_or_in; //true, iff out
marci@303:       GraphOutEdgeIt out;
marci@303:       GraphInEdgeIt in;
marci@155:     public:
marci@174:       Edge() : out_or_in(true) { } 
marci@174:       Edge(const Invalid& i) : out_or_in(false), out(), in(i) { }
marci@168: //       bool valid() const { 
marci@168: // 	return out_or_in && out.valid() || in.valid(); }
marci@174:       friend bool operator==(const Edge& u, const Edge& v) { 
marci@174: 	if (v.out_or_in) 
marci@174: 	  return (u.out_or_in && u.out==v.out);
marci@174: 	else
marci@174: 	  return (!u.out_or_in && u.in==v.in);
marci@174:       } 
marci@174:       friend bool operator!=(const Edge& u, const Edge& v) { 
marci@174: 	if (v.out_or_in) 
marci@174: 	  return (!u.out_or_in || u.out!=v.out);
marci@174: 	else
marci@174: 	  return (u.out_or_in || u.in!=v.in);
marci@174:       } 
marci@303:       operator GraphEdge() const {
marci@303: 	if (out_or_in) return(out); else return(in);
marci@303:       }
marci@155:     };
marci@174:     class OutEdgeIt : public Edge {
marci@303:       friend class ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>;
marci@155:     public:
marci@155:       OutEdgeIt() { }
marci@168:       //FIXME
marci@174:       OutEdgeIt(const Edge& e) : Edge(e) { }
marci@174:       OutEdgeIt(const Invalid& i) : Edge(i) { }
marci@303:       OutEdgeIt(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& resG, Node v) : Edge() { 
marci@303: 	resG.graph->first(out, v);
marci@303: 	while( resG.graph->valid(out) && !(resG.resCap(out)>0) ) { resG.graph->next(out); }
marci@303: 	if (!resG.graph->valid(out)) {
marci@155: 	  out_or_in=0;
marci@303: 	  resG.graph->first(in, v);
marci@303: 	  while( resG.graph->valid(in) && !(resG.resCap(in)>0) ) { resG.graph->next(in); }
marci@155: 	}
marci@155:       }
marci@168: //     public:
marci@168: //       OutEdgeIt& operator++() { 
marci@168: // 	if (out_or_in) {
marci@174: // 	  Node v=/*resG->*/G->aNode(out);
marci@168: // 	  ++out;
marci@269: // 	  while( out.valid() && !(Edge::resCap()>0) ) { ++out; }
marci@168: // 	  if (!out.valid()) {
marci@168: // 	    out_or_in=0;
marci@212: // 	    G->first(in, v); 
marci@269: // 	    while( in.valid() && !(Edge::resCap()>0) ) { ++in; }
marci@168: // 	  }
marci@168: // 	} else {
marci@168: // 	  ++in;
marci@269: // 	  while( in.valid() && !(Edge::resCap()>0) ) { ++in; } 
marci@168: // 	}
marci@168: // 	return *this; 
marci@168: //       }
marci@155:     };
marci@155: 
marci@263:     //FIXME This is just for having InEdgeIt
marci@311: //    class InEdgeIt : public Edge { };
marci@263: 
marci@174:     class EdgeIt : public Edge {
marci@303:       friend class ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>;
marci@265:       NodeIt v; 
marci@155:     public:
marci@174:       EdgeIt() { }
marci@174:       //EdgeIt(const EdgeIt& e) : Edge(e), v(e.v) { }
marci@174:       EdgeIt(const Invalid& i) : Edge(i) { }
marci@303:       EdgeIt(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& resG) : Edge() { 
marci@303: 	resG.graph->first(v);
marci@303: 	if (resG.graph->valid(v)) resG.graph->first(out, v); else out=INVALID;
marci@303: 	while (resG.graph->valid(out) && !(resG.resCap(out)>0) ) { resG.graph->next(out); }
marci@303: 	while (resG.graph->valid(v) && !resG.graph->valid(out)) { 
marci@303: 	  resG.graph->next(v); 
marci@303: 	  if (resG.graph->valid(v)) resG.graph->first(out, v); 
marci@303: 	  while (resG.graph->valid(out) && !(resG.resCap(out)>0) ) { resG.graph->next(out); }
marci@155: 	}
marci@303: 	if (!resG.graph->valid(out)) {
marci@155: 	  out_or_in=0;
marci@303: 	  resG.graph->first(v);
marci@303: 	  if (resG.graph->valid(v)) resG.graph->first(in, v); else in=INVALID;
marci@303: 	  while (resG.graph->valid(in) && !(resG.resCap(in)>0) ) { resG.graph->next(in); }
marci@303: 	  while (resG.graph->valid(v) && !resG.graph->valid(in)) { 
marci@303: 	    resG.graph->next(v); 
marci@303: 	    if (resG.graph->valid(v)) resG.graph->first(in, v); 
marci@303: 	    while (resG.graph->valid(in) && !(resG.resCap(in)>0) ) { resG.graph->next(in); }
marci@155: 	  }
marci@155: 	}
marci@155:       }
marci@174: //       EdgeIt& operator++() { 
marci@168: // 	if (out_or_in) {
marci@168: // 	  ++out;
marci@269: // 	  while (out.valid() && !(Edge::resCap()>0) ) { ++out; }
marci@168: // 	  while (v.valid() && !out.valid()) { 
marci@168: // 	    ++v; 
marci@212: // 	    if (v.valid()) G->first(out, v); 
marci@269: // 	    while (out.valid() && !(Edge::resCap()>0) ) { ++out; }
marci@168: // 	  }
marci@168: // 	  if (!out.valid()) {
marci@168: // 	    out_or_in=0;
marci@212: // 	    G->first(v);
marci@303: // 	    if (v.valid()) G->first(in, v); else in=GraphInEdgeIt();
marci@269: // 	    while (in.valid() && !(Edge::resCap()>0) ) { ++in; }
marci@168: // 	    while (v.valid() && !in.valid()) { 
marci@168: // 	      ++v; 
marci@212: // 	      if (v.valid()) G->first(in, v); 
marci@269: // 	      while (in.valid() && !(Edge::resCap()>0) ) { ++in; }
marci@168: // 	    }  
marci@168: // 	  }
marci@168: // 	} else {
marci@168: // 	  ++in;
marci@269: // 	  while (in.valid() && !(Edge::resCap()>0) ) { ++in; }
marci@168: // 	  while (v.valid() && !in.valid()) { 
marci@168: // 	    ++v; 
marci@212: // 	    if (v.valid()) G->first(in, v); 
marci@269: // 	    while (in.valid() && !(Edge::resCap()>0) ) { ++in; }
marci@168: // 	  }
marci@168: // 	}
marci@168: // 	return *this;
marci@168: //       }
marci@155:     };
marci@155: 
marci@311:     NodeIt& first(NodeIt& i) const { 
marci@311:       i=NodeIt(*this); 
marci@311:       return i; 
marci@155:     }
marci@311:     OutEdgeIt& first(OutEdgeIt& i, const Node& p) const { 
marci@311:       i=OutEdgeIt(*this, p);
marci@311:       return i;
marci@311:     }
marci@311:     //FIXME Not yet implemented
marci@311:     //InEdgeIt& first(InEdgeIt& i, const Node& p) const {
marci@311:     //i=InEdgeIt(*this, p);
marci@311:     //  return i;
marci@311:     //}
marci@212:     EdgeIt& first(EdgeIt& e) const { 
marci@174:       e=EdgeIt(*this); 
marci@174:       return e;
marci@155:     }
marci@155:    
marci@305:     NodeIt& next(NodeIt& n) const { graph->next(n); return n; }
marci@155:     OutEdgeIt& next(OutEdgeIt& e) const { 
marci@155:       if (e.out_or_in) {
marci@303: 	Node v=graph->aNode(e.out);
marci@303: 	graph->next(e.out);
marci@303: 	while( graph->valid(e.out) && !(resCap(e.out)>0) ) { graph->next(e.out); }
marci@303: 	if (!graph->valid(e.out)) {
marci@155: 	  e.out_or_in=0;
marci@303: 	  graph->first(e.in, v); 
marci@303: 	  while( graph->valid(e.in) && !(resCap(e.in)>0) ) { graph->next(e.in); }
marci@155: 	}
marci@155:       } else {
marci@303: 	graph->next(e.in);
marci@303: 	while( graph->valid(e.in) && !(resCap(e.in)>0) ) { graph->next(e.in); } 
marci@155:       }
marci@155:       return e;
marci@155:     }
marci@311:     //FIXME Not yet implemented
marci@311:     //InEdgeIt& next(InEdgeIt& e) const {
marci@311:     //  return e;
marci@311:     //}
marci@174:     EdgeIt& next(EdgeIt& e) const { 
marci@155:       if (e.out_or_in) {
marci@303: 	graph->next(e.out);
marci@303: 	while (graph->valid(e.out) && !(resCap(e.out)>0) ) { graph->next(e.out); }
marci@303: 	  while (graph->valid(e.v) && !graph->valid(e.out)) { 
marci@303: 	    graph->next(e.v); 
marci@303: 	    if (graph->valid(e.v)) graph->first(e.out, e.v); 
marci@303: 	    while (graph->valid(e.out) && !(resCap(e.out)>0) ) { graph->next(e.out); }
marci@155: 	  }
marci@303: 	  if (!graph->valid(e.out)) {
marci@155: 	    e.out_or_in=0;
marci@303: 	    graph->first(e.v);
marci@303: 	    if (graph->valid(e.v)) graph->first(e.in, e.v); else e.in=INVALID;
marci@303: 	    while (graph->valid(e.in) && !(resCap(e.in)>0) ) { graph->next(e.in); }
marci@303: 	    while (graph->valid(e.v) && !graph->valid(e.in)) { 
marci@303: 	      graph->next(e.v); 
marci@303: 	      if (graph->valid(e.v)) graph->first(e.in, e.v); 
marci@303: 	      while (graph->valid(e.in) && !(resCap(e.in)>0) ) { graph->next(e.in); }
marci@155: 	    }  
marci@155: 	  }
marci@155: 	} else {
marci@303: 	  graph->next(e.in);
marci@303: 	  while (graph->valid(e.in) && !(resCap(e.in)>0) ) { graph->next(e.in); }
marci@303: 	  while (graph->valid(e.v) && !graph->valid(e.in)) { 
marci@303: 	    graph->next(e.v); 
marci@303: 	    if (graph->valid(e.v)) graph->first(e.in, e.v); 
marci@303: 	    while (graph->valid(e.in) && !(resCap(e.in)>0) ) { graph->next(e.in); }
marci@155: 	  }
marci@155: 	}
marci@155: 	return e;
marci@155:       }
marci@76:     
marci@76: 
marci@155:     template< typename It >
marci@155:     It first() const { 
marci@155:       It e;
marci@212:       first(e);
marci@155:       return e; 
marci@155:     }
marci@76: 
marci@155:     template< typename It >
marci@174:     It first(Node v) const { 
marci@155:       It e;
marci@212:       first(e, v);
marci@155:       return e; 
marci@155:     }
marci@76: 
marci@174:     Node tail(Edge e) const { 
marci@303:       return ((e.out_or_in) ? graph->aNode(e.out) : graph->aNode(e.in)); }
marci@174:     Node head(Edge e) const { 
marci@303:       return ((e.out_or_in) ? graph->bNode(e.out) : graph->bNode(e.in)); }
marci@76: 
marci@174:     Node aNode(OutEdgeIt e) const { 
marci@303:       return ((e.out_or_in) ? graph->aNode(e.out) : graph->aNode(e.in)); }
marci@174:     Node bNode(OutEdgeIt e) const { 
marci@303:       return ((e.out_or_in) ? graph->bNode(e.out) : graph->bNode(e.in)); }
marci@76: 
marci@303:     int nodeNum() const { return graph->nodeNum(); }
marci@263:     //FIXME
marci@303:     //int edgeNum() const { return graph->edgeNum(); }
marci@263: 
marci@263: 
marci@303:     int id(Node v) const { return graph->id(v); }
marci@155: 
marci@303:     bool valid(Node n) const { return graph->valid(n); }
marci@174:     bool valid(Edge e) const { 
marci@303:       return e.out_or_in ? graph->valid(e.out) : graph->valid(e.in); }
marci@155: 
marci@174:     void augment(const Edge& e, Number a) const {
marci@168:       if (e.out_or_in)  
marci@303: // 	flow->set(e.out, flow->get(e.out)+a);
marci@303: 	flow->set(e.out, (*flow)[e.out]+a);
marci@168:       else  
marci@303: // 	flow->set(e.in, flow->get(e.in)-a);
marci@303: 	flow->set(e.in, (*flow)[e.in]-a);
marci@168:     }
marci@168: 
marci@269:     Number resCap(const Edge& e) const { 
marci@168:       if (e.out_or_in) 
marci@303: //	return (capacity->get(e.out)-flow->get(e.out)); 
marci@303: 	return ((*capacity)[e.out]-(*flow)[e.out]); 
marci@168:       else 
marci@303: //	return (flow->get(e.in)); 
marci@303: 	return ((*flow)[e.in]); 
marci@168:     }
marci@168: 
marci@303:     Number resCap(GraphOutEdgeIt out) const { 
marci@303: //      return (capacity->get(out)-flow->get(out)); 
marci@303:       return ((*capacity)[out]-(*flow)[out]); 
marci@168:     }
marci@168:     
marci@303:     Number resCap(GraphInEdgeIt in) const { 
marci@303: //      return (flow->get(in)); 
marci@303:       return ((*flow)[in]); 
marci@168:     }
marci@168: 
marci@303: //     template<typename T> class NodeMap : public Graph::NodeMap<T> { 
marci@266: //     public:
marci@303: //       NodeMap(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G) 
marci@303: // 	: Graph::NodeMap<T>(_G.gw) { }
marci@303: //       NodeMap(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G, 
marci@303: // 	      T a) : Graph::NodeMap<T>(_G.gw, a) { }
marci@266: //     };
marci@155: 
marci@155: //     template <typename T>
marci@155: //     class NodeMap {
marci@155: //       typename Graph::NodeMap<T> node_map; 
marci@155: //     public:
marci@174: //       NodeMap(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G) : node_map(*(_G.graph)) { }
marci@174: //       NodeMap(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G, T a) : node_map(*(_G.graph), a) { }
marci@174: //       void set(Node nit, T a) { node_map.set(nit, a); }
marci@174: //       T get(Node nit) const { return node_map.get(nit); }
marci@155: //     };
marci@155: 
marci@155:     template <typename T>
marci@155:     class EdgeMap {
marci@303:       typename Graph::EdgeMap<T> forward_map, backward_map; 
marci@155:     public:
marci@303:       EdgeMap(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G) : forward_map(*(_G.graph)), backward_map(*(_G.graph)) { }
marci@303:       EdgeMap(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G, T a) : forward_map(*(_G.graph), a), backward_map(*(_G.graph), a) { }
marci@174:       void set(Edge e, T a) { 
marci@155: 	if (e.out_or_in) 
marci@155: 	  forward_map.set(e.out, a); 
marci@155: 	else 
marci@155: 	  backward_map.set(e.in, a); 
marci@155:       }
marci@303:       T operator[](Edge e) const { 
marci@155: 	if (e.out_or_in) 
marci@303: 	  return forward_map[e.out]; 
marci@155: 	else 
marci@303: 	  return backward_map[e.in]; 
marci@155:       }
marci@303: //       T get(Edge e) const { 
marci@303: // 	if (e.out_or_in) 
marci@303: // 	  return forward_map.get(e.out); 
marci@303: // 	else 
marci@303: // 	  return backward_map.get(e.in); 
marci@303: //       }
marci@155:     };
marci@168:   };
marci@168: 
marci@303:   //ErasingFirstGraphWrapper for blocking flows
marci@303:   template<typename Graph, typename FirstOutEdgesMap>
marci@303:   class ErasingFirstGraphWrapper : public GraphWrapper<Graph> {
marci@269:   protected:
marci@269:     FirstOutEdgesMap* first_out_edges;
marci@269:   public:
marci@303:     ErasingFirstGraphWrapper(Graph& _graph, 
marci@303: 			     FirstOutEdgesMap& _first_out_edges) : 
marci@303:       GraphWrapper<Graph>(_graph), first_out_edges(&_first_out_edges) { }  
marci@269: 
marci@311:     typedef typename Graph::Node Node;
marci@311:     class NodeIt : public Graph::NodeIt { 
marci@311:     public:
marci@311:       NodeIt() { }
marci@311:       NodeIt(const typename Graph::NodeIt& n) : Graph::NodeIt(n) { }
marci@311:       NodeIt(const Invalid& i) : Graph::NodeIt(i) { }
marci@311:       NodeIt(const ErasingFirstGraphWrapper<Graph, FirstOutEdgesMap>& _G) : 
marci@311: 	Graph::NodeIt(*(_G.graph)) { }
marci@311:     };
marci@311:     typedef typename Graph::Edge Edge;
marci@311:     class OutEdgeIt : public Graph::OutEdgeIt { 
marci@311:     public:
marci@311:       OutEdgeIt() { }
marci@311:       OutEdgeIt(const typename Graph::OutEdgeIt& e) : Graph::OutEdgeIt(e) { }
marci@311:       OutEdgeIt(const Invalid& i) : Graph::OutEdgeIt(i) { }
marci@311:       OutEdgeIt(const ErasingFirstGraphWrapper<Graph, FirstOutEdgesMap>& _G, 
marci@311: 		const Node& n) : 
marci@311: 	Graph::OutEdgeIt((*_G.first_out_edges)[n]) { }
marci@311:     };
marci@311:     class InEdgeIt : public Graph::InEdgeIt { 
marci@311:     public:
marci@311:       InEdgeIt() { }
marci@311:       InEdgeIt(const typename Graph::InEdgeIt& e) : Graph::InEdgeIt(e) { }
marci@311:       InEdgeIt(const Invalid& i) : Graph::InEdgeIt(i) { }
marci@311:       InEdgeIt(const ErasingFirstGraphWrapper<Graph, FirstOutEdgesMap>& _G, 
marci@311: 	       const Node& n) : 
marci@311: 	Graph::InEdgeIt(*(_G.graph), n) { }
marci@311:     };
marci@311:     //typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@311:     class EdgeIt : public Graph::EdgeIt { 
marci@311:     public:
marci@311:       EdgeIt() { }
marci@311:       EdgeIt(const typename Graph::EdgeIt& e) : Graph::EdgeIt(e) { }
marci@311:       EdgeIt(const Invalid& i) : Graph::EdgeIt(i) { }
marci@311:       EdgeIt(const ErasingFirstGraphWrapper<Graph, FirstOutEdgesMap>& _G) : 
marci@311: 	Graph::EdgeIt(*(_G.graph)) { }
marci@311:     };
marci@311: 
marci@311:     NodeIt& first(NodeIt& i) const {
marci@311:       i=NodeIt(*this);
marci@269:       return i;
marci@269:     }
marci@311:     OutEdgeIt& first(OutEdgeIt& i, const Node& n) const {
marci@311:       i=OutEdgeIt(*this, n);
marci@311: //      i=(*first_out_edges)[n];
marci@269:       return i;
marci@269:     }
marci@311:     InEdgeIt& first(InEdgeIt& i, const Node& n) const {
marci@311:       i=InEdgeIt(*this, n);
marci@311:       return i;
marci@311:     }
marci@311:     EdgeIt& first(EdgeIt& i) const {
marci@311:       i=EdgeIt(*this);
marci@311:       return i;
marci@311:     }
marci@311: 
marci@311: //     template<typename I> I& first(I& i) const { 
marci@311: //       graph->first(i); 
marci@311: //       return i;
marci@311: //     }
marci@311: //     OutEdgeIt& first(OutEdgeIt& e, const Node& n) const {
marci@311: // //      e=first_out_edges->get(n);
marci@311: //       e=(*first_out_edges)[n];
marci@311: //       return e;
marci@311: //     }
marci@311: //     template<typename I, typename P> I& first(I& i, const P& p) const { 
marci@311: //       graph->first(i, p); 
marci@311: //       return i;
marci@311: //     }
marci@269:     
marci@269:     //template<typename I> I getNext(const I& i) const { 
marci@269:     //  return gw.getNext(i); 
marci@269:     //}
marci@311: 
marci@311: 
marci@311:     NodeIt& next(NodeIt& i) const {
marci@303:       graph->next(i); 
marci@269:       return i;
marci@269:     }
marci@311:     OutEdgeIt& next(OutEdgeIt& i) const {
marci@311:       graph->next(i); 
marci@311:       return i;
marci@311:     }
marci@311:     InEdgeIt& next(InEdgeIt& i) const {
marci@311:       graph->next(i); 
marci@311:       return i;
marci@311:     }
marci@311:     EdgeIt& next(EdgeIt& i) const {
marci@311:       graph->next(i); 
marci@311:       return i;
marci@311:     }
marci@311: 
marci@311: //     template<typename I> I& next(I &i) const { 
marci@311: //       graph->next(i); 
marci@311: //       return i;
marci@311: //     }
marci@269:     
marci@269:     template< typename It > It first() const { 
marci@269:       It e; this->first(e); return e; }
marci@269:     
marci@269:     template< typename It > It first(const Node& v) const { 
marci@269:       It e; this->first(e, v); return e; }
marci@269: 
marci@269:     void erase(const OutEdgeIt& e) const {
marci@269:       OutEdgeIt f=e;
marci@269:       this->next(f);
marci@269:       first_out_edges->set(this->tail(e), f);
marci@269:     }
marci@269:   };
marci@269: 
marci@148: // // FIXME: comparison should be made better!!!
marci@148: //   template<typename Graph, typename T, typename LowerMap, typename FlowMap, typename UpperMap>
marci@148: //   class ResGraphWrapper
marci@148: //   {
marci@148: //     Graph* graph;
marci@76:   
marci@148: //   public:
marci@303: //     typedef Graph ParentGraph;
marci@76: 
marci@174: //     typedef typename Graph::Node Node;
marci@174: //     typedef typename Graph::Edge Edge;
marci@174:   
marci@148: //     typedef typename Graph::NodeIt NodeIt;
marci@76:    
marci@148: //     class OutEdgeIt {
marci@148: //     public:
marci@174: //       //Graph::Node n;
marci@148: //       bool out_or_in;
marci@148: //       typename Graph::OutEdgeIt o;
marci@148: //       typename Graph::InEdgeIt i;   
marci@148: //     };
marci@148: //     class InEdgeIt {
marci@148: //     public:
marci@174: //       //Graph::Node n;
marci@148: //       bool out_or_in;
marci@148: //       typename Graph::OutEdgeIt o;
marci@148: //       typename Graph::InEdgeIt i;   
marci@148: //     };
marci@148: //     typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@174: //     typedef typename Graph::EdgeIt EdgeIt;
marci@76: 
marci@259: //     int nodeNum() const { return gw.nodeNum(); }
marci@259: //     int edgeNum() const { return gw.edgeNum(); }
marci@76: 
marci@259: //     Node& first(Node& n) const { return gw.first(n); }
marci@76: 
marci@174: //     // Edge and SymEdge  is missing!!!!
marci@174: //     // Edge <-> In/OutEdgeIt conversion is missing!!!!
marci@76: 
marci@148: //     //FIXME
marci@212: //     OutEdgeIt& first(OutEdgeIt& e, const Node& n) const 
marci@148: //       {
marci@148: // 	e.n=n;
marci@259: // 	gw.first(e.o,n);
marci@259: // 	while(gw.valid(e.o) && fmap.get(e.o)>=himap.get(e.o))
marci@259: // 	  gw.goNext(e.o);
marci@259: // 	if(!gw.valid(e.o)) {
marci@259: // 	  gw.first(e.i,n);
marci@259: // 	  while(gw.valid(e.i) && fmap.get(e.i)<=lomap.get(e.i))
marci@259: // 	    gw.goNext(e.i);
marci@148: // 	}
marci@148: // 	return e;
marci@148: //       }
marci@148: // /*
marci@148: //   OutEdgeIt &goNext(OutEdgeIt &e)
marci@148: //   {
marci@259: //   if(gw.valid(e.o)) {
marci@259: //   while(gw.valid(e.o) && fmap.get(e.o)>=himap.get(e.o))
marci@259: //   gw.goNext(e.o);
marci@259: //   if(gw.valid(e.o)) return e;
marci@259: //   else gw.first(e.i,e.n);
marci@148: //   }
marci@148: //   else {
marci@259: //   while(gw.valid(e.i) && fmap.get(e.i)<=lomap.get(e.i))
marci@259: //   gw.goNext(e.i);
marci@148: //   return e;
marci@148: //   }
marci@148: //   }
marci@148: //   OutEdgeIt Next(const OutEdgeIt &e) {OutEdgeIt t(e); return goNext(t);}
marci@148: // */
marci@259: //     //bool valid(const OutEdgeIt e) { return gw.valid(e.o)||gw.valid(e.i);}
marci@76: 
marci@148: //     //FIXME
marci@212: //     InEdgeIt& first(InEdgeIt& e, const Node& n) const 
marci@148: //       {
marci@148: // 	e.n=n;
marci@259: // 	gw.first(e.i,n);
marci@259: // 	while(gw.valid(e.i) && fmap.get(e.i)>=himap.get(e.i))
marci@259: // 	  gw.goNext(e.i);
marci@259: // 	if(!gw.valid(e.i)) {
marci@259: // 	  gw.first(e.o,n);
marci@259: // 	  while(gw.valid(e.o) && fmap.get(e.o)<=lomap.get(e.o))
marci@259: // 	    gw.goNext(e.o);
marci@148: // 	}
marci@148: // 	return e;
marci@148: //       }
marci@148: // /*
marci@148: //   InEdgeIt &goNext(InEdgeIt &e)
marci@148: //   {
marci@259: //   if(gw.valid(e.i)) {
marci@259: //   while(gw.valid(e.i) && fmap.get(e.i)>=himap.get(e.i))
marci@259: //   gw.goNext(e.i);
marci@259: //   if(gw.valid(e.i)) return e;
marci@259: //   else gw.first(e.o,e.n);
marci@148: //   }
marci@148: //   else {
marci@259: //   while(gw.valid(e.o) && fmap.get(e.o)<=lomap.get(e.o))
marci@259: //   gw.goNext(e.o);
marci@148: //   return e;
marci@148: //   }
marci@148: //   }
marci@148: //   InEdgeIt Next(const InEdgeIt &e) {InEdgeIt t(e); return goNext(t);}
marci@148: // */
marci@259: //     //bool valid(const InEdgeIt e) { return gw.valid(e.i)||gw.valid(e.o);}
marci@76: 
marci@259: //     //template<typename I> I &goNext(I &i); { return gw.goNext(i); }
marci@259: //     //template<typename I> I next(const I i); { return gw.goNext(i); }
marci@76: 
marci@148: //     template< typename It > It first() const { 
marci@212: //       It e; first(e); return e; }
marci@76: 
marci@174: //     template< typename It > It first(Node v) const { 
marci@212: //       It e; first(e, v); return e; }
marci@76: 
marci@259: //     Node head(const Edge& e) const { return gw.head(e); }
marci@259: //     Node tail(const Edge& e) const { return gw.tail(e); }
marci@76:   
marci@174: //     template<typename I> Node aNode(const I& e) const { 
marci@259: //       return gw.aNode(e); }
marci@174: //     template<typename I> Node bNode(const I& e) const { 
marci@259: //       return gw.bNode(e); }
marci@76:   
marci@148: //     //template<typename I> bool valid(const I i);
marci@259: //     //{ return gw.valid(i); }
marci@76:   
marci@148: //     //template<typename I> void setInvalid(const I &i);
marci@259: //     //{ return gw.setInvalid(i); }
marci@76:   
marci@259: //     Node addNode() { return gw.addNode(); }
marci@174: //     Edge addEdge(const Node& tail, const Node& head) { 
marci@259: //       return gw.addEdge(tail, head); }
marci@76:   
marci@259: //     template<typename I> void erase(const I& i) { gw.erase(i); }
marci@76:   
marci@259: //     void clear() { gw.clear(); }
marci@76:   
marci@148: //     template<typename S> class NodeMap : public Graph::NodeMap<S> { };
marci@148: //     template<typename S> class EdgeMap : public Graph::EdgeMap<S> { };
marci@76:   
marci@148: //     void setGraph(Graph& _graph) { graph = &_graph; }
marci@148: //     Graph& getGraph() { return (*graph); }
marci@76: 
marci@148: //     //ResGraphWrapper() : graph(0) { }
marci@148: //     ResGraphWrapper(Graph& _graph) : graph(&_graph) { }
marci@148: //   };
marci@76: 
alpar@105: } //namespace hugo
marci@76: 
marci@259: #endif //HUGO_GRAPH_WRAPPER_H
marci@76: