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