Changeset 314:eabbe162e32e in lemon0.x for src/work/athos/minlengthpaths.h
 Timestamp:
 04/07/04 19:42:05 (16 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@432
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/work/athos/minlengthpaths.h
r310 r314 65 65 const LengthMap& length; 66 66 67 //auxiliary variable 68 //The value is 1 iff the edge is reversed 67 //auxiliry variable 68 //The value is 1 iff the edge is reversed. 69 //If the algorithm has finished, the edges of the seeked paths are 70 //exactly those that are reversed 69 71 EdgeIntMap reversed; 70 71 72 72 73 public : … … 84 85 ConstMap const1map(1); 85 86 87 //We need a residual graph, in which some of the edges are reversed 86 88 ResGraphType res_graph(G, reversed, const1map); 87 89 … … 95 97 dijkstra.run(s); 96 98 if (!dijkstra.reached(t)){ 97 //There is no k path from s to t 98 /// \TODO mit keresett itt ez a ++? 99 //There are no k paths from s to t 99 100 return i; 100 101 };
Note: See TracChangeset
for help on using the changeset viewer.