Wed, 04 Jan 2006 13:19:12 +0000 alpar IterableBool{Upper/Lower}NodeMaps
Wed, 04 Jan 2006 11:41:58 +0000 hegyi Best feature ever\! Name of tabs are different from now on\!
Tue, 03 Jan 2006 17:30:22 +0000 hegyi Coding of Algorithms has begun, but code is really-really ugly yet.
Tue, 03 Jan 2006 16:05:27 +0000 deba Delete misnamed file
Tue, 03 Jan 2006 14:56:45 +0000 hegyi Handling of tabs is rationalized a bit. More than one file can be given at startup in command prompt. If there is no file given in command prompt, an empty tab will be present at startup.
Wed, 21 Dec 2005 08:47:38 +0000 deba Bug fix in bipartite graph
Mon, 19 Dec 2005 16:59:05 +0000 ladanyi Fix crash when the input file does not contain any nodeset or edgeset.
Mon, 19 Dec 2005 14:58:09 +0000 deba New file and data structures: sub_graph
Mon, 19 Dec 2005 09:47:10 +0000 deba Doc fix
Mon, 19 Dec 2005 09:43:13 +0000 deba Fixing Bellman's name
Sun, 18 Dec 2005 03:01:53 +0000 ladanyi Demos and benchmarks are not built by default now. They can be enabled with the --enable-demo and --enable-benchmark configure flags.
Sun, 18 Dec 2005 01:51:03 +0000 ladanyi Added guipixbufs.h to BUILT_SOURCES. This solves 'make dist' problems.
Sat, 17 Dec 2005 21:51:10 +0000 ladanyi Distribute xml.h too.
Sat, 17 Dec 2005 20:55:41 +0000 ladanyi Save and load the coordinates of the arrows on the edges.
Wed, 14 Dec 2005 18:11:03 +0000 deba Bug fix
Wed, 14 Dec 2005 18:07:28 +0000 deba Bug fix in def pred map
Sat, 10 Dec 2005 19:38:53 +0000 klao belmann_ford:
Thu, 08 Dec 2005 14:16:08 +0000 hegyi Notebook tabs can be closed.
Wed, 07 Dec 2005 15:43:44 +0000 alpar Eliminate warnins
Wed, 07 Dec 2005 15:40:27 +0000 alpar Bugfix
Wed, 07 Dec 2005 15:39:48 +0000 alpar Fix template version of Invalid.
Wed, 07 Dec 2005 11:57:30 +0000 deba Some bug fixes and improvments in the io classes
Tue, 06 Dec 2005 18:44:26 +0000 alpar Doc improvements
Tue, 06 Dec 2005 11:59:44 +0000 marci Bugfix
Tue, 06 Dec 2005 10:53:38 +0000 hegyi Notebook style is provided. Without opportunity to close tabs. :-) But with all other necessary things (I think).
Mon, 05 Dec 2005 17:03:58 +0000 deba Doc bug fix
Mon, 05 Dec 2005 17:03:31 +0000 alpar - Changed and improved Timer interface
Sat, 03 Dec 2005 18:30:31 +0000 deba I have forgot the attributes
Sat, 03 Dec 2005 18:17:29 +0000 deba Implementation redesign
Sat, 03 Dec 2005 18:15:43 +0000 deba Changed implementation and bug fix
Fri, 02 Dec 2005 10:02:40 +0000 alpar bugfix
Thu, 01 Dec 2005 15:08:46 +0000 deba NewEdgeSetAdaptor -> ListEdgeSet
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.