ladanyi [Fri, 14 Apr 2006 18:35:55 +0000] rev 2054
bugfix
ladanyi [Fri, 14 Apr 2006 18:31:50 +0000] rev 2053
distribute m4/*.m4
ladanyi [Fri, 14 Apr 2006 18:31:16 +0000] rev 2052
some reorganization
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
deba [Thu, 06 Apr 2006 09:33:29 +0000] rev 2039
Commiting The DynamicAsymMatrixMap from Nagy Jano
+ MatrixMapTraits
deba [Tue, 04 Apr 2006 17:45:35 +0000] rev 2038
LinearHeap is renamed to BucketHeap which is more conform
and widely used name for this data structure
deba [Tue, 04 Apr 2006 17:43:23 +0000] rev 2037
Doxygen log corrections
doc of ResGraphAdaptor has a bug in graph_adaptor.h
deba [Tue, 04 Apr 2006 10:40:02 +0000] rev 2036
The algorithm does not change the capacity and the flow in the resgraph
deba [Mon, 03 Apr 2006 19:47:37 +0000] rev 2035
More mingw compatibility
Implementation of the drand48 functions
deba [Mon, 03 Apr 2006 16:34:23 +0000] rev 2034
Edmonds-Karp MaxFlow
ResGraphAdaptor with Tolerance
deba [Mon, 03 Apr 2006 16:05:26 +0000] rev 2033
Small corrections
deba [Mon, 03 Apr 2006 16:03:37 +0000] rev 2032
Writeable extension of some maps
deba [Mon, 03 Apr 2006 09:45:23 +0000] rev 2031
Correcting the structure of the graph's and adaptor's map.
The template assign operators and map iterators can be used for adaptors also.
Some bugfix in the adaptors
New class SwapBpUGraphAdaptor which swaps the two nodeset of the graph.
deba [Mon, 03 Apr 2006 09:24:38 +0000] rev 2030
Naming convention fix
deba [Mon, 03 Apr 2006 08:41:52 +0000] rev 2029
Count ANodes-BNodes
deba [Fri, 31 Mar 2006 12:51:44 +0000] rev 2028
MinGW32 compatibility
deba [Fri, 31 Mar 2006 12:12:06 +0000] rev 2027
MinGW compatibility fix
deba [Fri, 31 Mar 2006 12:04:48 +0000] rev 2026
NaN checking to be conform to MinGW32
deba [Fri, 31 Mar 2006 11:10:44 +0000] rev 2025
Bugfix in the minimum cost arborescence algorithm
Dual solution computation and interface for algorithm
Optimality test on random graph
jacint [Thu, 30 Mar 2006 15:34:56 +0000] rev 2024
tolerance class incorporated
jacint [Thu, 30 Mar 2006 15:02:11 +0000] rev 2023
Unionfind changes induced some bugs here. Also some augmentations made.
alpar [Thu, 30 Mar 2006 09:42:05 +0000] rev 2022
docfix
deba [Thu, 30 Mar 2006 09:36:33 +0000] rev 2021
IncEdgeIt goes through on loop edges twice.
deba [Thu, 30 Mar 2006 08:38:41 +0000] rev 2020
Rewritten countItems and findEdges
deba [Mon, 27 Mar 2006 16:25:14 +0000] rev 2019
Adding todo to preflow
Some naming convention renamings
klao [Mon, 27 Mar 2006 16:09:54 +0000] rev 2018
missing ignore
deba [Mon, 27 Mar 2006 08:12:01 +0000] rev 2017
Minimum Cost Arborescence algorithm
deba [Mon, 27 Mar 2006 08:01:10 +0000] rev 2016
Doc rearrangement
Section readers moved to own group
klao [Fri, 24 Mar 2006 20:27:42 +0000] rev 2015
bootstrap: quiet option
ladanyi [Thu, 23 Mar 2006 20:43:25 +0000] rev 2014
ignore generated files
ladanyi [Thu, 23 Mar 2006 20:42:37 +0000] rev 2013
include fixes
ladanyi [Thu, 23 Mar 2006 19:57:14 +0000] rev 2012
- added gettext infrastructure to the gui
- the gui has a separate configure script now
- other minor changes
deba [Tue, 21 Mar 2006 13:45:24 +0000] rev 2011
Renaming files
klao [Fri, 17 Mar 2006 15:54:02 +0000] rev 2010
unused parameters fix
klao [Thu, 16 Mar 2006 13:52:12 +0000] rev 2009
rethrow fix
alpar [Wed, 15 Mar 2006 09:45:59 +0000] rev 2008
"Node shapes" added
alpar [Wed, 15 Mar 2006 09:45:10 +0000] rev 2007
Also check gcc-4.1
alpar [Wed, 15 Mar 2006 09:44:17 +0000] rev 2006
Spellcheck
klao [Fri, 10 Mar 2006 19:34:47 +0000] rev 2005
unionfind_test: double erase is not supported anymore
klao [Fri, 10 Mar 2006 18:17:37 +0000] rev 2004
UnionFindEnum: one remaining bug; removing commented out code
klao [Fri, 10 Mar 2006 18:06:26 +0000] rev 2003
UnionFindEnum revision:
* 0 is _not_ convertible to list<...>::iterator, so we have to use other means
to define/check validity
* standard LEMON iterator interface for ClassIt and ItemIt
deba [Wed, 08 Mar 2006 13:10:43 +0000] rev 2002
Omitting warning
deba [Tue, 07 Mar 2006 11:06:57 +0000] rev 2001
Removing obsolote "id" map handling
Error message is modified
deba [Mon, 06 Mar 2006 17:32:35 +0000] rev 2000
Checking missing section reader
deba [Mon, 06 Mar 2006 10:28:37 +0000] rev 1999
Clarifing alteration observing system
It is directly connected now to a container