marci@174: // -*- c++ -*-
marci@76: #ifndef GRAPH_WRAPPER_H
marci@76: #define GRAPH_WRAPPER_H
marci@76: 
marci@174: #include <invalid.h>
marci@174: 
alpar@105: namespace hugo {
marci@76: 
marci@76:   template<typename Graph>
marci@76:   class TrivGraphWrapper {
marci@76:     Graph* graph;
marci@76:   
marci@76:   public:
marci@76:     typedef Graph BaseGraph;
marci@76: 
marci@174:     typedef typename Graph::Node Node;
marci@76:     typedef typename Graph::NodeIt NodeIt;
marci@76: 
marci@174:     typedef typename Graph::Edge Edge;
marci@76:     typedef typename Graph::OutEdgeIt OutEdgeIt;
marci@76:     typedef typename Graph::InEdgeIt InEdgeIt;
marci@155:     //typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@174:     typedef typename Graph::EdgeIt EdgeIt;
marci@168: 
marci@168:     //TrivGraphWrapper() : graph(0) { }
marci@168:     TrivGraphWrapper(Graph& _graph) : graph(&_graph) { }
marci@168: 
marci@168:     void setGraph(Graph& _graph) { graph = &_graph; }
marci@168:     Graph& getGraph() const { return (*graph); }
marci@76:     
marci@174:     template<typename I> I& /*getF*/first(I& i) const { return graph->/*getF*/first(i); }
marci@174:     template<typename I, typename P> I& /*getF*/first(I& i, const P& p) const { 
marci@174:       return graph->/*getF*/first(i, p); }
marci@155:     
marci@155:     template<typename I> I getNext(const I& i) const { 
marci@155:       return graph->getNext(i); }
marci@155:     template<typename I> I& next(I &i) const { return graph->next(i); }    
marci@76: 
marci@76:     template< typename It > It first() const { 
marci@174:       It e; /*getF*/first(e); return e; }
marci@76: 
marci@174:     template< typename It > It first(const Node& v) const { 
marci@174:       It e; /*getF*/first(e, v); return e; }
marci@76: 
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@155:     template<typename I> bool valid(const I& i) const 
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@155:     int nodeNum() const { return graph->nodeNum(); }
marci@155:     int edgeNum() const { return graph->edgeNum(); }
marci@76:   
marci@174:     template<typename I> Node aNode(const I& e) const { 
marci@76:       return graph->aNode(e); }
marci@174:     template<typename I> Node bNode(const I& e) const { 
marci@76:       return graph->bNode(e); }
marci@76:   
marci@174:     Node addNode() const { return graph->addNode(); }
marci@174:     Edge addEdge(const Node& tail, const Node& head) const { 
marci@76:       return graph->addEdge(tail, head); }
marci@76:   
marci@76:     template<typename I> void erase(const I& i) const { graph->erase(i); }
marci@76:   
marci@76:     void clear() const { graph->clear(); }
marci@155:     
marci@76:     template<typename T> class NodeMap : public Graph::NodeMap<T> { 
marci@76:     public:
marci@155:       NodeMap(const TrivGraphWrapper<Graph>& _G) : 
marci@158: 	Graph::NodeMap<T>(_G.getGraph()) { }
marci@155:       NodeMap(const TrivGraphWrapper<Graph>& _G, T a) : 
marci@158: 	Graph::NodeMap<T>(_G.getGraph(), a) { }
marci@76:     };
marci@168: 
marci@155:     template<typename T> class EdgeMap : public Graph::EdgeMap<T> { 
marci@155:     public:
marci@155:       EdgeMap(const TrivGraphWrapper<Graph>& _G) : 
marci@158: 	Graph::EdgeMap<T>(_G.getGraph()) { }
marci@155:       EdgeMap(const TrivGraphWrapper<Graph>& _G, T a) : 
marci@158: 	Graph::EdgeMap<T>(_G.getGraph(), a) { }
marci@155:     };
marci@76:   };
marci@76: 
marci@76:   template<typename Graph>
marci@76:   class RevGraphWrapper
marci@76:   {
marci@76:     Graph* graph;
marci@76:   
marci@76:   public:
marci@76:     typedef Graph BaseGraph;
marci@76: 
marci@174:     typedef typename Graph::Node Node;    
marci@174:     typedef typename Graph::NodeIt NodeIt;
marci@76:   
marci@174:     typedef typename Graph::Edge Edge;
marci@76:     typedef typename Graph::OutEdgeIt InEdgeIt;
marci@76:     typedef typename Graph::InEdgeIt OutEdgeIt;
marci@155:     //typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@174:     typedef typename Graph::EdgeIt EdgeIt;
marci@168: 
marci@168:     //RevGraphWrapper() : graph(0) { }
marci@168:     RevGraphWrapper(Graph& _graph) : graph(&_graph) { }
marci@168: 
marci@168:     void setGraph(Graph& _graph) { graph = &_graph; }
marci@168:     Graph& getGraph() const { return (*graph); }
marci@76:     
marci@174:     template<typename I> I& /*getF*/first(I& i) const { return graph->/*getF*/first(i); }
marci@174:     template<typename I, typename P> I& /*getF*/first(I& i, const P& p) const { 
marci@174:       return graph->/*getF*/first(i, p); }
marci@155: 
marci@155:     template<typename I> I getNext(const I& i) const { 
marci@155:       return graph->getNext(i); }
marci@155:     template<typename I> I& next(I &i) const { return graph->next(i); }    
marci@76: 
marci@76:     template< typename It > It first() const { 
marci@174:       It e; /*getF*/first(e); return e; }
marci@76: 
marci@174:     template< typename It > It first(const Node& v) const { 
marci@174:       It e; /*getF*/first(e, v); return e; }
marci@76: 
marci@174:     Node head(const Edge& e) const { return graph->tail(e); }
marci@174:     Node tail(const Edge& e) const { return graph->head(e); }
marci@76:   
marci@155:     template<typename I> bool valid(const I& i) const 
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:     template<typename I> Node aNode(const I& e) const { 
marci@76:       return graph->aNode(e); }
marci@174:     template<typename I> Node bNode(const I& e) const { 
marci@76:       return graph->bNode(e); }
marci@155: 
marci@174:     Node addNode() const { return graph->addNode(); }
marci@174:     Edge addEdge(const Node& tail, const Node& head) const { 
marci@76:       return graph->addEdge(tail, head); }
marci@76:   
marci@155:     int nodeNum() const { return graph->nodeNum(); }
marci@155:     int edgeNum() const { return graph->edgeNum(); }
marci@76:   
marci@155:     template<typename I> void erase(const I& i) const { graph->erase(i); }
marci@76:   
marci@155:     void clear() const { graph->clear(); }
marci@155: 
marci@155:     template<typename T> class NodeMap : public Graph::NodeMap<T> { 
marci@155:     public:
marci@155:       NodeMap(const RevGraphWrapper<Graph>& _G) : 
marci@158: 	Graph::NodeMap<T>(_G.getGraph()) { }
marci@155:       NodeMap(const RevGraphWrapper<Graph>& _G, T a) : 
marci@158: 	Graph::NodeMap<T>(_G.getGraph(), a) { }
marci@155:     };
marci@168: 
marci@155:     template<typename T> class EdgeMap : public Graph::EdgeMap<T> { 
marci@155:     public:
marci@155:       EdgeMap(const RevGraphWrapper<Graph>& _G) : 
marci@158: 	Graph::EdgeMap<T>(_G.getGraph()) { }
marci@155:       EdgeMap(const RevGraphWrapper<Graph>& _G, T a) : 
marci@158: 	Graph::EdgeMap<T>(_G.getGraph(), a) { }
marci@155:     };
marci@76:   };
marci@76: 
marci@155: 
marci@158:   template<typename Graph>
marci@158:   class UndirGraphWrapper {
marci@158:     Graph* graph;
marci@158:   
marci@158:   public:
marci@158:     typedef Graph BaseGraph;
marci@158: 
marci@174:     typedef typename Graph::Node Node;
marci@158:     typedef typename Graph::NodeIt NodeIt;
marci@158: 
marci@174:     //typedef typename Graph::Edge Edge;
marci@158:     //typedef typename Graph::OutEdgeIt OutEdgeIt;
marci@158:     //typedef typename Graph::InEdgeIt InEdgeIt;
marci@158:     //typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@174:     //typedef typename Graph::EdgeIt EdgeIt;
marci@158: 
marci@158:     //private:
marci@174:     typedef typename Graph::Edge GraphEdge;
marci@158:     typedef typename Graph::OutEdgeIt GraphOutEdgeIt;
marci@158:     typedef typename Graph::InEdgeIt GraphInEdgeIt;
marci@158:     //public:
marci@158: 
marci@168:     //UndirGraphWrapper() : graph(0) { }
marci@168:     UndirGraphWrapper(Graph& _graph) : graph(&_graph) { }
marci@168: 
marci@168:     void setGraph(Graph& _graph) { graph = &_graph; }
marci@168:     Graph& getGraph() const { return (*graph); }
marci@168:   
marci@174:     class Edge {
marci@158:       friend class UndirGraphWrapper<Graph>;
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@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@158:     };
marci@158: 
marci@174:     class OutEdgeIt : public Edge {
marci@158:       friend class UndirGraphWrapper<Graph>;
marci@158:     public:
marci@174:       OutEdgeIt() : Edge() { }
marci@174:       OutEdgeIt(const Invalid& i) : Edge(i) { }
marci@174:       OutEdgeIt(const UndirGraphWrapper& _G, const Node& n) : Edge() { 
marci@174: 	out_or_in=true;
marci@174: 	_G.graph->/*getF*/first(out, n);
marci@158: 	if (!(_G.graph->valid(out))) {
marci@158: 	  out_or_in=false;
marci@174: 	  _G.graph->/*getF*/first(in, n);
marci@158: 	}
marci@158:       }
marci@158:     };
marci@158: 
marci@174:     OutEdgeIt& /*getF*/first(OutEdgeIt& e, const Node& n) const {
marci@158:       e.out_or_in=true;
marci@174:       graph->/*getF*/first(e.out, n);
marci@158:       if (!(graph->valid(e.out))) {
marci@158: 	e.out_or_in=false;
marci@174: 	graph->/*getF*/first(e.in, n);
marci@158:       }
marci@158:       return e;
marci@158:     }
marci@158: 
marci@158:     OutEdgeIt& next(OutEdgeIt& e) const {
marci@158:       if (e.out_or_in) {
marci@174: 	Node n=graph->tail(e.out);
marci@158: 	graph->next(e.out);
marci@158: 	if (!graph->valid(e.out)) {
marci@158: 	  e.out_or_in=false;
marci@174: 	  graph->/*getF*/first(e.in, n);
marci@158: 	}
marci@158:       } else {
marci@158: 	graph->next(e.in);
marci@158:       }
marci@158:       return e;
marci@158:     }
marci@158: 
marci@174:     Node aNode(const OutEdgeIt& e) const { 
marci@158:       if (e.out_or_in) return graph->tail(e); else return graph->head(e); }
marci@174:     Node bNode(const OutEdgeIt& e) const { 
marci@158:       if (e.out_or_in) return graph->head(e); else return graph->tail(e); }
marci@158: 
marci@158:     typedef OutEdgeIt InEdgeIt; 
marci@158: 
marci@174:     template<typename I> I& /*getF*/first(I& i) const { return graph->/*getF*/first(i); }
marci@174: //     template<typename I, typename P> I& /*getF*/first(I& i, const P& p) const { 
marci@174: //       return graph->/*getF*/first(i, p); }
marci@158:     
marci@158:     template<typename I> I getNext(const I& i) const { 
marci@158:       return graph->getNext(i); }
marci@158:     template<typename I> I& next(I &i) const { return graph->next(i); }    
marci@158: 
marci@158:     template< typename It > It first() const { 
marci@174:       It e; /*getF*/first(e); return e; }
marci@158: 
marci@174:     template< typename It > It first(const Node& v) const { 
marci@174:       It e; /*getF*/first(e, v); return e; }
marci@158: 
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@158: 
marci@158:     template<typename I> bool valid(const I& i) const 
marci@158:       { return graph->valid(i); }
marci@158:   
marci@158:     //template<typename I> void setInvalid(const I &i);
marci@158:     //{ return graph->setInvalid(i); }
marci@158: 
marci@158:     int nodeNum() const { return graph->nodeNum(); }
marci@158:     int edgeNum() const { return graph->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@158:   
marci@174:     Node addNode() const { return graph->addNode(); }
marci@174:     Edge addEdge(const Node& tail, const Node& head) const { 
marci@158:       return graph->addEdge(tail, head); }
marci@158:   
marci@158:     template<typename I> void erase(const I& i) const { graph->erase(i); }
marci@158:   
marci@158:     void clear() const { graph->clear(); }
marci@158:     
marci@158:     template<typename T> class NodeMap : public Graph::NodeMap<T> { 
marci@158:     public:
marci@158:       NodeMap(const UndirGraphWrapper<Graph>& _G) : 
marci@158: 	Graph::NodeMap<T>(_G.getGraph()) { }
marci@158:       NodeMap(const UndirGraphWrapper<Graph>& _G, T a) : 
marci@158: 	Graph::NodeMap<T>(_G.getGraph(), a) { }
marci@158:     };
marci@168: 
marci@158:     template<typename T> class EdgeMap : public Graph::EdgeMap<T> { 
marci@158:     public:
marci@158:       EdgeMap(const UndirGraphWrapper<Graph>& _G) : 
marci@158: 	Graph::EdgeMap<T>(_G.getGraph()) { }
marci@158:       EdgeMap(const UndirGraphWrapper<Graph>& _G, T a) : 
marci@158: 	Graph::EdgeMap<T>(_G.getGraph(), a) { }
marci@158:     };
marci@158:   };
marci@158: 
marci@158: 
marci@158: 
marci@155: //   template<typename Graph>
marci@155: //   class SymGraphWrapper
marci@155: //   {
marci@155: //     Graph* graph;
marci@76:   
marci@155: //   public:
marci@155: //     typedef Graph BaseGraph;
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@174: //     template<typename I> I& /*getF*/first(I& i) const { return graph->/*getF*/first(i); }
marci@174: //     template<typename I, typename P> I& /*getF*/first(I& i, const P& p) const { 
marci@174: //       return graph->/*getF*/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@174: //       It e; /*getF*/first(e); return e; }
marci@155: 
marci@174: //     template< typename It > It first(Node v) const { 
marci@174: //       It e; /*getF*/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@155:   template<typename Graph, typename Number, typename FlowMap, typename CapacityMap>
marci@155:   class ResGraphWrapper {
marci@76:   public:
marci@76:     typedef Graph BaseGraph;
marci@174:     typedef typename Graph::Node Node;
marci@155:     typedef typename Graph::NodeIt NodeIt;
marci@155:   private:
marci@155:     typedef typename Graph::OutEdgeIt OldOutEdgeIt;
marci@155:     typedef typename Graph::InEdgeIt OldInEdgeIt;
marci@174:     const Graph* graph;
marci@155:     FlowMap* flow;
marci@155:     const CapacityMap* capacity;
marci@155:   public:
marci@168: 
marci@155:     ResGraphWrapper(const Graph& _G, FlowMap& _flow, 
marci@155: 	     const CapacityMap& _capacity) : 
marci@174:       graph(&_G), flow(&_flow), capacity(&_capacity) { }
marci@168: 
marci@168:     void setGraph(const Graph& _graph) { graph = &_graph; }
marci@174:     const Graph& getGraph() const { return (*graph); }
marci@168: 
marci@174:     class Edge; 
marci@155:     class OutEdgeIt; 
marci@174:     friend class Edge; 
marci@155:     friend class OutEdgeIt; 
marci@76: 
marci@174:     class Edge {
marci@155:       friend class ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>;
marci@155:     protected:
marci@168:       bool out_or_in; //true, iff out
marci@155:       OldOutEdgeIt out;
marci@155:       OldInEdgeIt 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@155:     };
marci@155: 
marci@155: 
marci@174:     class OutEdgeIt : public Edge {
marci@155:       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@155:     private:
marci@174:       OutEdgeIt(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& resG, Node v) : Edge() { 
marci@174: 	resG.graph->/*getF*/first(out, v);
marci@174: 	while( resG.graph->valid(out) && !(resG.free(out)>0) ) { resG.graph->next(out); }
marci@174: 	if (!resG.graph->valid(out)) {
marci@155: 	  out_or_in=0;
marci@174: 	  resG.graph->/*getF*/first(in, v);
marci@174: 	  while( resG.graph->valid(in) && !(resG.free(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@174: // 	  while( out.valid() && !(Edge::free()>0) ) { ++out; }
marci@168: // 	  if (!out.valid()) {
marci@168: // 	    out_or_in=0;
marci@174: // 	    G->/*getF*/first(in, v); 
marci@174: // 	    while( in.valid() && !(Edge::free()>0) ) { ++in; }
marci@168: // 	  }
marci@168: // 	} else {
marci@168: // 	  ++in;
marci@174: // 	  while( in.valid() && !(Edge::free()>0) ) { ++in; } 
marci@168: // 	}
marci@168: // 	return *this; 
marci@168: //       }
marci@155:     };
marci@155: 
marci@174:     class EdgeIt : public Edge {
marci@155:       friend class ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>;
marci@174:       typename Graph::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@174:       EdgeIt(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& resG) : Edge() { 
marci@174: 	resG.graph->/*getF*/first(v);
marci@174: 	if (resG.graph->valid(v)) resG.graph->/*getF*/first(out, v); else out=OldOutEdgeIt(INVALID);
marci@174: 	while (resG.graph->valid(out) && !(resG.free(out)>0) ) { resG.graph->next(out); }
marci@174: 	while (resG.graph->valid(v) && !resG.graph->valid(out)) { 
marci@174: 	  resG.graph->next(v); 
marci@174: 	  if (resG.graph->valid(v)) resG.graph->/*getF*/first(out, v); 
marci@174: 	  while (resG.graph->valid(out) && !(resG.free(out)>0) ) { resG.graph->next(out); }
marci@155: 	}
marci@174: 	if (!resG.graph->valid(out)) {
marci@155: 	  out_or_in=0;
marci@174: 	  resG.graph->/*getF*/first(v);
marci@174: 	  if (resG.graph->valid(v)) resG.graph->/*getF*/first(in, v); else in=OldInEdgeIt(INVALID);
marci@174: 	  while (resG.graph->valid(in) && !(resG.free(in)>0) ) { resG.graph->next(in); }
marci@174: 	  while (resG.graph->valid(v) && !resG.graph->valid(in)) { 
marci@174: 	    resG.graph->next(v); 
marci@174: 	    if (resG.graph->valid(v)) resG.graph->/*getF*/first(in, v); 
marci@174: 	    while (resG.graph->valid(in) && !(resG.free(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@174: // 	  while (out.valid() && !(Edge::free()>0) ) { ++out; }
marci@168: // 	  while (v.valid() && !out.valid()) { 
marci@168: // 	    ++v; 
marci@174: // 	    if (v.valid()) G->/*getF*/first(out, v); 
marci@174: // 	    while (out.valid() && !(Edge::free()>0) ) { ++out; }
marci@168: // 	  }
marci@168: // 	  if (!out.valid()) {
marci@168: // 	    out_or_in=0;
marci@174: // 	    G->/*getF*/first(v);
marci@174: // 	    if (v.valid()) G->/*getF*/first(in, v); else in=OldInEdgeIt();
marci@174: // 	    while (in.valid() && !(Edge::free()>0) ) { ++in; }
marci@168: // 	    while (v.valid() && !in.valid()) { 
marci@168: // 	      ++v; 
marci@174: // 	      if (v.valid()) G->/*getF*/first(in, v); 
marci@174: // 	      while (in.valid() && !(Edge::free()>0) ) { ++in; }
marci@168: // 	    }  
marci@168: // 	  }
marci@168: // 	} else {
marci@168: // 	  ++in;
marci@174: // 	  while (in.valid() && !(Edge::free()>0) ) { ++in; }
marci@168: // 	  while (v.valid() && !in.valid()) { 
marci@168: // 	    ++v; 
marci@174: // 	    if (v.valid()) G->/*getF*/first(in, v); 
marci@174: // 	    while (in.valid() && !(Edge::free()>0) ) { ++in; }
marci@168: // 	  }
marci@168: // 	}
marci@168: // 	return *this;
marci@168: //       }
marci@155:     };
marci@155: 
marci@174:     NodeIt& /*getF*/first(NodeIt& v) const { return graph->/*getF*/first(v); }
marci@174:     OutEdgeIt& /*getF*/first(OutEdgeIt& e, Node v) const { 
marci@168:       e=OutEdgeIt(*this, v); 
marci@174:       return e;
marci@155:     }
marci@174:     EdgeIt& /*getF*/first(EdgeIt& e) const { 
marci@174:       e=EdgeIt(*this); 
marci@174:       return e;
marci@155:     }
marci@155:    
marci@174:     NodeIt& next(NodeIt& n) const { return graph->next(n); }
marci@155: 
marci@155:     OutEdgeIt& next(OutEdgeIt& e) const { 
marci@155:       if (e.out_or_in) {
marci@174: 	Node v=graph->aNode(e.out);
marci@174: 	graph->next(e.out);
marci@174: 	while( graph->valid(e.out) && !(free(e.out)>0) ) { graph->next(e.out); }
marci@174: 	if (!graph->valid(e.out)) {
marci@155: 	  e.out_or_in=0;
marci@174: 	  graph->/*getF*/first(e.in, v); 
marci@174: 	  while( graph->valid(e.in) && !(free(e.in)>0) ) { graph->next(e.in); }
marci@155: 	}
marci@155:       } else {
marci@174: 	graph->next(e.in);
marci@174: 	while( graph->valid(e.in) && !(free(e.in)>0) ) { graph->next(e.in); } 
marci@155:       }
marci@155:       return e;
marci@155:     }
marci@155: 
marci@174:     EdgeIt& next(EdgeIt& e) const { 
marci@155:       if (e.out_or_in) {
marci@174: 	graph->next(e.out);
marci@174: 	while (graph->valid(e.out) && !(free(e.out)>0) ) { graph->next(e.out); }
marci@174: 	  while (graph->valid(e.v) && !graph->valid(e.out)) { 
marci@174: 	    graph->next(e.v); 
marci@174: 	    if (graph->valid(e.v)) graph->/*getF*/first(e.out, e.v); 
marci@174: 	    while (graph->valid(e.out) && !(free(e.out)>0) ) { graph->next(e.out); }
marci@155: 	  }
marci@174: 	  if (!graph->valid(e.out)) {
marci@155: 	    e.out_or_in=0;
marci@174: 	    graph->/*getF*/first(e.v);
marci@174: 	    if (graph->valid(e.v)) graph->/*getF*/first(e.in, e.v); else e.in=OldInEdgeIt(INVALID);
marci@174: 	    while (graph->valid(e.in) && !(free(e.in)>0) ) { graph->next(e.in); }
marci@174: 	    while (graph->valid(e.v) && !graph->valid(e.in)) { 
marci@174: 	      graph->next(e.v); 
marci@174: 	      if (graph->valid(e.v)) graph->/*getF*/first(e.in, e.v); 
marci@174: 	      while (graph->valid(e.in) && !(free(e.in)>0) ) { graph->next(e.in); }
marci@155: 	    }  
marci@155: 	  }
marci@155: 	} else {
marci@174: 	  graph->next(e.in);
marci@174: 	  while (graph->valid(e.in) && !(free(e.in)>0) ) { graph->next(e.in); }
marci@174: 	  while (graph->valid(e.v) && !graph->valid(e.in)) { 
marci@174: 	    graph->next(e.v); 
marci@174: 	    if (graph->valid(e.v)) graph->/*getF*/first(e.in, e.v); 
marci@174: 	    while (graph->valid(e.in) && !(free(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@174:       /*getF*/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@174:       /*getF*/first(e, v);
marci@155:       return e; 
marci@155:     }
marci@76: 
marci@174:     Node tail(Edge e) const { 
marci@174:       return ((e.out_or_in) ? graph->aNode(e.out) : graph->aNode(e.in)); }
marci@174:     Node head(Edge e) const { 
marci@174:       return ((e.out_or_in) ? graph->bNode(e.out) : graph->bNode(e.in)); }
marci@76: 
marci@174:     Node aNode(OutEdgeIt e) const { 
marci@174:       return ((e.out_or_in) ? graph->aNode(e.out) : graph->aNode(e.in)); }
marci@174:     Node bNode(OutEdgeIt e) const { 
marci@174:       return ((e.out_or_in) ? graph->bNode(e.out) : graph->bNode(e.in)); }
marci@76: 
marci@174:     int id(Node v) const { return graph->id(v); }
marci@155: 
marci@174:     bool valid(Node n) const { return graph->valid(n); }
marci@174:     bool valid(Edge e) const { 
marci@174:       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@168: 	flow->set(e.out, flow->get(e.out)+a);
marci@168:       else  
marci@168: 	flow->set(e.in, flow->get(e.in)-a);
marci@168:     }
marci@168: 
marci@174:     Number free(const Edge& e) const { 
marci@168:       if (e.out_or_in) 
marci@168: 	return (capacity->get(e.out)-flow->get(e.out)); 
marci@168:       else 
marci@168: 	return (flow->get(e.in)); 
marci@168:     }
marci@168: 
marci@168:     Number free(OldOutEdgeIt out) const { 
marci@168:       return (capacity->get(out)-flow->get(out)); 
marci@168:     }
marci@168:     
marci@168:     Number free(OldInEdgeIt in) const { 
marci@168:       return (flow->get(in)); 
marci@168:     }
marci@168: 
marci@155:     template<typename T> class NodeMap : public Graph::NodeMap<T> { 
marci@155:     public:
marci@155:       NodeMap(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G) 
marci@158: 	: Graph::NodeMap<T>(_G.getGraph()) { }
marci@155:       NodeMap(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G, 
marci@158: 	      T a) : Graph::NodeMap<T>(_G.getGraph(), a) { }
marci@155:     };
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@155:       typename Graph::EdgeMap<T> forward_map, backward_map; 
marci@155:     public:
marci@158:       EdgeMap(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G) : forward_map(_G.getGraph()), backward_map(_G.getGraph()) { }
marci@158:       EdgeMap(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G, T a) : forward_map(_G.getGraph(), a), backward_map(_G.getGraph(), 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@174:       T get(Edge e) { 
marci@155: 	if (e.out_or_in) 
marci@155: 	  return forward_map.get(e.out); 
marci@155: 	else 
marci@155: 	  return backward_map.get(e.in); 
marci@155:       }
marci@155:     };
marci@168:   };
marci@168: 
marci@168:   template<typename Graph, typename Number, typename FlowMap, typename CapacityMap>
marci@168:   class ErasingResGraphWrapper : public ResGraphWrapper<Graph, Number, FlowMap, CapacityMap> {
marci@168:   protected:
marci@168:     ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::OutEdgeIt> first_out_edges;
marci@168:     //ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<int> dist;
marci@168:   public:
marci@168:     ErasingResGraphWrapper(const Graph& _G, FlowMap& _flow, 
marci@168: 			   const CapacityMap& _capacity) : 
marci@168:       ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>(_G, _flow, _capacity), 
marci@168:       first_out_edges(*this) /*, dist(*this)*/ { 
marci@174:       for(NodeIt n=this->template first<NodeIt>(); this->valid(n); this->next(n)) {
marci@168: 	OutEdgeIt e;
marci@174: 	ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::/*getF*/first(e, n);
marci@168: 	first_out_edges.set(n, e);
marci@168:       }
marci@168:     }
marci@168: 
marci@168:     //void setGraph(Graph& _graph) { graph = &_graph; }
marci@168:     //Graph& getGraph() const { return (*graph); }
marci@168:   
marci@168:     //TrivGraphWrapper() : graph(0) { }
marci@168:     //ErasingResGraphWrapper(Graph& _graph) : graph(&_graph) { }
marci@168: 
marci@168:     //typedef Graph BaseGraph;
marci@168: 
marci@174:     //typedef typename Graph::Node Node;
marci@168:     //typedef typename Graph::NodeIt NodeIt;
marci@168: 
marci@174:     //typedef typename Graph::Edge Edge;
marci@168:     //typedef typename Graph::OutEdgeIt OutEdgeIt;
marci@168:     //typedef typename Graph::InEdgeIt InEdgeIt;
marci@168:     //typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@174:     //typedef typename Graph::EdgeIt EdgeIt;
marci@168: 
marci@174:     typedef typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::Node Node;
marci@168:     typedef typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeIt NodeIt;
marci@168: 
marci@174:     typedef typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::Edge Edge;
marci@168:     typedef typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::OutEdgeIt OutEdgeIt;
marci@168:     //typedef typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::InEdgeIt InEdgeIt;
marci@168:     //typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@174:     //typedef typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeIt EdgeIt;
marci@168: 
marci@174:     NodeIt& /*getF*/first(NodeIt& n) const { 
marci@174:       return ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::/*getF*/first(n);
marci@168:     }
marci@168: 
marci@174:     OutEdgeIt& /*getF*/first(OutEdgeIt& e, const Node& n) const { 
marci@168:       e=first_out_edges.get(n);
marci@168:       return e;
marci@168:     }
marci@168:     
marci@174:     //ROSSZ template<typename I> I& /*getF*/first(I& i) const { return /*getF*/first(i); }
marci@174:     //ROSSZ template<typename I, typename P> I& /*getF*/first(I& i, const P& p) const { 
marci@174:     //  return /*getF*/first(i, p); }
marci@168:     
marci@168:     //template<typename I> I getNext(const I& i) const { 
marci@168:     //  return graph->getNext(i); }
marci@168:     //template<typename I> I& next(I &i) const { return graph->next(i); }    
marci@168: 
marci@168:     template< typename It > It first() const { 
marci@174:       It e; /*getF*/first(e); return e; }
marci@168: 
marci@174:     template< typename It > It first(const Node& v) const { 
marci@174:       It e; /*getF*/first(e, v); return e; }
marci@168: 
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@168: 
marci@168:     //template<typename I> bool valid(const I& i) const 
marci@168:     //  { return graph->valid(i); }
marci@168:   
marci@168:     //int nodeNum() const { return graph->nodeNum(); }
marci@168:     //int edgeNum() const { return graph->edgeNum(); }
marci@168:   
marci@174:     //template<typename I> Node aNode(const I& e) const { 
marci@168:     //  return graph->aNode(e); }
marci@174:     //template<typename I> Node bNode(const I& e) const { 
marci@168:     //  return graph->bNode(e); }
marci@168:   
marci@174:     //Node addNode() const { return graph->addNode(); }
marci@174:     //Edge addEdge(const Node& tail, const Node& head) const { 
marci@168:     //  return graph->addEdge(tail, head); }
marci@168:   
marci@168:     //void erase(const OutEdgeIt& e) {
marci@168:     //  first_out_edge(this->tail(e))=e;
marci@168:     //}
marci@174:     void erase(const Edge& e) {
marci@168:       OutEdgeIt f(e);
marci@168:       next(f);
marci@168:       first_out_edges.set(this->tail(e), f);
marci@168:     }
marci@168:     //template<typename I> void erase(const I& i) const { graph->erase(i); }
marci@168:   
marci@168:     //void clear() const { graph->clear(); }
marci@168:     
marci@168:     template<typename T> class NodeMap : public ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<T> { 
marci@168:     public:
marci@168:       NodeMap(const ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G) : 
marci@168: 	ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<T>(_G /*_G.getGraph()*/) { }
marci@168:       NodeMap(const ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G, T a) : 
marci@168: 	ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<T>(_G /*_G.getGraph()*/, a) { }
marci@168:     };
marci@168: 
marci@168:     template<typename T> class EdgeMap : public ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeMap<T> { 
marci@168:     public:
marci@168:       EdgeMap(const ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G) : 
marci@168: 	ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeMap<T>(_G /*_G.getGraph()*/) { }
marci@168:       EdgeMap(const ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G, T a) : 
marci@168: 	ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeMap<T>(_G /*_G.getGraph()*/, a) { }
marci@168:     };
marci@168:   };
marci@168: 
marci@168:   template<typename GraphWrapper> 
marci@168:   class FilterGraphWrapper {
marci@168:   };
marci@168: 
marci@168:   template<typename Graph, typename Number, typename FlowMap, typename CapacityMap>
marci@168:   class FilterGraphWrapper<ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> > : public ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> {
marci@168: 
marci@168:     //Graph* graph;
marci@168:   
marci@168:   public:
marci@168:     //typedef Graph BaseGraph;
marci@168: 
marci@174:     typedef typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::Node Node;
marci@168:     typedef typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeIt NodeIt;
marci@168: 
marci@174:     typedef typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::Edge Edge;
marci@168:     typedef typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::OutEdgeIt OutEdgeIt;
marci@168:     //typedef typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::InEdgeIt InEdgeIt;
marci@168:     //typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@174:     typedef typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeIt EdgeIt;
marci@168: 
marci@168:     //FilterGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::OutEdgeIt> first_out_edges;
marci@168:     
marci@168:   public:
marci@168:     FilterGraphWrapper(const Graph& _G, FlowMap& _flow, 
marci@168: 			   const CapacityMap& _capacity) : 
marci@168:       ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>(_G, _flow, _capacity), dist(*this) { 
marci@168:     }
marci@168: 
marci@174:     OutEdgeIt& /*getF*/first(OutEdgeIt& e, const Node& n) const {
marci@174:       ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::/*getF*/first(e, n);
marci@168:       while (valid(e) && (dist.get(tail(e))+1!=dist.get(head(e)))) 
marci@168: 	ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::next(e);
marci@168:       return e;
marci@168:     }
marci@168: 
marci@174:     NodeIt& next(NodeIt& e) const {
marci@168:       return ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::next(e);
marci@168:     }
marci@168: 
marci@168:     OutEdgeIt& next(OutEdgeIt& e) const {
marci@168:       ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::next(e);
marci@168:       while (valid(e) && (dist.get(tail(e))+1!=dist.get(head(e)))) 
marci@168: 	ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::next(e);
marci@168:       return e;
marci@168:     }
marci@168: 
marci@174:     NodeIt& /*getF*/first(NodeIt& n) const {
marci@174:       return ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::/*getF*/first(n);
marci@168:     }
marci@168: 
marci@174:     void erase(const Edge& e) {
marci@168:       OutEdgeIt f(e);
marci@168:       ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::next(f);
marci@168:       while (valid(f) && (dist.get(tail(f))+1!=dist.get(head(f)))) 
marci@168: 	ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::next(f);
marci@168:       first_out_edges.set(this->tail(e), f);
marci@168:     }
marci@168: 
marci@168:     //TrivGraphWrapper() : graph(0) { }
marci@168:     //TrivGraphWrapper(Graph& _graph) : graph(&_graph) { }
marci@168: 
marci@168:     //void setGraph(Graph& _graph) { graph = &_graph; }
marci@168:     //Graph& getGraph() const { return (*graph); }
marci@168:     
marci@174:     //template<typename I> I& /*getF*/first(I& i) const { return graph->/*getF*/first(i); }
marci@174:     //template<typename I, typename P> I& /*getF*/first(I& i, const P& p) const { 
marci@174:     //  return graph->/*getF*/first(i, p); }
marci@168:     
marci@168:     //template<typename I> I getNext(const I& i) const { 
marci@168:     //  return graph->getNext(i); }
marci@168:     //template<typename I> I& next(I &i) const { return graph->next(i); }    
marci@168: 
marci@168:     template< typename It > It first() const { 
marci@174:       It e; /*getF*/first(e); return e; }
marci@168: 
marci@174:     template< typename It > It first(const Node& v) const { 
marci@174:       It e; /*getF*/first(e, v); return e; }
marci@168: 
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@168: 
marci@168:     //template<typename I> bool valid(const I& i) const 
marci@168:     //  { return graph->valid(i); }
marci@168:   
marci@168:     //template<typename I> void setInvalid(const I &i);
marci@168:     //{ return graph->setInvalid(i); }
marci@168: 
marci@168:     //int nodeNum() const { return graph->nodeNum(); }
marci@168:     //int edgeNum() const { return graph->edgeNum(); }
marci@168:   
marci@174:     //template<typename I> Node aNode(const I& e) const { 
marci@168:     //  return graph->aNode(e); }
marci@174:     //template<typename I> Node bNode(const I& e) const { 
marci@168:     //  return graph->bNode(e); }
marci@168:   
marci@174:     //Node addNode() const { return graph->addNode(); }
marci@174:     //Edge addEdge(const Node& tail, const Node& head) const { 
marci@168:     //  return graph->addEdge(tail, head); }
marci@168:   
marci@168:     //template<typename I> void erase(const I& i) const { graph->erase(i); }
marci@168:   
marci@168:     //void clear() const { graph->clear(); }
marci@168:     
marci@168:     template<typename T> class NodeMap : public ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<T> { 
marci@168:     public:
marci@168:       NodeMap(const FilterGraphWrapper<ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> >& _G) : 
marci@168: 	ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<T>(_G /*_G.getGraph()*/) { }
marci@168:       NodeMap(const FilterGraphWrapper<ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> >& _G, T a) : 
marci@168: 	ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<T>(_G /*_G.getGraph()*/, a) { }
marci@168:     };
marci@168: 
marci@168:     template<typename T> class EdgeMap : public ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeMap<T> { 
marci@168:     public:
marci@168:       EdgeMap(const FilterGraphWrapper<ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> >& _G) : 
marci@168: 	ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeMap<T>(_G /*_G.getGraph()*/) { }
marci@168:       EdgeMap(const FilterGraphWrapper<ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> >& _G, T a) : 
marci@168: 	ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeMap<T>(_G /*_G.getGraph()*/, a) { }
marci@168:     };
marci@168: 
marci@168:   public:
marci@168:     ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<int> dist;
marci@155: 
marci@76:   };
marci@76: 
marci@76: 
marci@148: 
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@148: //     typedef Graph BaseGraph;
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@148: //     int nodeNum() const { return graph->nodeNum(); }
marci@148: //     int edgeNum() const { return graph->edgeNum(); }
marci@76: 
marci@174: //     Node& /*getF*/first(Node& n) const { return graph->/*getF*/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@174: //     OutEdgeIt& /*getF*/first(OutEdgeIt& e, const Node& n) const 
marci@148: //       {
marci@148: // 	e.n=n;
marci@174: // 	graph->/*getF*/first(e.o,n);
marci@148: // 	while(graph->valid(e.o) && fmap.get(e.o)>=himap.get(e.o))
marci@148: // 	  graph->goNext(e.o);
marci@148: // 	if(!graph->valid(e.o)) {
marci@174: // 	  graph->/*getF*/first(e.i,n);
marci@148: // 	  while(graph->valid(e.i) && fmap.get(e.i)<=lomap.get(e.i))
marci@148: // 	    graph->goNext(e.i);
marci@148: // 	}
marci@148: // 	return e;
marci@148: //       }
marci@148: // /*
marci@148: //   OutEdgeIt &goNext(OutEdgeIt &e)
marci@148: //   {
marci@148: //   if(graph->valid(e.o)) {
marci@148: //   while(graph->valid(e.o) && fmap.get(e.o)>=himap.get(e.o))
marci@148: //   graph->goNext(e.o);
marci@148: //   if(graph->valid(e.o)) return e;
marci@174: //   else graph->/*getF*/first(e.i,e.n);
marci@148: //   }
marci@148: //   else {
marci@148: //   while(graph->valid(e.i) && fmap.get(e.i)<=lomap.get(e.i))
marci@148: //   graph->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@148: //     //bool valid(const OutEdgeIt e) { return graph->valid(e.o)||graph->valid(e.i);}
marci@76: 
marci@148: //     //FIXME
marci@174: //     InEdgeIt& /*getF*/first(InEdgeIt& e, const Node& n) const 
marci@148: //       {
marci@148: // 	e.n=n;
marci@174: // 	graph->/*getF*/first(e.i,n);
marci@148: // 	while(graph->valid(e.i) && fmap.get(e.i)>=himap.get(e.i))
marci@148: // 	  graph->goNext(e.i);
marci@148: // 	if(!graph->valid(e.i)) {
marci@174: // 	  graph->/*getF*/first(e.o,n);
marci@148: // 	  while(graph->valid(e.o) && fmap.get(e.o)<=lomap.get(e.o))
marci@148: // 	    graph->goNext(e.o);
marci@148: // 	}
marci@148: // 	return e;
marci@148: //       }
marci@148: // /*
marci@148: //   InEdgeIt &goNext(InEdgeIt &e)
marci@148: //   {
marci@148: //   if(graph->valid(e.i)) {
marci@148: //   while(graph->valid(e.i) && fmap.get(e.i)>=himap.get(e.i))
marci@148: //   graph->goNext(e.i);
marci@148: //   if(graph->valid(e.i)) return e;
marci@174: //   else graph->/*getF*/first(e.o,e.n);
marci@148: //   }
marci@148: //   else {
marci@148: //   while(graph->valid(e.o) && fmap.get(e.o)<=lomap.get(e.o))
marci@148: //   graph->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@148: //     //bool valid(const InEdgeIt e) { return graph->valid(e.i)||graph->valid(e.o);}
marci@76: 
marci@148: //     //template<typename I> I &goNext(I &i); { return graph->goNext(i); }
marci@148: //     //template<typename I> I next(const I i); { return graph->goNext(i); }
marci@76: 
marci@148: //     template< typename It > It first() const { 
marci@174: //       It e; /*getF*/first(e); return e; }
marci@76: 
marci@174: //     template< typename It > It first(Node v) const { 
marci@174: //       It e; /*getF*/first(e, v); return e; }
marci@76: 
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@76:   
marci@174: //     template<typename I> Node aNode(const I& e) const { 
marci@148: //       return graph->aNode(e); }
marci@174: //     template<typename I> Node bNode(const I& e) const { 
marci@148: //       return graph->bNode(e); }
marci@76:   
marci@148: //     //template<typename I> bool valid(const I i);
marci@148: //     //{ return graph->valid(i); }
marci@76:   
marci@148: //     //template<typename I> void setInvalid(const I &i);
marci@148: //     //{ return graph->setInvalid(i); }
marci@76:   
marci@174: //     Node addNode() { return graph->addNode(); }
marci@174: //     Edge addEdge(const Node& tail, const Node& head) { 
marci@148: //       return graph->addEdge(tail, head); }
marci@76:   
marci@148: //     template<typename I> void erase(const I& i) { graph->erase(i); }
marci@76:   
marci@148: //     void clear() { graph->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@76: #endif //GRAPH_WRAPPER_H
marci@76: