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
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
ladanyi [Fri, 14 Apr 2006 15:05:51 +0000] rev 2049
bugfix
ladanyi [Fri, 14 Apr 2006 14:57:59 +0000] rev 2048
make distcheck should work now
ladanyi [Thu, 13 Apr 2006 18:09:34 +0000] rev 2047
Removed a 0x00 byte which confused the file utility.
klao [Thu, 13 Apr 2006 17:57:03 +0000] rev 2046
more explicit :)
klao [Thu, 13 Apr 2006 17:22:17 +0000] rev 2045
path.h: bugfix, returning reference to a temporary
ladanyi [Wed, 12 Apr 2006 20:50:35 +0000] rev 2044
svn:ignore
ladanyi [Wed, 12 Apr 2006 20:38:22 +0000] rev 2043
revert to single configure scheme
deba [Fri, 07 Apr 2006 09:54:35 +0000] rev 2042
New Algorithm group for matchings
LaTeX formulas
Bug fix => ///\f$ will cause parsing error in doxygen
deba [Fri, 07 Apr 2006 09:52:30 +0000] rev 2041
Forgotten functions in the graph adaptor extenders.
deba [Fri, 07 Apr 2006 09:51:23 +0000] rev 2040
Bipartite Graph Max Cardinality Matching (Hopcroft-Karp)
Test for it
Some BpUgraph improvments