lemon-0.x: src/hugo/graph_wrapper.h@9632ea8be6ca

     1 // -*- c++ -*-

     2 #ifndef HUGO_GRAPH_WRAPPER_H

     3 #define HUGO_GRAPH_WRAPPER_H

     5 ///\ingroup gwrappers

     6 ///\file

     7 ///\brief Several graph wrappers.

     8 ///

     9 ///This file contains several useful graph wrapper functions.

    10 ///

    11 ///\author Marton Makai

    13 #include <hugo/invalid.h>

    14 //#include <iter_map.h>

    16 namespace hugo {

    18   // Graph wrappers

    20   /// \addtogroup gwrappers

    21   /// A main parts of HUGOlib are the different graph structures,

    22   /// generic graph algorithms, graph concepts which couple these, and

    23   /// graph wrappers. While the previous ones are more or less clear, the

    24   /// latter notion needs further explanation.

    25   /// Graph wrappers are graph classes which serve for considering graph

    26   /// structures in different ways. A short example makes the notion much

    27   /// clearer.

    28   /// Suppose that we have an instance \c g of a directed graph

    29   /// type say \c ListGraph and an algorithm

    30   /// \code template<typename Graph> int algorithm(const Graph&); \endcode

    31   /// is needed to run on the reversely oriented graph.

    32   /// It may be expensive (in time or in memory usage) to copy

    33   /// \c g with the reverse orientation.

    34   /// Thus, a wrapper class

    35   /// \code template<typename Graph> class RevGraphWrapper; \endcode is used.

    36   /// The code looks as follows

    37   /// \code

    38   /// ListGraph g;

    39   /// RevGraphWrapper<ListGraph> rgw(g);

    40   /// int result=algorithm(rgw);

    41   /// \endcode

    42   /// After running the algorithm, the original graph \c g

    43   /// remains untouched. Thus the graph wrapper used above is to consider the

    44   /// original graph with reverse orientation.

    45   /// This techniques gives rise to an elegant code, and

    46   /// based on stable graph wrappers, complex algorithms can be

    47   /// implemented easily.

    48   /// In flow, circulation and bipartite matching problems, the residual

    49   /// graph is of particular importance. Combining a wrapper implementing

    50   /// this, shortest path algorithms and minimum mean cycle algorithms,

    51   /// a range of weighted and cardinality optimization algorithms can be

    52   /// obtained. For lack of space, for other examples,

    53   /// the interested user is referred to the detailed documentation of graph

    54   /// wrappers.

    55   /// The behavior of graph wrappers can be very different. Some of them keep

    56   /// capabilities of the original graph while in other cases this would be

    57   /// meaningless. This means that the concepts that they are a model of depend

    58   /// on the graph wrapper, and the wrapped graph(s).

    59   /// If an edge of \c rgw is deleted, this is carried out by

    60   /// deleting the corresponding edge of \c g. But for a residual

    61   /// graph, this operation has no sense.

    62   /// Let we stand one more example here to simplify your work.

    63   /// wrapper class

    64   /// \code template<typename Graph> class RevGraphWrapper; \endcode

    65   /// has constructor

    66   /// <tt> RevGraphWrapper(Graph& _g)</tt>.

    67   /// This means that in a situation,

    68   /// when a <tt> const ListGraph& </tt> reference to a graph is given,

    69   /// then it have to be instantiated with <tt>Graph=const ListGraph</tt>.

    70   /// \code

    71   /// int algorithm1(const ListGraph& g) {

    72   ///   RevGraphWrapper<const ListGraph> rgw(g);

    73   ///   return algorithm2(rgw);

    74   /// }

    75   /// \endcode

    77   /// \addtogroup gwrappers

    78   /// @{

    80   ///Base type for the Graph Wrappers

    82   ///This is the base type for the Graph Wrappers.

    83   ///\todo Some more docs...

    84   ///

    85   ///\author Marton Makai

    87   template<typename Graph>

    88   class GraphWrapper {

    89   protected:

    90     Graph* graph;

    91     GraphWrapper() : graph(0) { }

    92     void setGraph(Graph& _graph) { graph=&_graph; }

    94   public:

    95     typedef Graph BaseGraph;

    96     typedef Graph ParentGraph;

    98     GraphWrapper(Graph& _graph) : graph(&_graph) { }

    99 //     Graph& getGraph() const { return *graph; }

   101 //    typedef typename Graph::Node Node;

   102     class Node : public Graph::Node {

   103       friend class GraphWrapper<Graph>;

   104     public:

   105       Node() { }

   106       Node(const typename Graph::Node& _n) : Graph::Node(_n) { }

   107       Node(const Invalid& i) : Graph::Node(i) { }

   108     };

   109     class NodeIt {

   110       friend class GraphWrapper<Graph>;

   111       typename Graph::NodeIt n;

   112      public:

   113       NodeIt() { }

   114       NodeIt(const typename Graph::NodeIt& _n) : n(_n) { }

   115       NodeIt(const Invalid& i) : n(i) { }

   116       NodeIt(const GraphWrapper<Graph>& _G) : n(*(_G.graph)) { }

   117       operator Node() const { return Node(typename Graph::Node(n)); }

   118     };

   119 //    typedef typename Graph::Edge Edge;

   120     class Edge : public Graph::Edge {

   121       friend class GraphWrapper<Graph>;

   122     public:

   123       Edge() { }

   124       Edge(const typename Graph::Edge& _e) : Graph::Edge(_e) { }

   125       Edge(const Invalid& i) : Graph::Edge(i) { }

   126     };

   127     class OutEdgeIt {

   128       friend class GraphWrapper<Graph>;

   129       typename Graph::OutEdgeIt e;

   130     public:

   131       OutEdgeIt() { }

   132       OutEdgeIt(const typename Graph::OutEdgeIt& _e) : e(_e) { }

   133       OutEdgeIt(const Invalid& i) : e(i) { }

   134       OutEdgeIt(const GraphWrapper<Graph>& _G, const Node& _n) :

   135 	e(*(_G.graph), typename Graph::Node(_n)) { }

   136       operator Edge() const { return Edge(typename Graph::Edge(e)); }

   137     };

   138     class InEdgeIt {

   139       friend class GraphWrapper<Graph>;

   140       typename Graph::InEdgeIt e;

   141     public:

   142       InEdgeIt() { }

   143       InEdgeIt(const typename Graph::InEdgeIt& _e) : e(_e) { }

   144       InEdgeIt(const Invalid& i) : e(i) { }

   145       InEdgeIt(const GraphWrapper<Graph>& _G, const Node& _n) :

   146 	e(*(_G.graph), typename Graph::Node(_n)) { }

   147       operator Edge() const { return Edge(typename Graph::Edge(e)); }

   148     };

   149     //typedef typename Graph::SymEdgeIt SymEdgeIt;

   150     class EdgeIt {

   151       friend class GraphWrapper<Graph>;

   152       typename Graph::EdgeIt e;

   153     public:

   154       EdgeIt() { }

   155       EdgeIt(const typename Graph::EdgeIt& _e) : e(_e) { }

   156       EdgeIt(const Invalid& i) : e(i) { }

   157       EdgeIt(const GraphWrapper<Graph>& _G) : e(*(_G.graph)) { }

   158       operator Edge() const { return Edge(typename Graph::Edge(e)); }

   159     };

   161     NodeIt& first(NodeIt& i) const {

   162       i=NodeIt(*this); return i;

   163     }

   164     OutEdgeIt& first(OutEdgeIt& i, const Node& p) const {

   165       i=OutEdgeIt(*this, p); return i;

   166     }

   167     InEdgeIt& first(InEdgeIt& i, const Node& p) const {

   168       i=InEdgeIt(*this, p); return i;

   169     }

   170     EdgeIt& first(EdgeIt& i) const {

   171       i=EdgeIt(*this); return i;

   172     }

   174     NodeIt& next(NodeIt& i) const { graph->next(i.n); return i; }

   175     OutEdgeIt& next(OutEdgeIt& i) const { graph->next(i.e); return i; }

   176     InEdgeIt& next(InEdgeIt& i) const { graph->next(i.e); return i; }

   177     EdgeIt& next(EdgeIt& i) const { graph->next(i.e); return i; }

   179     Node tail(const Edge& e) const {

   180       return Node(graph->tail(static_cast<typename Graph::Edge>(e))); }

   181     Node head(const Edge& e) const {

   182       return Node(graph->head(static_cast<typename Graph::Edge>(e))); }

   184     bool valid(const Node& n) const {

   185       return graph->valid(static_cast<typename Graph::Node>(n)); }

   186     bool valid(const Edge& e) const {

   187       return graph->valid(static_cast<typename Graph::Edge>(e)); }

   189     int nodeNum() const { return graph->nodeNum(); }

   190     int edgeNum() const { return graph->edgeNum(); }

   192     Node aNode(const OutEdgeIt& e) const { return Node(graph->aNode(e.e)); }

   193     Node aNode(const InEdgeIt& e) const { return Node(graph->aNode(e.e)); }

   194     Node bNode(const OutEdgeIt& e) const { return Node(graph->bNode(e.e)); }

   195     Node bNode(const InEdgeIt& e) const { return Node(graph->bNode(e.e)); }

   197     Node addNode() const { return Node(graph->addNode()); }

   198     Edge addEdge(const Node& tail, const Node& head) const {

   199       return Edge(graph->addEdge(tail, head)); }

   201     void erase(const Node& i) const { graph->erase(i); }

   202     void erase(const Edge& i) const { graph->erase(i); }

   204     void clear() const { graph->clear(); }

   206     template<typename T> class NodeMap : public Graph::template NodeMap<T> {

   207       typedef typename Graph::template NodeMap<T> Parent;

   208     public:

   209       NodeMap(const GraphWrapper<Graph>& _G) :  Parent(*(_G.graph)) { }

   210       NodeMap(const GraphWrapper<Graph>& _G, T a) : Parent(*(_G.graph), a) { }

   211     };

   213     template<typename T> class EdgeMap : public Graph::template EdgeMap<T> {

   214       typedef typename Graph::template EdgeMap<T> Parent;

   215     public:

   216       EdgeMap(const GraphWrapper<Graph>& _G) : Parent(*(_G.graph)) { }

   217       EdgeMap(const GraphWrapper<Graph>& _G, T a) : Parent(*(_G.graph), a) { }

   218     };

   219   };

   223   /// A graph wrapper which reverses the orientation of the edges.

   225   /// A graph wrapper which reverses the orientation of the edges.

   226   ///

   227   ///\author Marton Makai

   228   template<typename Graph>

   229   class RevGraphWrapper : public GraphWrapper<Graph> {

   230   protected:

   231     RevGraphWrapper() : GraphWrapper<Graph>(0) { }

   232   public:

   233     RevGraphWrapper(Graph& _graph) : GraphWrapper<Graph>(_graph) { }

   235     typedef typename GraphWrapper<Graph>::Node Node;

   236     typedef typename GraphWrapper<Graph>::Edge Edge;

   237     //If Graph::OutEdgeIt is not defined

   238     //and we do not want to use RevGraphWrapper::InEdgeIt,

   239     //the typdef techinque does not work.

   240     //Unfortunately all the typedefs are instantiated in templates.

   241     //typedef typename GraphWrapper<Graph>::OutEdgeIt InEdgeIt;

   242     //typedef typename GraphWrapper<Graph>::InEdgeIt OutEdgeIt;

   244     class OutEdgeIt {

   245       friend class GraphWrapper<Graph>;

   246       friend class RevGraphWrapper<Graph>;

   247       typename Graph::InEdgeIt e;

   248     public:

   249       OutEdgeIt() { }

   250       OutEdgeIt(const typename Graph::InEdgeIt& _e) : e(_e) { }

   251       OutEdgeIt(const Invalid& i) : e(i) { }

   252       OutEdgeIt(const RevGraphWrapper<Graph>& _G, const Node& _n) :

   253 	e(*(_G.graph), typename Graph::Node(_n)) { }

   254       operator Edge() const { return Edge(typename Graph::Edge(e)); }

   255     };

   256     class InEdgeIt {

   257       friend class GraphWrapper<Graph>;

   258       friend class RevGraphWrapper<Graph>;

   259       typename Graph::OutEdgeIt e;

   260     public:

   261       InEdgeIt() { }

   262       InEdgeIt(const typename Graph::OutEdgeIt& _e) : e(_e) { }

   263       InEdgeIt(const Invalid& i) : e(i) { }

   264       InEdgeIt(const RevGraphWrapper<Graph>& _G, const Node& _n) :

   265 	e(*(_G.graph), typename Graph::Node(_n)) { }

   266       operator Edge() const { return Edge(typename Graph::Edge(e)); }

   267     };

   269     using GraphWrapper<Graph>::first;

   270     OutEdgeIt& first(OutEdgeIt& i, const Node& p) const {

   271       i=OutEdgeIt(*this, p); return i;

   272     }

   273     InEdgeIt& first(InEdgeIt& i, const Node& p) const {

   274       i=InEdgeIt(*this, p); return i;

   275     }

   277     using GraphWrapper<Graph>::next;

   278     OutEdgeIt& next(OutEdgeIt& i) const { this->graph->next(i.e); return i; }

   279     InEdgeIt& next(InEdgeIt& i) const { this->graph->next(i.e); return i; }

   281     Node aNode(const OutEdgeIt& e) const {

   282       return Node(this->graph->aNode(e.e)); }

   283     Node aNode(const InEdgeIt& e) const {

   284       return Node(this->graph->aNode(e.e)); }

   285     Node bNode(const OutEdgeIt& e) const {

   286       return Node(this->graph->bNode(e.e)); }

   287     Node bNode(const InEdgeIt& e) const {

   288       return Node(this->graph->bNode(e.e)); }

   290     Node tail(const Edge& e) const {

   291       return GraphWrapper<Graph>::head(e); }

   292     Node head(const Edge& e) const {

   293       return GraphWrapper<Graph>::tail(e); }

   295   };

   299   /// Wrapper for hiding nodes and edges from a graph.

   301   /// This wrapper shows a graph with filtered node-set and

   302   /// edge-set. The quick brown fox iterator jumps over

   303   /// the lazy dog nodes or edges if the values for them are false

   304   /// in the bool maps.

   305   ///

   306   ///\author Marton Makai

   307   template<typename Graph, typename NodeFilterMap,

   308 	   typename EdgeFilterMap>

   309   class SubGraphWrapper : public GraphWrapper<Graph> {

   310   protected:

   311     NodeFilterMap* node_filter_map;

   312     EdgeFilterMap* edge_filter_map;

   314     SubGraphWrapper() : GraphWrapper<Graph>(0),

   315 			node_filter_map(0), edge_filter_map(0) { }

   316     void setNodeFilterMap(NodeFilterMap& _node_filter_map) {

   317       node_filter_map=&_node_filter_map;

   318     }

   319     void setEdgeFilterMap(EdgeFilterMap& _edge_filter_map) {

   320       edge_filter_map=&_edge_filter_map;

   321     }

   323   public:

   325     SubGraphWrapper(Graph& _graph, NodeFilterMap& _node_filter_map,

   326 		    EdgeFilterMap& _edge_filter_map) :

   327       GraphWrapper<Graph>(_graph), node_filter_map(&_node_filter_map),

   328       edge_filter_map(&_edge_filter_map) { }

   330     typedef typename GraphWrapper<Graph>::Node Node;

   331     class NodeIt {

   332       friend class GraphWrapper<Graph>;

   333       friend class SubGraphWrapper<Graph, NodeFilterMap, EdgeFilterMap>;

   334       typename Graph::NodeIt n;

   335      public:

   336       NodeIt() { }

   337       NodeIt(const typename Graph::NodeIt& _n) : n(_n) { }

   338       NodeIt(const Invalid& i) : n(i) { }

   339       NodeIt(const SubGraphWrapper<Graph, NodeFilterMap, EdgeFilterMap>& _G) :

   340 	n(*(_G.graph)) {

   341 	while (_G.graph->valid(n) && !(*(_G.node_filter_map))[n])

   342 	  _G.graph->next(n);

   343       }

   344       operator Node() const { return Node(typename Graph::Node(n)); }

   345     };

   346     typedef typename GraphWrapper<Graph>::Edge Edge;

   347     class OutEdgeIt {

   348       friend class GraphWrapper<Graph>;

   349       friend class SubGraphWrapper<Graph, NodeFilterMap, EdgeFilterMap>;

   350       typename Graph::OutEdgeIt e;

   351     public:

   352       OutEdgeIt() { }

   353       OutEdgeIt(const typename Graph::OutEdgeIt& _e) : e(_e) { }

   354       OutEdgeIt(const Invalid& i) : e(i) { }

   355       OutEdgeIt(const SubGraphWrapper<Graph, NodeFilterMap, EdgeFilterMap>& _G,

   356 		const Node& _n) :

   357 	e(*(_G.graph), typename Graph::Node(_n)) {

   358       	while (_G.graph->valid(e) && !(*(_G.edge_filter_map))[e])

   359 	  _G.graph->next(e);

   360       }

   361       operator Edge() const { return Edge(typename Graph::Edge(e)); }

   362     };

   363     class InEdgeIt {

   364       friend class GraphWrapper<Graph>;

   365       friend class SubGraphWrapper<Graph, NodeFilterMap, EdgeFilterMap>;

   366       typename Graph::InEdgeIt e;

   367     public:

   368       InEdgeIt() { }

   369       InEdgeIt(const typename Graph::InEdgeIt& _e) : e(_e) { }

   370       InEdgeIt(const Invalid& i) : e(i) { }

   371       InEdgeIt(const SubGraphWrapper<Graph, NodeFilterMap, EdgeFilterMap>& _G,

   372 	       const Node& _n) :

   373 	e(*(_G.graph), typename Graph::Node(_n)) {

   374       	while (_G.graph->valid(e) && !(*(_G.edge_filter_map))[e])

   375 	  _G.graph->next(e);

   376       }

   377       operator Edge() const { return Edge(typename Graph::Edge(e)); }

   378     };

   379     //typedef typename Graph::SymEdgeIt SymEdgeIt;

   380     class EdgeIt {

   381       friend class GraphWrapper<Graph>;

   382       friend class SubGraphWrapper<Graph, NodeFilterMap, EdgeFilterMap>;

   383       typename Graph::EdgeIt e;

   384     public:

   385       EdgeIt() { }

   386       EdgeIt(const typename Graph::EdgeIt& _e) : e(_e) { }

   387       EdgeIt(const Invalid& i) : e(i) { }

   388       EdgeIt(const SubGraphWrapper<Graph, NodeFilterMap, EdgeFilterMap>& _G) :

   389 	e(*(_G.graph)) {

   390       	while (_G.graph->valid(e) && !(*(_G.edge_filter_map))[e])

   391 	  _G.graph->next(e);

   392       }

   393       operator Edge() const { return Edge(typename Graph::Edge(e)); }

   394     };

   396     NodeIt& first(NodeIt& i) const {

   397       i=NodeIt(*this); return i;

   398     }

   399     OutEdgeIt& first(OutEdgeIt& i, const Node& p) const {

   400       i=OutEdgeIt(*this, p); return i;

   401     }

   402     InEdgeIt& first(InEdgeIt& i, const Node& p) const {

   403       i=InEdgeIt(*this, p); return i;

   404     }

   405     EdgeIt& first(EdgeIt& i) const {

   406       i=EdgeIt(*this); return i;

   407     }

   409     NodeIt& next(NodeIt& i) const {

   410       this->graph->next(i.n);

   411       while (this->graph->valid(i) && !(*node_filter_map)[i.n]) {

   412 	this->graph->next(i.n); }

   413       return i;

   414     }

   415     OutEdgeIt& next(OutEdgeIt& i) const {

   416       this->graph->next(i.e);

   417       while (this->graph->valid(i) && !(*edge_filter_map)[i.e]) {

   418 	this->graph->next(i.e); }

   419       return i;

   420     }

   421     InEdgeIt& next(InEdgeIt& i) const {

   422       this->graph->next(i.e);

   423       while (this->graph->valid(i) && !(*edge_filter_map)[i.e]) {

   424 	this->graph->next(i.e); }

   425       return i;

   426     }

   427     EdgeIt& next(EdgeIt& i) const {

   428       this->graph->next(i.e);

   429       while (this->graph->valid(i) && !(*edge_filter_map)[i.e]) {

   430 	this->graph->next(i.e); }

   431       return i;

   432     }

   434     Node aNode(const OutEdgeIt& e) const {

   435       return Node(this->graph->aNode(e.e)); }

   436     Node aNode(const InEdgeIt& e) const {

   437       return Node(this->graph->aNode(e.e)); }

   438     Node bNode(const OutEdgeIt& e) const {

   439       return Node(this->graph->bNode(e.e)); }

   440     Node bNode(const InEdgeIt& e) const {

   441       return Node(this->graph->bNode(e.e)); }

   443     /// This function hides \c n in the graph, i.e. the iteration

   444     /// jumps over it. This is done by simply setting the value of \c n

   445     /// to be false in the corresponding node-map.

   446     void hide(const Node& n) const { node_filter_map->set(n, false); }

   448     /// This function hides \c e in the graph, i.e. the iteration

   449     /// jumps over it. This is done by simply setting the value of \c e

   450     /// to be false in the corresponding edge-map.

   451     void hide(const Edge& e) const { edge_filter_map->set(e, false); }

   453     /// The value of \c n is set to be true in the node-map which stores

   454     /// hide information. If \c n was hidden previuosly, then it is shown

   455     /// again

   456      void unHide(const Node& n) const { node_filter_map->set(n, true); }

   458     /// The value of \c e is set to be true in the edge-map which stores

   459     /// hide information. If \c e was hidden previuosly, then it is shown

   460     /// again

   461     void unHide(const Edge& e) const { edge_filter_map->set(e, true); }

   463     /// Returns true if \c n is hidden.

   464     bool hidden(const Node& n) const { return !(*node_filter_map)[n]; }

   466     /// Returns true if \c n is hidden.

   467     bool hidden(const Edge& e) const { return !(*edge_filter_map)[e]; }

   468   };

   472   /// A wrapper for forgetting the orientation of a graph.

   474   /// A wrapper for getting an undirected graph by forgetting

   475   /// the orientation of a directed one.

   476   template<typename Graph>

   477   class UndirGraphWrapper : public GraphWrapper<Graph> {

   478   protected:

   479     UndirGraphWrapper() : GraphWrapper<Graph>() { }

   481   public:

   482     typedef typename GraphWrapper<Graph>::Node Node;

   483     typedef typename GraphWrapper<Graph>::NodeIt NodeIt;

   484     typedef typename GraphWrapper<Graph>::Edge Edge;

   485     typedef typename GraphWrapper<Graph>::EdgeIt EdgeIt;

   487     UndirGraphWrapper(Graph& _graph) : GraphWrapper<Graph>(_graph) { }

   489     class OutEdgeIt {

   490       friend class UndirGraphWrapper<Graph>;

   491       bool out_or_in; //true iff out

   492       typename Graph::OutEdgeIt out;

   493       typename Graph::InEdgeIt in;

   494     public:

   495       OutEdgeIt() { }

   496       OutEdgeIt(const Invalid& i) : Edge(i) { }

   497       OutEdgeIt(const UndirGraphWrapper<Graph>& _G, const Node& _n) {

   498 	out_or_in=true; _G.graph->first(out, _n);

   499 	if (!(_G.graph->valid(out))) { out_or_in=false; _G.graph->first(in, _n);	}

   500       }

   501       operator Edge() const {

   502 	if (out_or_in) return Edge(out); else return Edge(in);

   503       }

   504     };

   506 //FIXME InEdgeIt

   507     typedef OutEdgeIt InEdgeIt;

   509     using GraphWrapper<Graph>::first;

   510 //     NodeIt& first(NodeIt& i) const {

   511 //       i=NodeIt(*this); return i;

   512 //     }

   513     OutEdgeIt& first(OutEdgeIt& i, const Node& p) const {

   514       i=OutEdgeIt(*this, p); return i;

   515     }

   516 //FIXME

   517 //     InEdgeIt& first(InEdgeIt& i, const Node& p) const {

   518 //       i=InEdgeIt(*this, p); return i;

   519 //     }

   520 //     EdgeIt& first(EdgeIt& i) const {

   521 //       i=EdgeIt(*this); return i;

   522 //     }

   524     using GraphWrapper<Graph>::next;

   525 //     NodeIt& next(NodeIt& n) const {

   526 //       GraphWrapper<Graph>::next(n);

   527 //       return n;

   528 //     }

   529     OutEdgeIt& next(OutEdgeIt& e) const {

   530       if (e.out_or_in) {

   531 	typename Graph::Node n=this->graph->tail(e.out);

   532 	this->graph->next(e.out);

   533 	if (!this->graph->valid(e.out)) {

   534 	  e.out_or_in=false; this->graph->first(e.in, n); }

   535       } else {

   536 	this->graph->next(e.in);

   537       }

   538       return e;

   539     }

   540     //FIXME InEdgeIt

   541 //     EdgeIt& next(EdgeIt& e) const {

   542 //       GraphWrapper<Graph>::next(n);

   543 // //      graph->next(e.e);

   544 //       return e;

   545 //     }

   547     Node aNode(const OutEdgeIt& e) const {

   548       if (e.out_or_in) return this->graph->tail(e); else

   549 	return this->graph->head(e); }

   550     Node bNode(const OutEdgeIt& e) const {

   551       if (e.out_or_in) return this->graph->head(e); else

   552 	return this->graph->tail(e); }

   553   };

   557   /// An undirected graph template

   558   template<typename Graph>

   559   class UndirGraph : public UndirGraphWrapper<Graph> {

   560     typedef UndirGraphWrapper<Graph> Parent;

   561   protected:

   562     Graph gr;

   563   public:

   564     UndirGraph() : UndirGraphWrapper<Graph>() {

   565       Parent::setGraph(gr);

   566     }

   567   };

   571   /// A wrapper for composing bidirected graph from a directed one.

   572   /// experimental, for fezso's sake.

   573   template<typename Graph>

   574   class BidirGraphWrapper : public GraphWrapper<Graph> {

   575   protected:

   576     //const CapacityMap* capacity;

   577     //FlowMap* flow;

   579     BidirGraphWrapper() : GraphWrapper<Graph>()/*,

   580 						 capacity(0), flow(0)*/ { }

   581 //     void setCapacityMap(const CapacityMap& _capacity) {

   582 //       capacity=&_capacity;

   583 //     }

   584 //     void setFlowMap(FlowMap& _flow) {

   585 //       flow=&_flow;

   586 //     }

   588   public:

   590     BidirGraphWrapper(Graph& _graph/*, const CapacityMap& _capacity,

   591 				     FlowMap& _flow*/) :

   592       GraphWrapper<Graph>(_graph)/*, capacity(&_capacity), flow(&_flow)*/ { }

   594     class Edge;

   595     class OutEdgeIt;

   596     friend class Edge;

   597     friend class OutEdgeIt;

   599     typedef typename GraphWrapper<Graph>::Node Node;

   600     typedef typename GraphWrapper<Graph>::NodeIt NodeIt;

   601     class Edge : public Graph::Edge {

   602       friend class BidirGraphWrapper<Graph>;

   603     protected:

   604       bool backward; //true, iff backward

   605 //      typename Graph::Edge e;

   606     public:

   607       Edge() { }

   608       Edge(const typename Graph::Edge& _e, bool _backward) :

   609 	Graph::Edge(_e), backward(_backward) { }

   610       Edge(const Invalid& i) : Graph::Edge(i), backward(true) { }

   611 //the unique invalid iterator

   612       friend bool operator==(const Edge& u, const Edge& v) {

   613 	return (v.backward==u.backward &&

   614 		static_cast<typename Graph::Edge>(u)==

   615 		static_cast<typename Graph::Edge>(v));

   616       }

   617       friend bool operator!=(const Edge& u, const Edge& v) {

   618 	return (v.backward!=u.backward ||

   619 		static_cast<typename Graph::Edge>(u)!=

   620 		static_cast<typename Graph::Edge>(v));

   621       }

   622     };

   624     class OutEdgeIt {

   625       friend class BidirGraphWrapper<Graph>;

   626     protected:

   627       typename Graph::OutEdgeIt out;

   628       typename Graph::InEdgeIt in;

   629       bool backward;

   630     public:

   631       OutEdgeIt() { }

   632       //FIXME

   633 //      OutEdgeIt(const Edge& e) : Edge(e) { }

   634       OutEdgeIt(const Invalid& i) : out(i), in(i), backward(true) { }

   635 //the unique invalid iterator

   636       OutEdgeIt(const BidirGraphWrapper<Graph>& _G, Node v) {

   637 	backward=false;

   638 	_G.graph->first(out, v);

   639 	while(_G.graph->valid(out) && !_G.enabled(*this)) { _G.graph->next(out); }

   640 	if (!_G.graph->valid(out)) {

   641 	  backward=true;

   642 	  _G.graph->first(in, v);

   643 	  while(_G.graph->valid(in) && !_G.enabled(*this)) { _G.graph->next(in); }

   644 	}

   645       }

   646       operator Edge() const {

   647 //	Edge e;

   648 //	e.forward=this->forward;

   649 //	if (this->forward) e=out; else e=in;

   650 //	return e;

   651 	if (this->backward)

   652 	  return Edge(in, this->backward);

   653 	else

   654 	  return Edge(out, this->backward);

   655       }

   656     };

   658     class InEdgeIt {

   659       friend class BidirGraphWrapper<Graph>;

   660     protected:

   661       typename Graph::OutEdgeIt out;

   662       typename Graph::InEdgeIt in;

   663       bool backward;

   664     public:

   665       InEdgeIt() { }

   666       //FIXME

   667 //      OutEdgeIt(const Edge& e) : Edge(e) { }

   668       InEdgeIt(const Invalid& i) : out(i), in(i), backward(true) { }

   669 //the unique invalid iterator

   670       InEdgeIt(const BidirGraphWrapper<Graph>& _G, Node v) {

   671 	backward=false;

   672 	_G.graph->first(in, v);

   673 	while(_G.graph->valid(in) && !_G.enabled(*this)) { _G.graph->next(in); }

   674 	if (!_G.graph->valid(in)) {

   675 	  backward=true;

   676 	  _G.graph->first(out, v);

   677 	  while(_G.graph->valid(out) && !_G.enabled(*this)) { _G.graph->next(out); }

   678 	}

   679       }

   680       operator Edge() const {

   681 //	Edge e;

   682 //	e.forward=this->forward;

   683 //	if (this->forward) e=out; else e=in;

   684 //	return e;

   685 	if (this->backward)

   686 	  return Edge(out, this->backward);

   687 	else

   688 	  return Edge(in, this->backward);

   689       }

   690     };

   692     class EdgeIt {

   693       friend class BidirGraphWrapper<Graph>;

   694     protected:

   695       typename Graph::EdgeIt e;

   696       bool backward;

   697     public:

   698       EdgeIt() { }

   699       EdgeIt(const Invalid& i) : e(i), backward(true) { }

   700       EdgeIt(const BidirGraphWrapper<Graph>& _G) {

   701 	backward=false;

   702 	_G.graph->first(e);

   703 	while (_G.graph->valid(e) && !_G.enabled(*this)) _G.graph->next(e);

   704 	if (!_G.graph->valid(e)) {

   705 	  backward=true;

   706 	  _G.graph->first(e);

   707 	  while (_G.graph->valid(e) && !_G.enabled(*this)) _G.graph->next(e);

   708 	}

   709       }

   710       operator Edge() const {

   711 	return Edge(e, this->backward);

   712       }

   713     };

   715     using GraphWrapper<Graph>::first;

   716 //     NodeIt& first(NodeIt& i) const {

   717 //       i=NodeIt(*this); return i;

   718 //     }

   719     OutEdgeIt& first(OutEdgeIt& i, const Node& p) const {

   720       i=OutEdgeIt(*this, p); return i;

   721     }

   722 //    FIXME not tested

   723     InEdgeIt& first(InEdgeIt& i, const Node& p) const {

   724       i=InEdgeIt(*this, p); return i;

   725     }

   726     EdgeIt& first(EdgeIt& i) const {

   727       i=EdgeIt(*this); return i;

   728     }

   730     using GraphWrapper<Graph>::next;

   731 //    NodeIt& next(NodeIt& n) const { GraphWrapper<Graph>::next(n); return n; }

   732     OutEdgeIt& next(OutEdgeIt& e) const {

   733       if (!e.backward) {

   734 	Node v=this->graph->aNode(e.out);

   735 	this->graph->next(e.out);

   736 	while(this->graph->valid(e.out) && !enabled(e)) {

   737 	  this->graph->next(e.out); }

   738 	if (!this->graph->valid(e.out)) {

   739 	  e.backward=true;

   740 	  this->graph->first(e.in, v);

   741 	  while(this->graph->valid(e.in) && !enabled(e)) {

   742 	    this->graph->next(e.in); }

   743 	}

   744       } else {

   745 	this->graph->next(e.in);

   746 	while(this->graph->valid(e.in) && !enabled(e)) {

   747 	  this->graph->next(e.in); }

   748       }

   749       return e;

   750     }

   751 //     FIXME Not tested

   752     InEdgeIt& next(InEdgeIt& e) const {

   753       if (!e.backward) {

   754 	Node v=this->graph->aNode(e.in);

   755 	this->graph->next(e.in);

   756 	while(this->graph->valid(e.in) && !enabled(e)) {

   757 	  this->graph->next(e.in); }

   758 	if (!this->graph->valid(e.in)) {

   759 	  e.backward=true;

   760 	  this->graph->first(e.out, v);

   761 	  while(this->graph->valid(e.out) && !enabled(e)) {

   762 	    this->graph->next(e.out); }

   763 	}

   764       } else {

   765 	this->graph->next(e.out);

   766 	while(this->graph->valid(e.out) && !enabled(e)) {

   767 	  this->graph->next(e.out); }

   768       }

   769       return e;

   770     }

   771     EdgeIt& next(EdgeIt& e) const {

   772       if (!e.backward) {

   773 	this->graph->next(e.e);

   774 	while(this->graph->valid(e.e) && !enabled(e)) {

   775 	  this->graph->next(e.e); }

   776 	if (!this->graph->valid(e.e)) {

   777 	  e.backward=true;

   778 	  this->graph->first(e.e);

   779 	  while(this->graph->valid(e.e) && !enabled(e)) {

   780 	    this->graph->next(e.e); }

   781 	}

   782       } else {

   783 	this->graph->next(e.e);

   784 	while(this->graph->valid(e.e) && !enabled(e)) {

   785 	  this->graph->next(e.e); }

   786       }

   787       return e;

   788     }

   790     Node tail(Edge e) const {

   791       return ((!e.backward) ? this->graph->tail(e) : this->graph->head(e)); }

   792     Node head(Edge e) const {

   793       return ((!e.backward) ? this->graph->head(e) : this->graph->tail(e)); }

   795     Node aNode(OutEdgeIt e) const {

   796       return ((!e.backward) ? this->graph->aNode(e.out) :

   797 	      this->graph->aNode(e.in)); }

   798     Node bNode(OutEdgeIt e) const {

   799       return ((!e.backward) ? this->graph->bNode(e.out) :

   800 	      this->graph->bNode(e.in)); }

   802     Node aNode(InEdgeIt e) const {

   803       return ((!e.backward) ? this->graph->aNode(e.in) :

   804 	      this->graph->aNode(e.out)); }

   805     Node bNode(InEdgeIt e) const {

   806       return ((!e.backward) ? this->graph->bNode(e.in) :

   807 	      this->graph->bNode(e.out)); }

   809 //    int nodeNum() const { return graph->nodeNum(); }

   810     //FIXME

   811     void edgeNum() const { }

   812     //int edgeNum() const { return graph->edgeNum(); }

   815 //    int id(Node v) const { return graph->id(v); }

   817     bool valid(Node n) const { return GraphWrapper<Graph>::valid(n); }

   818     bool valid(Edge e) const {

   819       return this->graph->valid(e);

   820 	//return e.forward ? graph->valid(e.out) : graph->valid(e.in);

   821     }

   823     bool forward(const Edge& e) const { return !e.backward; }

   824     bool backward(const Edge& e) const { return e.backward; }

   826 //     void augment(const Edge& e, Number a) const {

   827 //       if (!e.backward)

   828 // // 	flow->set(e.out, flow->get(e.out)+a);

   829 // 	flow->set(e, (*flow)[e]+a);

   830 //       else

   831 // // 	flow->set(e.in, flow->get(e.in)-a);

   832 // 	flow->set(e, (*flow)[e]-a);

   833 //     }

   835     bool enabled(const Edge& e) const {

   836       if (!e.backward)

   837 //	return (capacity->get(e.out)-flow->get(e.out));

   838 	//return ((*capacity)[e]-(*flow)[e]);

   839 	return true;

   840       else

   841 //	return (flow->get(e.in));

   842 	//return ((*flow)[e]);

   843 	return true;

   844     }

   846 //     Number enabled(typename Graph::OutEdgeIt out) const {

   847 // //      return (capacity->get(out)-flow->get(out));

   848 //       return ((*capacity)[out]-(*flow)[out]);

   849 //     }

   851 //     Number enabled(typename Graph::InEdgeIt in) const {

   852 // //      return (flow->get(in));

   853 //       return ((*flow)[in]);

   854 //     }

   856     template <typename T>

   857     class EdgeMap {

   858       typename Graph::template EdgeMap<T> forward_map, backward_map;

   859     public:

   860       EdgeMap(const BidirGraphWrapper<Graph>& _G) : forward_map(*(_G.graph)), backward_map(*(_G.graph)) { }

   861       EdgeMap(const BidirGraphWrapper<Graph>& _G, T a) : forward_map(*(_G.graph), a), backward_map(*(_G.graph), a) { }

   862       void set(Edge e, T a) {

   863 	if (!e.backward)

   864 	  forward_map.set(e.out, a);

   865 	else

   866 	  backward_map.set(e.in, a);

   867       }

   868       T operator[](Edge e) const {

   869 	if (!e.backward)

   870 	  return forward_map[e.out];

   871 	else

   872 	  return backward_map[e.in];

   873       }

   874 //       T get(Edge e) const {

   875 // 	if (e.out_or_in)

   876 // 	  return forward_map.get(e.out);

   877 // 	else

   878 // 	  return backward_map.get(e.in);

   879 //       }

   880     };

   881   };

   885   /// A wrapper for composing the residual graph for directed flow and circulation problems.

   887   /// A wrapper for composing the residual graph for directed flow and circulation problems.

   888   template<typename Graph, typename Number,

   889 	   typename CapacityMap, typename FlowMap>

   890   class ResGraphWrapper : public GraphWrapper<Graph> {

   891   protected:

   892     const CapacityMap* capacity;

   893     FlowMap* flow;

   895     ResGraphWrapper() : GraphWrapper<Graph>(0),

   896 			capacity(0), flow(0) { }

   897     void setCapacityMap(const CapacityMap& _capacity) {

   898       capacity=&_capacity;

   899     }

   900     void setFlowMap(FlowMap& _flow) {

   901       flow=&_flow;

   902     }

   904   public:

   906     ResGraphWrapper(Graph& _graph, const CapacityMap& _capacity,

   907 		    FlowMap& _flow) :

   908       GraphWrapper<Graph>(_graph), capacity(&_capacity), flow(&_flow) { }

   910     class Edge;

   911     class OutEdgeIt;

   912     friend class Edge;

   913     friend class OutEdgeIt;

   915     typedef typename GraphWrapper<Graph>::Node Node;

   916     typedef typename GraphWrapper<Graph>::NodeIt NodeIt;

   917     class Edge : public Graph::Edge {

   918       friend class ResGraphWrapper<Graph, Number, CapacityMap, FlowMap>;

   919     protected:

   920       bool backward; //true, iff backward

   921 //      typename Graph::Edge e;

   922     public:

   923       Edge() { }

   924       Edge(const typename Graph::Edge& _e, bool _backward) :

   925 	Graph::Edge(_e), backward(_backward) { }

   926       Edge(const Invalid& i) : Graph::Edge(i), backward(true) { }

   927 //the unique invalid iterator

   928       friend bool operator==(const Edge& u, const Edge& v) {

   929 	return (v.backward==u.backward &&

   930 		static_cast<typename Graph::Edge>(u)==

   931 		static_cast<typename Graph::Edge>(v));

   932       }

   933       friend bool operator!=(const Edge& u, const Edge& v) {

   934 	return (v.backward!=u.backward ||

   935 		static_cast<typename Graph::Edge>(u)!=

   936 		static_cast<typename Graph::Edge>(v));

   937       }

   938     };

   940     class OutEdgeIt {

   941       friend class ResGraphWrapper<Graph, Number, CapacityMap, FlowMap>;

   942     protected:

   943       typename Graph::OutEdgeIt out;

   944       typename Graph::InEdgeIt in;

   945       bool backward;

   946     public:

   947       OutEdgeIt() { }

   948       //FIXME

   949 //      OutEdgeIt(const Edge& e) : Edge(e) { }

   950       OutEdgeIt(const Invalid& i) : out(i), in(i), backward(true) { }

   951 //the unique invalid iterator

   952       OutEdgeIt(const ResGraphWrapper<Graph, Number, CapacityMap, FlowMap>& _G, Node v) {

   953 	backward=false;

   954 	_G.graph->first(out, v);

   955 	while( _G.graph->valid(out) && !(_G.resCap(*this)>0) ) { _G.graph->next(out); }

   956 	if (!_G.graph->valid(out)) {

   957 	  backward=true;

   958 	  _G.graph->first(in, v);

   959 	  while( _G.graph->valid(in) && !(_G.resCap(*this)>0) ) { _G.graph->next(in); }

   960 	}

   961       }

   962       operator Edge() const {

   963 //	Edge e;

   964 //	e.forward=this->forward;

   965 //	if (this->forward) e=out; else e=in;

   966 //	return e;

   967 	if (this->backward)

   968 	  return Edge(in, this->backward);

   969 	else

   970 	  return Edge(out, this->backward);

   971       }

   972     };

   974     class InEdgeIt {

   975       friend class ResGraphWrapper<Graph, Number, CapacityMap, FlowMap>;

   976     protected:

   977       typename Graph::OutEdgeIt out;

   978       typename Graph::InEdgeIt in;

   979       bool backward;

   980     public:

   981       InEdgeIt() { }

   982       //FIXME

   983 //      OutEdgeIt(const Edge& e) : Edge(e) { }

   984       InEdgeIt(const Invalid& i) : out(i), in(i), backward(true) { }

   985 //the unique invalid iterator

   986       InEdgeIt(const ResGraphWrapper<Graph, Number, CapacityMap, FlowMap>& _G, Node v) {

   987 	backward=false;

   988 	_G.graph->first(in, v);

   989 	while( _G.graph->valid(in) && !(_G.resCap(*this)>0) ) { _G.graph->next(in); }

   990 	if (!_G.graph->valid(in)) {

   991 	  backward=true;

   992 	  _G.graph->first(out, v);

   993 	  while( _G.graph->valid(out) && !(_G.resCap(*this)>0) ) { _G.graph->next(out); }

   994 	}

   995       }

   996       operator Edge() const {

   997 //	Edge e;

   998 //	e.forward=this->forward;

   999 //	if (this->forward) e=out; else e=in;

  1000 //	return e;

  1001 	if (this->backward)

  1002 	  return Edge(out, this->backward);

  1003 	else

  1004 	  return Edge(in, this->backward);

  1005       }

  1006     };

  1008     class EdgeIt {

  1009       friend class ResGraphWrapper<Graph, Number, CapacityMap, FlowMap>;

  1010     protected:

  1011       typename Graph::EdgeIt e;

  1012       bool backward;

  1013     public:

  1014       EdgeIt() { }

  1015       EdgeIt(const Invalid& i) : e(i), backward(true) { }

  1016       EdgeIt(const ResGraphWrapper<Graph, Number, CapacityMap, FlowMap>& _G) {

  1017 	backward=false;

  1018 	_G.graph->first(e);

  1019 	while (_G.graph->valid(e) && !(_G.resCap(*this)>0)) _G.graph->next(e);

  1020 	if (!_G.graph->valid(e)) {

  1021 	  backward=true;

  1022 	  _G.graph->first(e);

  1023 	  while (_G.graph->valid(e) && !(_G.resCap(*this)>0)) _G.graph->next(e);

  1024 	}

  1025       }

  1026       operator Edge() const {

  1027 	return Edge(e, this->backward);

  1028       }

  1029     };

  1031     using GraphWrapper<Graph>::first;

  1032 //     NodeIt& first(NodeIt& i) const {

  1033 //       i=NodeIt(*this); return i;

  1034 //     }

  1035     OutEdgeIt& first(OutEdgeIt& i, const Node& p) const {

  1036       i=OutEdgeIt(*this, p); return i;

  1037     }

  1038 //    FIXME not tested

  1039     InEdgeIt& first(InEdgeIt& i, const Node& p) const {

  1040       i=InEdgeIt(*this, p); return i;

  1041     }

  1042     EdgeIt& first(EdgeIt& i) const {

  1043       i=EdgeIt(*this); return i;

  1044     }

  1046     using GraphWrapper<Graph>::next;

  1047 //    NodeIt& next(NodeIt& n) const { GraphWrapper<Graph>::next(n); return n; }

  1048     OutEdgeIt& next(OutEdgeIt& e) const {

  1049       if (!e.backward) {

  1050 	Node v=this->graph->aNode(e.out);

  1051 	this->graph->next(e.out);

  1052 	while( this->graph->valid(e.out) && !(resCap(e)>0) ) {

  1053 	  this->graph->next(e.out); }

  1054 	if (!this->graph->valid(e.out)) {

  1055 	  e.backward=true;

  1056 	  this->graph->first(e.in, v);

  1057 	  while( this->graph->valid(e.in) && !(resCap(e)>0) ) {

  1058 	    this->graph->next(e.in); }

  1059 	}

  1060       } else {

  1061 	this->graph->next(e.in);

  1062 	while( this->graph->valid(e.in) && !(resCap(e)>0) ) {

  1063 	  this->graph->next(e.in); }

  1064       }

  1065       return e;

  1066     }

  1067 //     FIXME Not tested

  1068     InEdgeIt& next(InEdgeIt& e) const {

  1069       if (!e.backward) {

  1070 	Node v=this->graph->aNode(e.in);

  1071 	this->graph->next(e.in);

  1072 	while( this->graph->valid(e.in) && !(resCap(e)>0) ) {

  1073 	  this->graph->next(e.in); }

  1074 	if (!this->graph->valid(e.in)) {

  1075 	  e.backward=true;

  1076 	  this->graph->first(e.out, v);

  1077 	  while( this->graph->valid(e.out) && !(resCap(e)>0) ) {

  1078 	    this->graph->next(e.out); }

  1079 	}

  1080       } else {

  1081 	this->graph->next(e.out);

  1082 	while( this->graph->valid(e.out) && !(resCap(e)>0) ) {

  1083 	  this->graph->next(e.out); }

  1084       }

  1085       return e;

  1086     }

  1087     EdgeIt& next(EdgeIt& e) const {

  1088       if (!e.backward) {

  1089 	this->graph->next(e.e);

  1090 	while( this->graph->valid(e.e) && !(resCap(e)>0) ) {

  1091 	  this->graph->next(e.e); }

  1092 	if (!this->graph->valid(e.e)) {

  1093 	  e.backward=true;

  1094 	  this->graph->first(e.e);

  1095 	  while( this->graph->valid(e.e) && !(resCap(e)>0) ) {

  1096 	    this->graph->next(e.e); }

  1097 	}

  1098       } else {

  1099 	this->graph->next(e.e);

  1100 	while( this->graph->valid(e.e) && !(resCap(e)>0) ) {

  1101 	  this->graph->next(e.e); }

  1102       }

  1103       return e;

  1104     }

  1106     Node tail(Edge e) const {

  1107       return ((!e.backward) ? this->graph->tail(e) : this->graph->head(e)); }

  1108     Node head(Edge e) const {

  1109       return ((!e.backward) ? this->graph->head(e) : this->graph->tail(e)); }

  1111     Node aNode(OutEdgeIt e) const {

  1112       return ((!e.backward) ? this->graph->aNode(e.out) :

  1113 	      this->graph->aNode(e.in)); }

  1114     Node bNode(OutEdgeIt e) const {

  1115       return ((!e.backward) ? this->graph->bNode(e.out) :

  1116 	      this->graph->bNode(e.in)); }

  1118     Node aNode(InEdgeIt e) const {

  1119       return ((!e.backward) ? this->graph->aNode(e.in) :

  1120 	      this->graph->aNode(e.out)); }

  1121     Node bNode(InEdgeIt e) const {

  1122       return ((!e.backward) ? this->graph->bNode(e.in) :

  1123 	      this->graph->bNode(e.out)); }

  1125 //    int nodeNum() const { return graph->nodeNum(); }

  1126     //FIXME

  1127     void edgeNum() const { }

  1128     //int edgeNum() const { return graph->edgeNum(); }

  1131 //    int id(Node v) const { return graph->id(v); }

  1133     bool valid(Node n) const { return GraphWrapper<Graph>::valid(n); }

  1134     bool valid(Edge e) const {

  1135       return this->graph->valid(e);

  1136 	//return e.forward ? graph->valid(e.out) : graph->valid(e.in);

  1137     }

  1139     bool forward(const Edge& e) const { return !e.backward; }

  1140     bool backward(const Edge& e) const { return e.backward; }

  1142     void augment(const Edge& e, Number a) const {

  1143       if (!e.backward)

  1144 // 	flow->set(e.out, flow->get(e.out)+a);

  1145 	flow->set(e, (*flow)[e]+a);

  1146       else

  1147 // 	flow->set(e.in, flow->get(e.in)-a);

  1148 	flow->set(e, (*flow)[e]-a);

  1149     }

  1151     Number resCap(const Edge& e) const {

  1152       if (!e.backward)

  1153 //	return (capacity->get(e.out)-flow->get(e.out));

  1154 	return ((*capacity)[e]-(*flow)[e]);

  1155       else

  1156 //	return (flow->get(e.in));

  1157 	return ((*flow)[e]);

  1158     }

  1160 //     Number resCap(typename Graph::OutEdgeIt out) const {

  1161 // //      return (capacity->get(out)-flow->get(out));

  1162 //       return ((*capacity)[out]-(*flow)[out]);

  1163 //     }

  1165 //     Number resCap(typename Graph::InEdgeIt in) const {

  1166 // //      return (flow->get(in));

  1167 //       return ((*flow)[in]);

  1168 //     }

  1170     template <typename T>

  1171     class EdgeMap {

  1172       typename Graph::template EdgeMap<T> forward_map, backward_map;

  1173     public:

  1174       EdgeMap(const ResGraphWrapper<Graph, Number, CapacityMap, FlowMap>& _G) : forward_map(*(_G.graph)), backward_map(*(_G.graph)) { }

  1175       EdgeMap(const ResGraphWrapper<Graph, Number, CapacityMap, FlowMap>& _G, T a) : forward_map(*(_G.graph), a), backward_map(*(_G.graph), a) { }

  1176       void set(Edge e, T a) {

  1177 	if (!e.backward)

  1178 	  forward_map.set(e.out, a);

  1179 	else

  1180 	  backward_map.set(e.in, a);

  1181       }

  1182       T operator[](Edge e) const {

  1183 	if (!e.backward)

  1184 	  return forward_map[e.out];

  1185 	else

  1186 	  return backward_map[e.in];

  1187       }

  1188 //       T get(Edge e) const {

  1189 // 	if (e.out_or_in)

  1190 // 	  return forward_map.get(e.out);

  1191 // 	else

  1192 // 	  return backward_map.get(e.in);

  1193 //       }

  1194     };

  1195   };

  1199   /// ErasingFirstGraphWrapper for blocking flows.

  1201   /// ErasingFirstGraphWrapper for blocking flows.

  1202   ///

  1203   ///\author Marton Makai

  1204   template<typename Graph, typename FirstOutEdgesMap>

  1205   class ErasingFirstGraphWrapper : public GraphWrapper<Graph> {

  1206   protected:

  1207     FirstOutEdgesMap* first_out_edges;

  1208   public:

  1209     ErasingFirstGraphWrapper(Graph& _graph,

  1210 			     FirstOutEdgesMap& _first_out_edges) :

  1211       GraphWrapper<Graph>(_graph), first_out_edges(&_first_out_edges) { }

  1213     typedef typename GraphWrapper<Graph>::Node Node;

  1214 //     class NodeIt {

  1215 //       friend class GraphWrapper<Graph>;

  1216 //       friend class ErasingFirstGraphWrapper<Graph, FirstOutEdgesMap>;

  1217 //       typename Graph::NodeIt n;

  1218 //      public:

  1219 //       NodeIt() { }

  1220 //       NodeIt(const typename Graph::NodeIt& _n) : n(_n) { }

  1221 //       NodeIt(const Invalid& i) : n(i) { }

  1222 //       NodeIt(const ErasingFirstGraphWrapper<Graph, FirstOutEdgesMap>& _G) :

  1223 // 	n(*(_G.graph)) { }

  1224 //       operator Node() const { return Node(typename Graph::Node(n)); }

  1225 //     };

  1226     typedef typename GraphWrapper<Graph>::Edge Edge;

  1227     class OutEdgeIt {

  1228       friend class GraphWrapper<Graph>;

  1229       friend class ErasingFirstGraphWrapper<Graph, FirstOutEdgesMap>;

  1230 //      typedef typename Graph::OutEdgeIt GraphOutEdgeIt;

  1231       typename Graph::OutEdgeIt e;

  1232     public:

  1233       OutEdgeIt() { }

  1234       OutEdgeIt(const typename Graph::OutEdgeIt& _e) : e(_e) { }

  1235       OutEdgeIt(const Invalid& i) : e(i) { }

  1236       OutEdgeIt(const ErasingFirstGraphWrapper<Graph, FirstOutEdgesMap>& _G,

  1237 		const Node& _n) :

  1238 	e((*_G.first_out_edges)[_n]) { }

  1239       operator Edge() const { return Edge(typename Graph::Edge(e)); }

  1240     };

  1241     class InEdgeIt {

  1242       friend class GraphWrapper<Graph>;

  1243       friend class ErasingFirstGraphWrapper<Graph, FirstOutEdgesMap>;

  1244 //      typedef typename Graph::InEdgeIt GraphInEdgeIt;

  1245       typename Graph::InEdgeIt e;

  1246     public:

  1247       InEdgeIt() { }

  1248       InEdgeIt(const typename Graph::InEdgeIt& _e) : e(_e) { }

  1249       InEdgeIt(const Invalid& i) : e(i) { }

  1250       InEdgeIt(const ErasingFirstGraphWrapper<Graph, FirstOutEdgesMap>& _G,

  1251 	       const Node& _n) :

  1252 	e(*(_G.graph), typename Graph::Node(_n)) { }

  1253       operator Edge() const { return Edge(typename Graph::Edge(e)); }

  1254     };

  1255     //typedef typename Graph::SymEdgeIt SymEdgeIt;

  1256     class EdgeIt {

  1257       friend class GraphWrapper<Graph>;

  1258       friend class ErasingFirstGraphWrapper<Graph, FirstOutEdgesMap>;

  1259 //      typedef typename Graph::EdgeIt GraphEdgeIt;

  1260       typename Graph::EdgeIt e;

  1261     public:

  1262       EdgeIt() { }

  1263       EdgeIt(const typename Graph::EdgeIt& _e) : e(_e) { }

  1264       EdgeIt(const Invalid& i) : e(i) { }

  1265       EdgeIt(const ErasingFirstGraphWrapper<Graph, FirstOutEdgesMap>& _G) :

  1266 	e(*(_G.graph)) { }

  1267       operator Edge() const { return Edge(typename Graph::Edge(e)); }

  1268     };

  1270     using GraphWrapper<Graph>::first;

  1271 //     NodeIt& first(NodeIt& i) const {

  1272 //       i=NodeIt(*this); return i;

  1273 //     }

  1274     OutEdgeIt& first(OutEdgeIt& i, const Node& p) const {

  1275       i=OutEdgeIt(*this, p); return i;

  1276     }

  1277     InEdgeIt& first(InEdgeIt& i, const Node& p) const {

  1278       i=InEdgeIt(*this, p); return i;

  1279     }

  1280     EdgeIt& first(EdgeIt& i) const {

  1281       i=EdgeIt(*this); return i;

  1282     }

  1284     using GraphWrapper<Graph>::next;

  1285 //    NodeIt& next(NodeIt& i) const { graph->next(i.n); return i; }

  1286     OutEdgeIt& next(OutEdgeIt& i) const { this->graph->next(i.e); return i; }

  1287     InEdgeIt& next(InEdgeIt& i) const { this->graph->next(i.e); return i; }

  1288     EdgeIt& next(EdgeIt& i) const { this->graph->next(i.e); return i; }

  1290     Node aNode(const OutEdgeIt& e) const {

  1291       return Node(this->graph->aNode(e.e)); }

  1292     Node aNode(const InEdgeIt& e) const {

  1293       return Node(this->graph->aNode(e.e)); }

  1294     Node bNode(const OutEdgeIt& e) const {

  1295       return Node(this->graph->bNode(e.e)); }

  1296     Node bNode(const InEdgeIt& e) const {

  1297       return Node(this->graph->bNode(e.e)); }

  1299     void erase(const OutEdgeIt& e) const {

  1300       OutEdgeIt f=e;

  1301       this->next(f);

  1302       first_out_edges->set(this->tail(e), f.e);

  1303     }

  1304   };

  1306   ///@}

  1308 } //namespace hugo

  1311 #endif //HUGO_GRAPH_WRAPPER_H

author	deba
	Fri, 07 May 2004 08:18:30 +0000
changeset 571	9632ea8be6ca
parent 565	18787f6db0db
child 572	e9ed28955421
permissions	-rw-r--r--