1.1 --- a/adaptors.dox	Sun Feb 21 15:07:59 2010 +0100
     1.2 +++ b/adaptors.dox	Sun Feb 21 18:34:28 2010 +0100
     1.3 @@ -359,6 +359,12 @@
     1.4  The maximum number of \e edge \e disjoint paths from a source node to
     1.5  a sink node in a digraph can be easily computed using a maximum flow
     1.6  algorithm with all arc capacities set to 1.
     1.7 +For example, in the following digraph, four arc disjoint paths can be found
     1.8 +from the node on the left to the node on the right.
     1.9 +
    1.10 +\image html splitnodes1.png
    1.11 +\image latex splitnodes1.eps "Arc disjoint paths" width=\textwidth
    1.12 +
    1.13  On the other hand, \e node \e disjoint paths cannot be found directly
    1.14  using a standard algorithm.
    1.15  However, \ref SplitNodes adaptor makes it really simple.
    1.16 @@ -366,6 +372,10 @@
    1.17  bottleneck of the flow (i.e. the minimum cut) will be formed by bind arcs,
    1.18  thus the found flow will correspond to the union of some node disjoint
    1.19  paths in terms of the original digraph.
    1.20 +For example, in the above digraph, there are only three node disjoint paths.
    1.21 +
    1.22 +\image html splitnodes2.png
    1.23 +\image latex splitnodes2.eps "Node disjoint paths" width=\textwidth
    1.24  
    1.25  In flow, circulation and matching problems, the residual network is of
    1.26  particular importance, which is implemented in \ref ResidualDigraph.