Fri, 07 May 2004 15:58:45 +0000 alpar EdgeSet is more or less working.
Fri, 07 May 2004 13:27:16 +0000 alpar src/work/alpar/list_graph.h moved to /src/hugo.
Fri, 07 May 2004 11:57:34 +0000 marci top-sort, dimacs mods.
Fri, 07 May 2004 10:57:31 +0000 marci (none)
Fri, 07 May 2004 10:34:36 +0000 jacint Docs added
Fri, 07 May 2004 10:22:30 +0000 alpar *** empty log message ***
Fri, 07 May 2004 09:05:23 +0000 marci (none)
Fri, 07 May 2004 08:48:11 +0000 marci Edge opposite(const Edge&) in BidirGaphWrapper<Graph>
Fri, 07 May 2004 08:18:30 +0000 deba (none)
Fri, 07 May 2004 08:02:17 +0000 alpar Compile checks added.
Fri, 07 May 2004 07:44:44 +0000 marci BidirGraphWrapper<Graph>, the map values are different for the opposite edges.
Fri, 07 May 2004 06:58:24 +0000 alpar An alternative dijkstra_test.cc
Fri, 07 May 2004 06:57:50 +0000 alpar time_measure.cc was renamed to time_measure_test.cc
Fri, 07 May 2004 06:35:02 +0000 alpar Exit with correct return value
Fri, 07 May 2004 06:33:02 +0000 marci ResGraphWrapper mods.
Fri, 07 May 2004 05:29:45 +0000 alpar skeleton tests turned on again.
Thu, 06 May 2004 23:05:01 +0000 ladanyi We need to distribute the headers in 'skeletons' too.
Thu, 06 May 2004 22:24:02 +0000 ladanyi No automatic doc generation.
Thu, 06 May 2004 19:01:00 +0000 marci (none)
Thu, 06 May 2004 18:07:45 +0000 marci (none)
Thu, 06 May 2004 17:45:12 +0000 marci A max bipartite matching class in src/work/marci/max_bipartite_matching.h
Thu, 06 May 2004 17:22:11 +0000 marci random graph, random bipartite graph in jacint/graph_gen.h
Thu, 06 May 2004 17:01:31 +0000 marci (none)
Thu, 06 May 2004 16:55:59 +0000 marci graph_wrapper.h in hugo
Thu, 06 May 2004 16:54:54 +0000 marci #include <hugo/ > modifications
Thu, 06 May 2004 15:47:42 +0000 athos Method checkSolution() added.
Thu, 06 May 2004 15:39:31 +0000 marci SubGraphWrapper bug ok
Thu, 06 May 2004 15:24:42 +0000 marci top-sort, for fezso's sake
Thu, 06 May 2004 15:19:59 +0000 athos Written hugo/ into includes.
Thu, 06 May 2004 15:14:13 +0000 alpar Some tests must have been commented out temporarily.
Thu, 06 May 2004 15:10:48 +0000 marci (none)
Thu, 06 May 2004 14:25:21 +0000 marci (none)
Thu, 06 May 2004 14:23:48 +0000 athos Modified a little bit
Thu, 06 May 2004 14:21:57 +0000 alpar No automatic doc generation.
Thu, 06 May 2004 14:11:09 +0000 alpar Test cases for time_measure.h
Thu, 06 May 2004 14:00:50 +0000 marci (none)
Thu, 06 May 2004 13:48:48 +0000 marci an experimental topsort
Thu, 06 May 2004 13:48:04 +0000 ladanyi Set up automake environment.
Thu, 06 May 2004 13:46:07 +0000 marci (none)
Thu, 06 May 2004 13:44:48 +0000 marci (none)
Thu, 06 May 2004 13:21:24 +0000 ladanyi Rename 'include' to 'hugo' (for automake)
Thu, 06 May 2004 09:26:23 +0000 jacint (none)
Wed, 05 May 2004 17:51:56 +0000 jacint Contains Edmonds' matching algorithm in a plain and in a heuristical form.
Wed, 05 May 2004 17:29:41 +0000 jacint tests max_matching.h
Wed, 05 May 2004 17:24:06 +0000 jacint (none)
Wed, 05 May 2004 17:23:04 +0000 jacint primitive random graph generator
Wed, 05 May 2004 08:36:00 +0000 alpar Minor bugfix.
Wed, 05 May 2004 08:18:19 +0000 alpar Compiles also with icc.
Wed, 05 May 2004 07:53:51 +0000 alpar Compiles with are icc, as well.
Tue, 04 May 2004 16:52:15 +0000 athos Minimum cost flows of small values: algorithm from Andras Frank's lecture notes (approximately)
Tue, 04 May 2004 16:17:17 +0000 jacint Adding update() to NullMap
Tue, 04 May 2004 16:16:49 +0000 jacint Able to read min cost flow, max flow, shortest path, matching testgraphs
Tue, 04 May 2004 14:54:21 +0000 athos Nem tudom, a hugo-n miert nem megy.
Tue, 04 May 2004 14:06:00 +0000 marci bool forward(Edge), bool backward(Edge)
Tue, 04 May 2004 12:03:04 +0000 marci misc
Tue, 04 May 2004 12:01:49 +0000 marci An undirected graph template UndirGraph<Graph> can be used.
Tue, 04 May 2004 12:00:13 +0000 athos Started.
Tue, 04 May 2004 11:20:16 +0000 athos Nothing special.
Tue, 04 May 2004 10:58:42 +0000 athos Ezt mintha mar toroltem volna.
Tue, 04 May 2004 09:33:21 +0000 athos Created minlengthpaths_test.cc. Compiles with: g++-3.0 -Wall -I. -I../{klao,jacint,marci} -I.. -I../../include minlengthpaths_test.cc -o min | & less
Tue, 04 May 2004 09:03:00 +0000 athos Putting things in their place
Tue, 04 May 2004 09:00:11 +0000 athos Started minlengthpaths_test, but it should not be here
Tue, 04 May 2004 08:34:01 +0000 athos Test file xy_test.cc finished. Really.
Tue, 04 May 2004 08:31:48 +0000 athos Test file xy_test.cc finished.
Mon, 03 May 2004 17:06:38 +0000 alpar To be compatible with gcc-3.4.0 ...
Mon, 03 May 2004 14:43:49 +0000 athos An awful mistake found and corrected.
Mon, 03 May 2004 14:42:40 +0000 athos xy_test added: it was not entirely useless, I found a mistake in xy.h
Mon, 03 May 2004 11:43:27 +0000 marci bip matching...
Mon, 03 May 2004 10:27:20 +0000 athos getPath() function implemented.
Mon, 03 May 2004 10:04:27 +0000 marci matching, flows
Mon, 03 May 2004 09:44:00 +0000 alpar (none)
Mon, 03 May 2004 09:43:03 +0000 alpar docfix.
Mon, 03 May 2004 09:38:17 +0000 alpar A "related pages" about Hugo Coding Style.
Mon, 03 May 2004 09:18:01 +0000 alpar Now it sucks the whole src/include and src/include/skeletons
Mon, 03 May 2004 09:00:09 +0000 athos I changed it to correspond changing requirements
Mon, 03 May 2004 08:13:41 +0000 alpar One more test case with minor importance.
Mon, 03 May 2004 07:27:29 +0000 alpar test/graph_test.cc added.
Fri, 30 Apr 2004 19:02:40 +0000 marci static const bool BipartiteGraphWrapper<Graph>::S_CLASS, T_CLASS
Fri, 30 Apr 2004 18:43:18 +0000 marci bipatite
Fri, 30 Apr 2004 17:48:50 +0000 marci misc
Fri, 30 Apr 2004 17:10:01 +0000 marci A bipartite graph template can be used as BipartiteGraph<ListGraph>.
Fri, 30 Apr 2004 16:46:19 +0000 marci bipartite graphs
Fri, 30 Apr 2004 16:10:49 +0000 marci bipartite graph in bipartite_graph_wrapper.h
Fri, 30 Apr 2004 14:02:10 +0000 marci gw
Fri, 30 Apr 2004 13:52:17 +0000 marci (none)
Fri, 30 Apr 2004 06:46:39 +0000 jacint Felkesz kod!
Fri, 30 Apr 2004 01:59:15 +0000 klao DirPath fejlodes.
Fri, 30 Apr 2004 01:10:13 +0000 klao spell checking
Fri, 30 Apr 2004 01:02:22 +0000 klao ingroup bug
Thu, 29 Apr 2004 23:24:42 +0000 klao The -W gcc option _does_ matter even if you use -Wall!
Thu, 29 Apr 2004 22:39:17 +0000 klao Basic error handling facilities
Thu, 29 Apr 2004 19:38:53 +0000 marci misc
Thu, 29 Apr 2004 19:25:52 +0000 marci some documentation
Thu, 29 Apr 2004 18:48:25 +0000 marci TODO
Thu, 29 Apr 2004 17:34:42 +0000 marci Some docu in MaxFlow class, jacint/max_flow.h
Thu, 29 Apr 2004 17:23:56 +0000 beckerjc Move unionfind.h in Doxyfile too
Thu, 29 Apr 2004 17:00:44 +0000 beckerjc UnionFind moved to include. Test compiles and runs cleanly.
Thu, 29 Apr 2004 16:59:00 +0000 marci corrections for leda matching files
Thu, 29 Apr 2004 16:45:40 +0000 beckerjc Three new methods in UnionFindEnum.
Thu, 29 Apr 2004 16:30:39 +0000 marci corrections
Thu, 29 Apr 2004 16:29:43 +0000 alpar Main page added.
Thu, 29 Apr 2004 16:26:01 +0000 marci preflow.f -> max_flow.h
Thu, 29 Apr 2004 16:26:01 +0000 alpar doc
Thu, 29 Apr 2004 16:25:03 +0000 marci preflow, maxflow
Thu, 29 Apr 2004 16:08:16 +0000 marci edmonds_karp_demo->max_flow_demo
Thu, 29 Apr 2004 16:07:10 +0000 marci edmonds_karp
Thu, 29 Apr 2004 16:04:27 +0000 marci ledagraph
Thu, 29 Apr 2004 15:58:34 +0000 marci preflow, maxflow
Thu, 29 Apr 2004 15:01:52 +0000 marci misc
Thu, 29 Apr 2004 11:09:12 +0000 jacint Comparison == changed to <=
Thu, 29 Apr 2004 10:51:58 +0000 marci const-ok
Thu, 29 Apr 2004 10:41:56 +0000 marci nem irunk olyat hogy "void resetTarget(const Node _t) {t=_t;}" mert az a const az ott jobbara hulyeseg
Thu, 29 Apr 2004 10:29:51 +0000 marci preflow maxflow ...
Thu, 29 Apr 2004 10:16:46 +0000 marci preflow, maxflow comp
Thu, 29 Apr 2004 09:08:14 +0000 marci mods implied by preflow mods
Thu, 29 Apr 2004 08:42:05 +0000 alpar It breaks my heart to say them goodbye...
Thu, 29 Apr 2004 08:33:16 +0000 alpar doc
Wed, 28 Apr 2004 20:55:18 +0000 beckerjc Doc for the union-find structures.
Wed, 28 Apr 2004 16:25:34 +0000 marci bug ellen
Wed, 28 Apr 2004 14:20:24 +0000 marci test makefile hiba