ladanyi [Sun, 21 May 2006 22:18:57 +0000] rev 2097
Gettext is needed for bootstrapping.
deba [Thu, 18 May 2006 16:13:44 +0000] rev 2096
Bug fix
alpar [Thu, 18 May 2006 10:24:14 +0000] rev 2095
Bugfix
alpar [Thu, 18 May 2006 09:32:36 +0000] rev 2094
Spellcheck
deba [Thu, 18 May 2006 08:12:54 +0000] rev 2093
Erasing some code from the examples
deba [Thu, 18 May 2006 08:04:51 +0000] rev 2092
Erasing unused parameter names
Omitting Warning
deba [Thu, 18 May 2006 08:04:00 +0000] rev 2091
Functor usage for writeable map adaptors
Documentation for writeable map adaptors
alpar [Wed, 17 May 2006 11:05:34 +0000] rev 2090
Docfix
deba [Wed, 17 May 2006 09:07:24 +0000] rev 2089
SimpleBucketHeap added
It does not supports erasing, decreasing, increasing.
It contains single linked lists
It can be used to store levels for push-relabel algorithms
alpar [Wed, 17 May 2006 05:54:24 +0000] rev 2088
Fix Bug #45: Missing include
deba [Tue, 16 May 2006 17:13:42 +0000] rev 2087
DirUGraphAdaptor documentation
alpar [Tue, 16 May 2006 16:59:57 +0000] rev 2086
Polinomial template class
deba [Mon, 15 May 2006 16:21:50 +0000] rev 2085
Bug fix by Jano
deba [Mon, 15 May 2006 09:49:51 +0000] rev 2084
Documentation improvements
Rearrangements:
IO modules
Algorithms
New documentation:
SwapBpUGraphAdaptor
Demos:
strongly_connected_orientation.cc
Benchmarks:
swap_bipartite_bench.cc
deba [Mon, 15 May 2006 09:46:33 +0000] rev 2083
Writing only not empty sections
deba [Mon, 15 May 2006 09:44:35 +0000] rev 2082
Bug fix
deba [Fri, 12 May 2006 15:29:42 +0000] rev 2081
New demo file for computing disjoint paths
Doc review
Correcting misformatting in adaptors
Adding header to demos
deba [Fri, 12 May 2006 09:57:03 +0000] rev 2080
Bug fix
deba [Fri, 12 May 2006 09:56:14 +0000] rev 2079
Remade SplitGraphAdaptor
deba [Fri, 12 May 2006 09:54:58 +0000] rev 2078
Revised Compile Time Arithmetic
deba [Fri, 12 May 2006 09:52:28 +0000] rev 2077
Two state Variant
+ Some Compile Time arithmetic
deba [Fri, 12 May 2006 09:51:45 +0000] rev 2076
Extenders modified
UGraphBaseExtender => UndirGraphExtender
BpUGraphBaseExtender merged into BpUGraphExtender
athos [Tue, 09 May 2006 14:28:02 +0000] rev 2075
Fixed typos.
deba [Tue, 09 May 2006 11:25:34 +0000] rev 2074
Bug fix
Do not delete the not constructed map
alpar [Tue, 09 May 2006 09:23:39 +0000] rev 2073
- fix bug #43: static and const in Tolerance class
- fix return value of nonZero()
alpar [Tue, 09 May 2006 09:21:48 +0000] rev 2072
Create a separate group for matrices
alpar [Tue, 09 May 2006 09:21:02 +0000] rev 2071
Also install .gif files.
deba [Mon, 08 May 2006 17:03:52 +0000] rev 2070
Getting Negative Cycle
deba [Fri, 05 May 2006 10:48:58 +0000] rev 2069
Bug fix: Using set instead reference assignment
ladanyi [Tue, 02 May 2006 18:23:42 +0000] rev 2068
gLEMON does not compile with gtkmm 2.4.x
deba [Thu, 27 Apr 2006 14:53:23 +0000] rev 2067
Tabu Search by Szabadkai Mark
ladanyi [Thu, 27 Apr 2006 13:10:23 +0000] rev 2066
added scrollbars to the canvas
ladanyi [Thu, 27 Apr 2006 12:20:09 +0000] rev 2065
filter loop edges
deba [Tue, 25 Apr 2006 14:48:50 +0000] rev 2064
Bug fix in findUEdge
ladanyi [Tue, 18 Apr 2006 22:59:33 +0000] rev 2063
id->label
alpar [Tue, 18 Apr 2006 13:25:41 +0000] rev 2062
Also check mingw compatibility
deba [Tue, 18 Apr 2006 09:14:38 +0000] rev 2061
Bug fix
Add missing function
deba [Tue, 18 Apr 2006 07:03:12 +0000] rev 2060
Images into the algorithm groups
deba [Tue, 18 Apr 2006 07:02:32 +0000] rev 2059
Doc fix
deba [Tue, 18 Apr 2006 07:01:55 +0000] rev 2058
Refinements in bipartite matching algorithms
ladanyi [Fri, 14 Apr 2006 23:55:36 +0000] rev 2057
added missing glibc2.m4
ladanyi [Fri, 14 Apr 2006 22:01:02 +0000] rev 2056
downgrade to gettext 0.14.2
ladanyi [Fri, 14 Apr 2006 18:53:56 +0000] rev 2055
po update
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