Wed, 30 Nov 2005 17:49:01 +0000 marci bug fix
Wed, 30 Nov 2005 17:00:17 +0000 marci max flow with lp column generation
Wed, 30 Nov 2005 13:24:37 +0000 deba Some bug fix
Wed, 30 Nov 2005 13:24:23 +0000 hegyi MapWin is created and disposed from now instead of being show and hide.
Tue, 29 Nov 2005 19:31:58 +0000 hegyi Structure of GUI is now more clear-cut than before.
Tue, 29 Nov 2005 08:43:50 +0000 alpar Clarify INVALID implementation.
Tue, 29 Nov 2005 08:40:03 +0000 alpar - tolerance.h added
Mon, 28 Nov 2005 11:14:59 +0000 deba Doc fix
Mon, 28 Nov 2005 11:14:01 +0000 deba Radix sort algorithm
Thu, 24 Nov 2005 15:48:53 +0000 deba Bug fix
Wed, 23 Nov 2005 16:24:59 +0000 hegyi No segmentation fault caused by zero long edges.
Wed, 23 Nov 2005 16:08:02 +0000 deba Document improvments
Wed, 23 Nov 2005 15:42:36 +0000 deba Correcting alteration notifing
Wed, 23 Nov 2005 11:20:14 +0000 deba Static maps for bipartite graphs.
Tue, 22 Nov 2005 15:15:31 +0000 deba Fixing bug in g++-3.3
Tue, 22 Nov 2005 14:35:33 +0000 ladanyi clean-up
Tue, 22 Nov 2005 10:27:25 +0000 ladanyi fixed some memory leaks
Mon, 21 Nov 2005 18:12:11 +0000 deba Erasing old header
Mon, 21 Nov 2005 18:03:20 +0000 hegyi NewMapWin has become Dialog instead of Window. Therefore it is created dynamically, when there is need for it, instead of keeping one instance in memory. This solution is slower, but more correct than before.
Mon, 21 Nov 2005 17:59:27 +0000 deba Erasing from the Makefile.am too
Mon, 21 Nov 2005 17:58:24 +0000 deba Erasing old tests
Mon, 21 Nov 2005 17:48:00 +0000 deba Undir Bipartite Graph/Full and Smart/ without concept, doc and concept
Mon, 21 Nov 2005 12:07:05 +0000 hegyi Reorganizing.
Mon, 21 Nov 2005 09:08:16 +0000 alpar UndirEulerIt added
Fri, 18 Nov 2005 11:17:08 +0000 alpar - Spellcheck (pathes->paths)
Fri, 18 Nov 2005 11:13:11 +0000 alpar - Spellcheck (pathes->paths)
Fri, 18 Nov 2005 11:10:53 +0000 alpar Bugfix
Thu, 17 Nov 2005 15:34:18 +0000 hegyi As initial value of a new map expression with ()+-/* operators can be given. These operators work on numbers, or on maps. If maps are given, then the new value for a given graph element will be calculated using the value from the given maps that belong to that graph element.
Thu, 17 Nov 2005 10:46:38 +0000 deba Bug fix
Thu, 17 Nov 2005 10:16:29 +0000 alpar split(Edge) member function added.
Thu, 17 Nov 2005 10:14:55 +0000 alpar Several bugfices.
Wed, 16 Nov 2005 18:58:10 +0000 deba Modified iterators on graph maps
Wed, 16 Nov 2005 14:46:22 +0000 marci The GRAPH_TYPEDEFS macro is a bug.
Wed, 16 Nov 2005 13:39:29 +0000 alpar wirteable -> writable
Wed, 16 Nov 2005 13:26:04 +0000 alpar Empty graph is (strongly) connected.
Wed, 16 Nov 2005 13:21:57 +0000 alpar The first parameter of runningTimeTest became const.
Wed, 16 Nov 2005 13:19:05 +0000 alpar Iterable Bool maps can count the number of true and false values.
Wed, 16 Nov 2005 13:17:02 +0000 alpar (UNDIR)GRAPH_TYPEDEFS also defines some basic graph maps
Wed, 16 Nov 2005 13:15:33 +0000 alpar Better doc.
Wed, 16 Nov 2005 09:15:41 +0000 deba Demo for topology
Wed, 16 Nov 2005 09:11:44 +0000 deba Images for doc
Wed, 16 Nov 2005 09:10:24 +0000 deba bipartite by szakall
Wed, 16 Nov 2005 09:08:36 +0000 deba Warning because unused parameters
Wed, 16 Nov 2005 05:01:04 +0000 klao lp_cplex: getDual compiles; untested
Wed, 16 Nov 2005 04:22:49 +0000 klao lp_test.cc:
Tue, 15 Nov 2005 20:51:06 +0000 klao lp_skeleton: _getDual "implemented"
Tue, 15 Nov 2005 20:50:21 +0000 klao bugfix in undir_graph_extender -> graph_extender transition
Mon, 14 Nov 2005 18:55:19 +0000 deba String->Double