Changeset 513:60afd11e6cb3 in lemon0.x for src/work/athos/minlengthpaths.h
 Timestamp:
 05/03/04 16:42:40 (17 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@673
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/work/athos/minlengthpaths.h
r511 r513 23 23 /// 24 24 /// The class \ref hugo::MinLengthPaths "MinLengthPaths" implements 25 /// an algorithm which findsk edgedisjoint paths25 /// an algorithm for finding k edgedisjoint paths 26 26 /// from a given source node to a given target node in an 27 27 /// edgeweighted directed graph having minimal total weigth (length).
Note: See TracChangeset
for help on using the changeset viewer.