Changeset 40:e1725bb7e821 in lemon-tutorial

Timestamp:

02/21/10 18:34:28 (15 years ago)

Author:

Peter Kovacs <kpeter@…>

Branch:

default

Phase:

public

Message:

Port two images for SplitNodes? from SVN -r3524

Files:

• Makefile.in (modified) (2 diffs)
• adaptors.dox (modified) (2 diffs)
• images/splitnodes1.eps (added)
• images/splitnodes2.eps (added)

Makefile.in

@@ -3 +3 @@
 EPS_IMAGES18 =
 
+EPS_IMAGES27 = \
+        splitnodes1.eps \
+        splitnodes2.eps
+
 EPS_IMAGES = \
-        $(EPS_IMAGES18)
+        $(EPS_IMAGES18) \
+        $(EPS_IMAGES27)
 
 PNG_IMAGES = \
@@ -18 +23 @@
         -mkdir -p gen-images
         $(GS_COMMAND) -sDEVICE=pngalpha -r18 -sOutputFile=$@ $<
+
+$(EPS_IMAGES27:%.eps=gen-images/%.png): gen-images/%.png: images/%.eps
+        -mkdir -p gen-images
+        $(GS_COMMAND) -sDEVICE=pngalpha -r27 -sOutputFile=$@ $<
 
 html: Doxyfile-gen $(PNG_IMAGES)

adaptors.dox

@@ -360 +360 @@
 a sink node in a digraph can be easily computed using a maximum flow
 algorithm with all arc capacities set to 1.
+For example, in the following digraph, four arc disjoint paths can be found
+from the node on the left to the node on the right.
+
+\image html splitnodes1.png
+\image latex splitnodes1.eps "Arc disjoint paths" width=\textwidth
+
 On the other hand, \e node \e disjoint paths cannot be found directly
 using a standard algorithm.
@@ -367 +373 @@
 thus the found flow will correspond to the union of some node disjoint
 paths in terms of the original digraph.
+For example, in the above digraph, there are only three node disjoint paths.
+
+\image html splitnodes2.png
+\image latex splitnodes2.eps "Node disjoint paths" width=\textwidth
 
 In flow, circulation and matching problems, the residual network is of