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