#include <lemon/graph_adaptor.h>
Inherits SubBidirGraphAdaptor< Graph, ResForwardFilter< Graph, Number, CapacityMap, FlowMap >, ResBackwardFilter< Graph, Number, CapacityMap, FlowMap > >.
Inheritance diagram for ResGraphAdaptor:
[legend]List of all members.
Detailed Description
template<typename Graph, typename Number, typename CapacityMap, typename FlowMap>
class lemon::ResGraphAdaptor< Graph, Number, CapacityMap, FlowMap >
An adaptor for composing the residual graph for directed flow and circulation problems. Let
be a directed graph and let
be a number type. Let moreover
, be functions on the edge-set. In the appications of ResGraphAdaptor,
usually stands for a flow and
for a capacity function. Suppose that a graph instange g
of type ListGraph
implements
. Then RevGraphAdaptor implements the graph structure with node-set
and edge-set
, where
and
, i.e. the so called residual graph. When we take the union
, multilicities are counted, i.e. if an edge is in both
and
, then in the adaptor it appears twice. The following code shows how such an instance can be constructed. typedef ListGraph Graph;
Graph::EdgeMap<int> f(g);
Graph::EdgeMap<int> c(g);
ResGraphAdaptor<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > gw(g);
- Author:
- Marton Makai
The documentation for this class was generated from the following file:
Generated on Sat Aug 27 14:15:35 2005 for LEMON by
1.4.4