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

Fri, 14 Apr 2006 14:57:59 +0000make distcheck should work now
ladanyi [Fri, 14 Apr 2006 14:57:59 +0000] rev 2048
make distcheck should work now

Thu, 13 Apr 2006 18:09:34 +0000Removed a 0x00 byte which confused the file utility.
ladanyi [Thu, 13 Apr 2006 18:09:34 +0000] rev 2047
Removed a 0x00 byte which confused the file utility.

Thu, 13 Apr 2006 17:57:03 +0000more explicit :)
klao [Thu, 13 Apr 2006 17:57:03 +0000] rev 2046
more explicit :)

Thu, 13 Apr 2006 17:22:17 +0000path.h: bugfix, returning reference to a temporary
klao [Thu, 13 Apr 2006 17:22:17 +0000] rev 2045
path.h: bugfix, returning reference to a temporary

Wed, 12 Apr 2006 20:50:35 +0000svn:ignore
ladanyi [Wed, 12 Apr 2006 20:50:35 +0000] rev 2044
svn:ignore

Wed, 12 Apr 2006 20:38:22 +0000revert to single configure scheme
ladanyi [Wed, 12 Apr 2006 20:38:22 +0000] rev 2043
revert to single configure scheme

Fri, 07 Apr 2006 09:54:35 +0000New Algorithm group for matchings
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

Fri, 07 Apr 2006 09:52:30 +0000Forgotten functions in the graph adaptor extenders.
deba [Fri, 07 Apr 2006 09:52:30 +0000] rev 2041
Forgotten functions in the graph adaptor extenders.

Fri, 07 Apr 2006 09:51:23 +0000Bipartite Graph Max Cardinality Matching (Hopcroft-Karp)
deba [Fri, 07 Apr 2006 09:51:23 +0000] rev 2040
Bipartite Graph Max Cardinality Matching (Hopcroft-Karp)
Test for it

Some BpUgraph improvments

Thu, 06 Apr 2006 09:33:29 +0000Commiting The DynamicAsymMatrixMap from Nagy Jano
deba [Thu, 06 Apr 2006 09:33:29 +0000] rev 2039
Commiting The DynamicAsymMatrixMap from Nagy Jano
+ MatrixMapTraits

Tue, 04 Apr 2006 17:45:35 +0000LinearHeap is renamed to BucketHeap which is more conform
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

Tue, 04 Apr 2006 17:43:23 +0000Doxygen log corrections
deba [Tue, 04 Apr 2006 17:43:23 +0000] rev 2037
Doxygen log corrections

doc of ResGraphAdaptor has a bug in graph_adaptor.h

Tue, 04 Apr 2006 10:40:02 +0000The algorithm does not change the capacity and the flow in the resgraph
deba [Tue, 04 Apr 2006 10:40:02 +0000] rev 2036
The algorithm does not change the capacity and the flow in the resgraph

Mon, 03 Apr 2006 19:47:37 +0000More mingw compatibility
deba [Mon, 03 Apr 2006 19:47:37 +0000] rev 2035
More mingw compatibility

Implementation of the drand48 functions

Mon, 03 Apr 2006 16:34:23 +0000Edmonds-Karp MaxFlow
deba [Mon, 03 Apr 2006 16:34:23 +0000] rev 2034
Edmonds-Karp MaxFlow
ResGraphAdaptor with Tolerance

Mon, 03 Apr 2006 16:05:26 +0000Small corrections
deba [Mon, 03 Apr 2006 16:05:26 +0000] rev 2033
Small corrections

Mon, 03 Apr 2006 16:03:37 +0000Writeable extension of some maps
deba [Mon, 03 Apr 2006 16:03:37 +0000] rev 2032
Writeable extension of some maps

Mon, 03 Apr 2006 09:45:23 +0000Correcting the structure of the graph's and adaptor's map.
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.

Mon, 03 Apr 2006 09:24:38 +0000Naming convention fix
deba [Mon, 03 Apr 2006 09:24:38 +0000] rev 2030
Naming convention fix

Mon, 03 Apr 2006 08:41:52 +0000Count ANodes-BNodes
deba [Mon, 03 Apr 2006 08:41:52 +0000] rev 2029
Count ANodes-BNodes

Fri, 31 Mar 2006 12:51:44 +0000MinGW32 compatibility
deba [Fri, 31 Mar 2006 12:51:44 +0000] rev 2028
MinGW32 compatibility

Fri, 31 Mar 2006 12:12:06 +0000MinGW compatibility fix
deba [Fri, 31 Mar 2006 12:12:06 +0000] rev 2027
MinGW compatibility fix

Fri, 31 Mar 2006 12:04:48 +0000NaN checking to be conform to MinGW32
deba [Fri, 31 Mar 2006 12:04:48 +0000] rev 2026
NaN checking to be conform to MinGW32

Fri, 31 Mar 2006 11:10:44 +0000Bugfix in the minimum cost arborescence algorithm
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

Thu, 30 Mar 2006 15:34:56 +0000tolerance class incorporated
jacint [Thu, 30 Mar 2006 15:34:56 +0000] rev 2024
tolerance class incorporated

Thu, 30 Mar 2006 15:02:11 +0000Unionfind changes induced some bugs here. Also some augmentations made.
jacint [Thu, 30 Mar 2006 15:02:11 +0000] rev 2023
Unionfind changes induced some bugs here. Also some augmentations made.

Thu, 30 Mar 2006 09:42:05 +0000docfix
alpar [Thu, 30 Mar 2006 09:42:05 +0000] rev 2022
docfix

Thu, 30 Mar 2006 09:36:33 +0000IncEdgeIt goes through on loop edges twice.
deba [Thu, 30 Mar 2006 09:36:33 +0000] rev 2021
IncEdgeIt goes through on loop edges twice.

Thu, 30 Mar 2006 08:38:41 +0000Rewritten countItems and findEdges
deba [Thu, 30 Mar 2006 08:38:41 +0000] rev 2020
Rewritten countItems and findEdges

Mon, 27 Mar 2006 16:25:14 +0000Adding todo to preflow
deba [Mon, 27 Mar 2006 16:25:14 +0000] rev 2019
Adding todo to preflow
Some naming convention renamings

Mon, 27 Mar 2006 16:09:54 +0000missing ignore
klao [Mon, 27 Mar 2006 16:09:54 +0000] rev 2018
missing ignore

Mon, 27 Mar 2006 08:12:01 +0000Minimum Cost Arborescence algorithm
deba [Mon, 27 Mar 2006 08:12:01 +0000] rev 2017
Minimum Cost Arborescence algorithm

Mon, 27 Mar 2006 08:01:10 +0000Doc rearrangement
deba [Mon, 27 Mar 2006 08:01:10 +0000] rev 2016
Doc rearrangement
Section readers moved to own group

Fri, 24 Mar 2006 20:27:42 +0000bootstrap: quiet option
klao [Fri, 24 Mar 2006 20:27:42 +0000] rev 2015
bootstrap: quiet option

Thu, 23 Mar 2006 20:43:25 +0000ignore generated files
ladanyi [Thu, 23 Mar 2006 20:43:25 +0000] rev 2014
ignore generated files

Thu, 23 Mar 2006 20:42:37 +0000include fixes
ladanyi [Thu, 23 Mar 2006 20:42:37 +0000] rev 2013
include fixes

Thu, 23 Mar 2006 19:57:14 +0000- added gettext infrastructure to the gui
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

Tue, 21 Mar 2006 13:45:24 +0000Renaming files
deba [Tue, 21 Mar 2006 13:45:24 +0000] rev 2011
Renaming files

Fri, 17 Mar 2006 15:54:02 +0000unused parameters fix
klao [Fri, 17 Mar 2006 15:54:02 +0000] rev 2010
unused parameters fix

Thu, 16 Mar 2006 13:52:12 +0000rethrow fix
klao [Thu, 16 Mar 2006 13:52:12 +0000] rev 2009
rethrow fix

Wed, 15 Mar 2006 09:45:59 +0000"Node shapes" added
alpar [Wed, 15 Mar 2006 09:45:59 +0000] rev 2008
"Node shapes" added

Wed, 15 Mar 2006 09:45:10 +0000Also check gcc-4.1
alpar [Wed, 15 Mar 2006 09:45:10 +0000] rev 2007
Also check gcc-4.1

Wed, 15 Mar 2006 09:44:17 +0000Spellcheck
alpar [Wed, 15 Mar 2006 09:44:17 +0000] rev 2006
Spellcheck

Fri, 10 Mar 2006 19:34:47 +0000unionfind_test: double erase is not supported anymore
klao [Fri, 10 Mar 2006 19:34:47 +0000] rev 2005
unionfind_test: double erase is not supported anymore

Fri, 10 Mar 2006 18:17:37 +0000UnionFindEnum: one remaining bug; removing commented out code
klao [Fri, 10 Mar 2006 18:17:37 +0000] rev 2004
UnionFindEnum: one remaining bug; removing commented out code

Fri, 10 Mar 2006 18:06:26 +0000UnionFindEnum revision:
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

Wed, 08 Mar 2006 13:10:43 +0000Omitting warning
deba [Wed, 08 Mar 2006 13:10:43 +0000] rev 2002
Omitting warning

Tue, 07 Mar 2006 11:06:57 +0000Removing obsolote "id" map handling
deba [Tue, 07 Mar 2006 11:06:57 +0000] rev 2001
Removing obsolote "id" map handling
Error message is modified

Mon, 06 Mar 2006 17:32:35 +0000Checking missing section reader
deba [Mon, 06 Mar 2006 17:32:35 +0000] rev 2000
Checking missing section reader