Tue, 29 Nov 2005 08:43:50 +0000Clarify INVALID implementation.
alpar [Tue, 29 Nov 2005 08:43:50 +0000] rev 1836
Clarify INVALID implementation.

Tue, 29 Nov 2005 08:40:03 +0000- tolerance.h added
alpar [Tue, 29 Nov 2005 08:40:03 +0000] rev 1835
- tolerance.h added
- tolerance handler added to preflow (but not yet used!!).

Mon, 28 Nov 2005 11:14:59 +0000Doc fix
deba [Mon, 28 Nov 2005 11:14:59 +0000] rev 1834
Doc fix

Mon, 28 Nov 2005 11:14:01 +0000Radix sort algorithm
deba [Mon, 28 Nov 2005 11:14:01 +0000] rev 1833
Radix sort algorithm

Thu, 24 Nov 2005 15:48:53 +0000Bug fix
deba [Thu, 24 Nov 2005 15:48:53 +0000] rev 1832
Bug fix

Wed, 23 Nov 2005 16:24:59 +0000No segmentation fault caused by zero long edges.
hegyi [Wed, 23 Nov 2005 16:24:59 +0000] rev 1831
No segmentation fault caused by zero long edges.

Wed, 23 Nov 2005 16:08:02 +0000Document improvments
deba [Wed, 23 Nov 2005 16:08:02 +0000] rev 1830
Document improvments

Wed, 23 Nov 2005 15:42:36 +0000Correcting alteration notifing
deba [Wed, 23 Nov 2005 15:42:36 +0000] rev 1829
Correcting alteration notifing

Wed, 23 Nov 2005 11:20:14 +0000Static maps for bipartite graphs.
deba [Wed, 23 Nov 2005 11:20:14 +0000] rev 1828
Static maps for bipartite graphs.

Tue, 22 Nov 2005 15:15:31 +0000Fixing bug in g++-3.3
deba [Tue, 22 Nov 2005 15:15:31 +0000] rev 1827
Fixing bug in g++-3.3

Tue, 22 Nov 2005 14:35:33 +0000clean-up
ladanyi [Tue, 22 Nov 2005 14:35:33 +0000] rev 1826
clean-up

Tue, 22 Nov 2005 10:27:25 +0000fixed some memory leaks
ladanyi [Tue, 22 Nov 2005 10:27:25 +0000] rev 1825
fixed some memory leaks

Mon, 21 Nov 2005 18:12:11 +0000Erasing old header
deba [Mon, 21 Nov 2005 18:12:11 +0000] rev 1824
Erasing old header
Correcting makefile

Mon, 21 Nov 2005 18:03:20 +0000NewMapWin 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.
hegyi [Mon, 21 Nov 2005 18:03:20 +0000] rev 1823
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 +0000Erasing from the Makefile.am too
deba [Mon, 21 Nov 2005 17:59:27 +0000] rev 1822
Erasing from the Makefile.am too

Mon, 21 Nov 2005 17:58:24 +0000Erasing old tests
deba [Mon, 21 Nov 2005 17:58:24 +0000] rev 1821
Erasing old tests

Mon, 21 Nov 2005 17:48:00 +0000Undir Bipartite Graph/Full and Smart/ without concept, doc and concept
deba [Mon, 21 Nov 2005 17:48:00 +0000] rev 1820
Undir Bipartite Graph/Full and Smart/ without concept, doc and concept
checking

Mon, 21 Nov 2005 12:07:05 +0000Reorganizing.
hegyi [Mon, 21 Nov 2005 12:07:05 +0000] rev 1819
Reorganizing.

Mon, 21 Nov 2005 09:08:16 +0000UndirEulerIt added
alpar [Mon, 21 Nov 2005 09:08:16 +0000] rev 1818
UndirEulerIt added

Fri, 18 Nov 2005 11:17:08 +0000- Spellcheck (pathes->paths)
alpar [Fri, 18 Nov 2005 11:17:08 +0000] rev 1817
- Spellcheck (pathes->paths)

Fri, 18 Nov 2005 11:13:11 +0000- Spellcheck (pathes->paths)
alpar [Fri, 18 Nov 2005 11:13:11 +0000] rev 1816
- Spellcheck (pathes->paths)
- todos

Fri, 18 Nov 2005 11:10:53 +0000Bugfix
alpar [Fri, 18 Nov 2005 11:10:53 +0000] rev 1815
Bugfix

Thu, 17 Nov 2005 15:34:18 +0000As 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.
hegyi [Thu, 17 Nov 2005 15:34:18 +0000] rev 1814
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 +0000Bug fix
deba [Thu, 17 Nov 2005 10:46:38 +0000] rev 1813
Bug fix