Changeset 40:e1725bb7e821 in lemontutorial for adaptors.dox
 Timestamp:
 02/21/10 18:34:28 (14 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

adaptors.dox
r39 r40 360 360 a sink node in a digraph can be easily computed using a maximum flow 361 361 algorithm with all arc capacities set to 1. 362 For example, in the following digraph, four arc disjoint paths can be found 363 from 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 362 368 On the other hand, \e node \e disjoint paths cannot be found directly 363 369 using a standard algorithm. … … 367 373 thus the found flow will correspond to the union of some node disjoint 368 374 paths in terms of the original digraph. 375 For 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 369 379 370 380 In flow, circulation and matching problems, the residual network is of
Note: See TracChangeset
for help on using the changeset viewer.