# HG changeset patch # User athos # Date 1081359725 0 # Node ID eabbe162e32ec9e656e529bec1c3680ac0083876 # Parent 30c5179f296b46e1e816b172b95fdc7c3af4d61d minlengthpaths is ready, but the paths are not yet determined: needs to canonize a flow diff -r 30c5179f296b -r eabbe162e32e src/work/athos/makefile --- a/src/work/athos/makefile Wed Apr 07 11:02:00 2004 +0000 +++ b/src/work/athos/makefile Wed Apr 07 17:42:05 2004 +0000 @@ -4,7 +4,7 @@ CC=$(CXX) #LEDAROOT ?= /ledasrc/LEDA-4.1 #BOOSTROOT ?= /home/marci/boost -INCLUDEDIRS ?= -I../../include -I.. -I../{marci,jacint,alpar,klao,akos,athos} #-I$(BOOSTROOT) +INCLUDEDIRS ?= -I../../include -I.. -I../{marci,jacint,alpar,athos,akos,klao} #-I$(BOOSTROOT) #LEDAINCLUDE ?= -I$(LEDAROOT)/incl CXXFLAGS = -g -O -W -Wall $(INCLUDEDIRS) -ansi -pedantic diff -r 30c5179f296b -r eabbe162e32e src/work/athos/minlengthpaths.h --- a/src/work/athos/minlengthpaths.h Wed Apr 07 11:02:00 2004 +0000 +++ b/src/work/athos/minlengthpaths.h Wed Apr 07 17:42:05 2004 +0000 @@ -64,10 +64,11 @@ const Graph& G; const LengthMap& length; - //auxiliary variable - //The value is 1 iff the edge is reversed + //auxiliry variable + //The value is 1 iff the edge is reversed. + //If the algorithm has finished, the edges of the seeked paths are + //exactly those that are reversed EdgeIntMap reversed; - public : @@ -83,6 +84,7 @@ int run(Node s, Node t, int k) { ConstMap const1map(1); + //We need a residual graph, in which some of the edges are reversed ResGraphType res_graph(G, reversed, const1map); //Initialize the copy of the Dijkstra potential to zero @@ -94,8 +96,7 @@ for (int i=0; i