COIN-OR::LEMON - Graph Library

Changeset 40:e1725bb7e821 in lemon-tutorial


Ignore:
Timestamp:
02/21/10 18:34:28 (9 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Port two images for SplitNodes? from SVN -r3524

Files:
2 added
2 edited

Legend:

Unmodified
Added
Removed
  • Makefile.in

    r35 r40  
    33EPS_IMAGES18 =
    44
     5EPS_IMAGES27 = \
     6        splitnodes1.eps \
     7        splitnodes2.eps
     8
    59EPS_IMAGES = \
    6         $(EPS_IMAGES18)
     10        $(EPS_IMAGES18) \
     11        $(EPS_IMAGES27)
    712
    813PNG_IMAGES = \
     
    1823        -mkdir -p gen-images
    1924        $(GS_COMMAND) -sDEVICE=pngalpha -r18 -sOutputFile=$@ $<
     25
     26$(EPS_IMAGES27:%.eps=gen-images/%.png): gen-images/%.png: images/%.eps
     27        -mkdir -p gen-images
     28        $(GS_COMMAND) -sDEVICE=pngalpha -r27 -sOutputFile=$@ $<
    2029
    2130html: Doxyfile-gen $(PNG_IMAGES)
  • adaptors.dox

    r39 r40  
    360360a sink node in a digraph can be easily computed using a maximum flow
    361361algorithm with all arc capacities set to 1.
     362For example, in the following digraph, four arc disjoint paths can be found
     363from the node on the left to the node on the right.
     364
     365\image html splitnodes1.png
     366\image latex splitnodes1.eps "Arc disjoint paths" width=\textwidth
     367
    362368On the other hand, \e node \e disjoint paths cannot be found directly
    363369using a standard algorithm.
     
    367373thus the found flow will correspond to the union of some node disjoint
    368374paths in terms of the original digraph.
     375For example, in the above digraph, there are only three node disjoint paths.
     376
     377\image html splitnodes2.png
     378\image latex splitnodes2.eps "Node disjoint paths" width=\textwidth
    369379
    370380In flow, circulation and matching problems, the residual network is of
Note: See TracChangeset for help on using the changeset viewer.