athos [Mon, 17 Jul 2006 09:10:19 +0000] rev 2145
Sorry, mistake
athos [Mon, 17 Jul 2006 09:00:21 +0000] rev 2144
MIP support added (by Jano, the Great).
alpar [Mon, 17 Jul 2006 07:30:56 +0000] rev 2143
Even better...
athos [Mon, 17 Jul 2006 07:00:39 +0000] rev 2142
Some documentation got changed.
alpar [Fri, 14 Jul 2006 13:48:14 +0000] rev 2141
reference to modules added
alpar [Fri, 14 Jul 2006 13:11:18 +0000] rev 2140
Minor comment added.
alpar [Fri, 14 Jul 2006 10:51:14 +0000] rev 2139
Some updates and restructuring
alpar [Fri, 14 Jul 2006 10:50:05 +0000] rev 2138
glemon is in a separate repository.
deba [Fri, 14 Jul 2006 10:25:26 +0000] rev 2137
Using fixed bipartite graph
deba [Fri, 14 Jul 2006 09:37:48 +0000] rev 2136
Bug fix in MinCostMaxBipartiteMatching
The augmenting phase have not changed the
unreached nodes' potential which caused invalid
dual solution in some cases
alpar [Wed, 12 Jul 2006 11:40:52 +0000] rev 2135
Must have been changed because of the private copy constructor.
alpar [Wed, 12 Jul 2006 11:14:12 +0000] rev 2134
... and fix another one.
alpar [Wed, 12 Jul 2006 11:07:48 +0000] rev 2133
... and fix a stupid bug.
alpar [Wed, 12 Jul 2006 11:05:00 +0000] rev 2132
(Hopefully) finish privatizing the copy constr. and operator= in
the graph concept, ListGraph and SmartGraph.
ladanyi [Wed, 12 Jul 2006 10:49:17 +0000] rev 2131
New, less general installation instructions.
deba [Wed, 12 Jul 2006 10:38:11 +0000] rev 2130
Resolving: Bug #51
deba [Wed, 12 Jul 2006 10:34:07 +0000] rev 2129
Resolving: Bug #52
alpar [Tue, 11 Jul 2006 16:09:49 +0000] rev 2128
- Disable the copy constructor and operator= of {List|Smart}[U]Graph.
- Improve graph doc
- Also put private members into the doc (if they are documented)
ladanyi [Tue, 11 Jul 2006 15:50:19 +0000] rev 2127
Do not install the documentation if configure was called with --disable-doc.
deba [Tue, 11 Jul 2006 15:42:15 +0000] rev 2126
Renameing file: graph_component.h => graph_components.h
ladanyi [Tue, 11 Jul 2006 14:42:06 +0000] rev 2125
Removed references to the gui.
alpar [Tue, 11 Jul 2006 13:54:02 +0000] rev 2124
Use sed instead of rpl
alpar [Tue, 11 Jul 2006 13:51:52 +0000] rev 2123
Minor doc improvements
hegyi [Tue, 11 Jul 2006 12:37:53 +0000] rev 2122
README version one is added.
deba [Mon, 10 Jul 2006 19:04:17 +0000] rev 2121
Modifications in the Graph Component concepts
alpar [Wed, 05 Jul 2006 16:59:45 +0000] rev 2120
As we agreed, Node/Edge::operator<() is required by the concept
ladanyi [Tue, 04 Jul 2006 19:06:47 +0000] rev 2119
Distribute Makefiles.
ladanyi [Tue, 04 Jul 2006 18:53:24 +0000] rev 2118
Distribute Doxyfile.in and lemon.pc.in.
alpar [Tue, 04 Jul 2006 17:49:01 +0000] rev 2117
- Revised "Concepts" group documentation
- Other minor doc improvements
deba [Fri, 30 Jun 2006 12:15:45 +0000] rev 2116
Revert splitted files
deba [Fri, 30 Jun 2006 12:14:36 +0000] rev 2115
Splitted graph files
deba [Wed, 28 Jun 2006 16:27:44 +0000] rev 2114
new snapshot
deba [Wed, 28 Jun 2006 15:38:45 +0000] rev 2113
Some modification in the documentation.
deba [Wed, 28 Jun 2006 15:28:38 +0000] rev 2112
Make explicit constructors
deba [Wed, 28 Jun 2006 15:06:24 +0000] rev 2111
Removing concepts for extendable and erasable graphs
Renaming StaticGraph to Graph
deba [Mon, 26 Jun 2006 15:40:35 +0000] rev 2110
Smaller Simple Bucket Heap
- the list node does not store the value
- trade off: linear time operator[]
ladanyi [Thu, 22 Jun 2006 18:34:35 +0000] rev 2109
Set svn:ignore property.
ladanyi [Thu, 22 Jun 2006 18:20:25 +0000] rev 2108
Single makefile.
deba [Thu, 22 Jun 2006 15:16:11 +0000] rev 2107
Added reserveNode function.
ladanyi [Wed, 21 Jun 2006 11:15:01 +0000] rev 2106
Set props.
ladanyi [Wed, 21 Jun 2006 08:42:01 +0000] rev 2105
Moved the po directory to glemon/trunk.
ladanyi [Wed, 21 Jun 2006 08:39:28 +0000] rev 2104
Moved the gui to glemon/trunk.
ladanyi [Wed, 21 Jun 2006 08:35:23 +0000] rev 2103
Exclude the gui from the build.
athos [Tue, 20 Jun 2006 15:20:08 +0000] rev 2102
Slight changes in doc.
deba [Mon, 19 Jun 2006 13:44:06 +0000] rev 2101
Improvement:
The item sets are written in the order sorted by the labels.
It solves the problem if we read a graph from a file and
then write it back then the nodes will be reversed.
It can be switched off with the LemonWriter interface.
deba [Tue, 06 Jun 2006 12:47:01 +0000] rev 2100
Doc bug fix
readed => read
klao [Wed, 31 May 2006 16:48:31 +0000] rev 2099
benchmark: radix_sort-bench was not compiled
deba [Tue, 30 May 2006 10:33:50 +0000] rev 2098
Bug fix in the list bipartite undirected graph
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