Changeset 314:eabbe162e32e in lemon-0.x for src/work/athos
- Timestamp:
- 04/07/04 19:42:05 (21 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@432
- Location:
- src/work/athos
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
src/work/athos/makefile
r313 r314 5 5 #LEDAROOT ?= /ledasrc/LEDA-4.1 6 6 #BOOSTROOT ?= /home/marci/boost 7 INCLUDEDIRS ?= -I../../include -I.. -I../{marci,jacint,alpar, klao,akos,athos} #-I$(BOOSTROOT)7 INCLUDEDIRS ?= -I../../include -I.. -I../{marci,jacint,alpar,athos,akos,klao} #-I$(BOOSTROOT) 8 8 #LEDAINCLUDE ?= -I$(LEDAROOT)/incl 9 9 CXXFLAGS = -g -O -W -Wall $(INCLUDEDIRS) -ansi -pedantic -
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 }; -
src/work/athos/munkaido
r277 r314 1 III. - IV.1. 1 2 pentek: Megbeszélés 3 óra 2 megbeszeltuk Alpárral, hogy mûködjön a Suurballe 1 óra3 megbeszeltuk Alpárral, hogy hogyan mûködjön a Suurballe 1 óra 3 4 Hétfõ: Suurballe 4 óra 4 5 Kedd: Suurballe 5 óra … … 6 7 Wiki beszámoló 1 óra 7 8 Eredmény: Félkész Suurballe 9 10 IV.2. - IV.9. 11 pentek: Megbeszélés 3 óra 12 Hétfõ: Suurballe 4 óra -
src/work/athos/suurballe.cc
r310 r314 124 124 std::cout << surb_test.run(s,t,k) << std::endl; 125 125 126 126 127 return 0; 127 128 }
Note: See TracChangeset
for help on using the changeset viewer.