Fri, 12 May 2006 09:57:03 +0000Bug fix
deba [Fri, 12 May 2006 09:57:03 +0000] rev 2080
Bug fix

Fri, 12 May 2006 09:56:14 +0000Remade SplitGraphAdaptor
deba [Fri, 12 May 2006 09:56:14 +0000] rev 2079
Remade SplitGraphAdaptor

Fri, 12 May 2006 09:54:58 +0000Revised Compile Time Arithmetic
deba [Fri, 12 May 2006 09:54:58 +0000] rev 2078
Revised Compile Time Arithmetic

Fri, 12 May 2006 09:52:28 +0000Two state Variant
deba [Fri, 12 May 2006 09:52:28 +0000] rev 2077
Two state Variant
+ Some Compile Time arithmetic

Fri, 12 May 2006 09:51:45 +0000Extenders modified
deba [Fri, 12 May 2006 09:51:45 +0000] rev 2076
Extenders modified

UGraphBaseExtender => UndirGraphExtender
BpUGraphBaseExtender merged into BpUGraphExtender

Tue, 09 May 2006 14:28:02 +0000Fixed typos.
athos [Tue, 09 May 2006 14:28:02 +0000] rev 2075
Fixed typos.

Tue, 09 May 2006 11:25:34 +0000Bug fix
deba [Tue, 09 May 2006 11:25:34 +0000] rev 2074
Bug fix

Do not delete the not constructed map

Tue, 09 May 2006 09:23:39 +0000- fix bug #43: static and const in Tolerance class
alpar [Tue, 09 May 2006 09:23:39 +0000] rev 2073
- fix bug #43: static and const in Tolerance class
- fix return value of nonZero()

Tue, 09 May 2006 09:21:48 +0000Create a separate group for matrices
alpar [Tue, 09 May 2006 09:21:48 +0000] rev 2072
Create a separate group for matrices

Tue, 09 May 2006 09:21:02 +0000Also install .gif files.
alpar [Tue, 09 May 2006 09:21:02 +0000] rev 2071
Also install .gif files.

Mon, 08 May 2006 17:03:52 +0000Getting Negative Cycle
deba [Mon, 08 May 2006 17:03:52 +0000] rev 2070
Getting Negative Cycle

Fri, 05 May 2006 10:48:58 +0000Bug fix: Using set instead reference assignment
deba [Fri, 05 May 2006 10:48:58 +0000] rev 2069
Bug fix: Using set instead reference assignment

Tue, 02 May 2006 18:23:42 +0000gLEMON does not compile with gtkmm 2.4.x
ladanyi [Tue, 02 May 2006 18:23:42 +0000] rev 2068
gLEMON does not compile with gtkmm 2.4.x

Thu, 27 Apr 2006 14:53:23 +0000Tabu Search by Szabadkai Mark
deba [Thu, 27 Apr 2006 14:53:23 +0000] rev 2067
Tabu Search by Szabadkai Mark

Thu, 27 Apr 2006 13:10:23 +0000added scrollbars to the canvas
ladanyi [Thu, 27 Apr 2006 13:10:23 +0000] rev 2066
added scrollbars to the canvas

Thu, 27 Apr 2006 12:20:09 +0000filter loop edges
ladanyi [Thu, 27 Apr 2006 12:20:09 +0000] rev 2065
filter loop edges

Tue, 25 Apr 2006 14:48:50 +0000Bug fix in findUEdge
deba [Tue, 25 Apr 2006 14:48:50 +0000] rev 2064
Bug fix in findUEdge

Tue, 18 Apr 2006 22:59:33 +0000id->label
ladanyi [Tue, 18 Apr 2006 22:59:33 +0000] rev 2063
id->label

Tue, 18 Apr 2006 13:25:41 +0000Also check mingw compatibility
alpar [Tue, 18 Apr 2006 13:25:41 +0000] rev 2062
Also check mingw compatibility

Tue, 18 Apr 2006 09:14:38 +0000Bug fix
deba [Tue, 18 Apr 2006 09:14:38 +0000] rev 2061
Bug fix

Add missing function

Tue, 18 Apr 2006 07:03:12 +0000Images into the algorithm groups
deba [Tue, 18 Apr 2006 07:03:12 +0000] rev 2060
Images into the algorithm groups

Tue, 18 Apr 2006 07:02:32 +0000Doc fix
deba [Tue, 18 Apr 2006 07:02:32 +0000] rev 2059
Doc fix

Tue, 18 Apr 2006 07:01:55 +0000Refinements in bipartite matching algorithms
deba [Tue, 18 Apr 2006 07:01:55 +0000] rev 2058
Refinements in bipartite matching algorithms

Fri, 14 Apr 2006 23:55:36 +0000added missing glibc2.m4
ladanyi [Fri, 14 Apr 2006 23:55:36 +0000] rev 2057
added missing glibc2.m4

Fri, 14 Apr 2006 22:01:02 +0000downgrade to gettext 0.14.2
ladanyi [Fri, 14 Apr 2006 22:01:02 +0000] rev 2056
downgrade to gettext 0.14.2

Fri, 14 Apr 2006 18:53:56 +0000po update
ladanyi [Fri, 14 Apr 2006 18:53:56 +0000] rev 2055
po update

Fri, 14 Apr 2006 18:35:55 +0000bugfix
ladanyi [Fri, 14 Apr 2006 18:35:55 +0000] rev 2054
bugfix

Fri, 14 Apr 2006 18:31:50 +0000distribute m4/*.m4
ladanyi [Fri, 14 Apr 2006 18:31:50 +0000] rev 2053
distribute m4/*.m4

Fri, 14 Apr 2006 18:31:16 +0000some reorganization
ladanyi [Fri, 14 Apr 2006 18:31:16 +0000] rev 2052
some reorganization

Fri, 14 Apr 2006 18:07:33 +0000MaxWeightedBipartiteMatching
deba [Fri, 14 Apr 2006 18:07:33 +0000] rev 2051
MaxWeightedBipartiteMatching
MinCostMaxBipartiteMatching

Both algorithms are based on successive shortest
path algorithm with dijkstra shortest path
finding

Fri, 14 Apr 2006 18:05:02 +0000Changing the mining of the clear in heaps
deba [Fri, 14 Apr 2006 18:05:02 +0000] rev 2050
Changing the mining of the clear in heaps
It does not touch the heap cross ref. It is
sometimes more clean useable and more efficient

Fri, 14 Apr 2006 15:05:51 +0000bugfix
ladanyi [Fri, 14 Apr 2006 15:05:51 +0000] rev 2049
bugfix