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

Mon, 06 Mar 2006 10:28:37 +0000Clarifing alteration observing system
deba [Mon, 06 Mar 2006 10:28:37 +0000] rev 1999
Clarifing alteration observing system
It is directly connected now to a container

Mon, 06 Mar 2006 09:38:19 +0000Bugfix in the hyper map
deba [Mon, 06 Mar 2006 09:38:19 +0000] rev 1998
Bugfix in the hyper map

Fri, 03 Mar 2006 21:49:39 +0000Bugfix: an ugly artefact of the 'id' -> 'label' renaming
klao [Fri, 03 Mar 2006 21:49:39 +0000] rev 1997
Bugfix: an ugly artefact of the 'id' -> 'label' renaming

Fri, 03 Mar 2006 12:35:32 +0000Some documentation arrangement modification
deba [Fri, 03 Mar 2006 12:35:32 +0000] rev 1996
Some documentation arrangement modification

Thu, 02 Mar 2006 14:22:03 +0000Bugfix in bpugraph
deba [Thu, 02 Mar 2006 14:22:03 +0000] rev 1995
Bugfix in bpugraph

Wed, 01 Mar 2006 17:37:25 +0000bugfix: moving "invalid.h" down to "bits" broke autoconf
klao [Wed, 01 Mar 2006 17:37:25 +0000] rev 1994
bugfix: moving "invalid.h" down to "bits" broke autoconf

Wed, 01 Mar 2006 13:19:28 +0000utility, invalid and traits moved to bits
deba [Wed, 01 Mar 2006 13:19:28 +0000] rev 1993
utility, invalid and traits moved to bits

Wed, 01 Mar 2006 12:46:52 +0000UNDIRGRAPH_TYPEDEFS => UGRAPH_TYPEDEFS
deba [Wed, 01 Mar 2006 12:46:52 +0000] rev 1992
UNDIRGRAPH_TYPEDEFS => UGRAPH_TYPEDEFS

Wed, 01 Mar 2006 10:25:30 +0000The graph adadptors can be alteration observed.
deba [Wed, 01 Mar 2006 10:25:30 +0000] rev 1991
The graph adadptors can be alteration observed.
In most cases it uses the adapted graph alteration notifiers.
Only special case is now the UndirGraphAdaptor, where
we have to proxy the signals from the graph.

The SubBidirGraphAdaptor is removed, because it doest not
gives more feature than the EdgeSubGraphAdaptor<UndirGraphAdaptor<Graph>>.

The ResGraphAdaptor is based on this composition.

Wed, 01 Mar 2006 10:17:25 +0000Some classes assumed that the GraphMaps should be inherited
deba [Wed, 01 Mar 2006 10:17:25 +0000] rev 1990
Some classes assumed that the GraphMaps should be inherited
from an ObserverBase. These classes parents replaced with
DefaultMap which cause that the graph maps should not be
inherited from the ObserverBase.

Wed, 01 Mar 2006 10:04:47 +0000Traits for alteration notifiers
deba [Wed, 01 Mar 2006 10:04:47 +0000] rev 1989
Traits for alteration notifiers
SplitGraph is temporarly deleted

Wed, 01 Mar 2006 09:40:16 +0000Bug fix
deba [Wed, 01 Mar 2006 09:40:16 +0000] rev 1988
Bug fix

Mon, 27 Feb 2006 15:43:25 +0000Default constructor which allocates empty graphs
deba [Mon, 27 Feb 2006 15:43:25 +0000] rev 1987
Default constructor which allocates empty graphs

Mon, 27 Feb 2006 10:36:01 +0000An additional simplier interface for static size graphs.
deba [Mon, 27 Feb 2006 10:36:01 +0000] rev 1986
An additional simplier interface for static size graphs.
Node operator()(int) for getting node by index
int index(Node node) for getting index by node

Mon, 27 Feb 2006 10:17:33 +0000Bug fix
deba [Mon, 27 Feb 2006 10:17:33 +0000] rev 1985
Bug fix

Fri, 24 Feb 2006 11:13:09 +0000Bug fix
deba [Fri, 24 Feb 2006 11:13:09 +0000] rev 1984
Bug fix

Fri, 24 Feb 2006 11:02:11 +0000Bugfix
deba [Fri, 24 Feb 2006 11:02:11 +0000] rev 1983
Bugfix

Thu, 23 Feb 2006 15:10:45 +0000ListBpUGraph
deba [Thu, 23 Feb 2006 15:10:45 +0000] rev 1982
ListBpUGraph

Thu, 23 Feb 2006 09:03:18 +0000Little bugfixes, spellchecks and improvements
deba [Thu, 23 Feb 2006 09:03:18 +0000] rev 1981
Little bugfixes, spellchecks and improvements

Thu, 23 Feb 2006 08:55:54 +0000Renaming to be convient to the naming of the adaptors
deba [Thu, 23 Feb 2006 08:55:54 +0000] rev 1980
Renaming to be convient to the naming of the adaptors
Concept checking of the ugraph adaptors

Wed, 22 Feb 2006 18:26:56 +0000Mergeing extendermerge branch
deba [Wed, 22 Feb 2006 18:26:56 +0000] rev 1979
Mergeing extendermerge branch
Changes:
the extender system
resize for static size graph
UGraphExtender => UndirectGraphExtender
UGraphExtenders with changed meaning
Some UGraphExtender /SubUGraphExtenders, DirectUGraphExtender/
GridGraph => GridUGraph
radix sort to ansi compatible

Wed, 22 Feb 2006 12:45:59 +0000vmap.h: Enables one to create maps with a virtual base class.
alpar [Wed, 22 Feb 2006 12:45:59 +0000] rev 1978
vmap.h: Enables one to create maps with a virtual base class.

Tue, 21 Feb 2006 12:37:00 +0000RefPtr: a reference counted pointer class
alpar [Tue, 21 Feb 2006 12:37:00 +0000] rev 1977
RefPtr: a reference counted pointer class

Tue, 21 Feb 2006 08:48:11 +0000Fix bug #26: Check if an edge is a loop and do not draw then
alpar [Tue, 21 Feb 2006 08:48:11 +0000] rev 1976
Fix bug #26: Check if an edge is a loop and do not draw then

Mon, 20 Feb 2006 09:40:07 +0000Second renaming of min cut
deba [Mon, 20 Feb 2006 09:40:07 +0000] rev 1975
Second renaming of min cut

Minimum => Min
Work => Aux

Mon, 20 Feb 2006 06:44:07 +0000Public data members of xy became documented
alpar [Mon, 20 Feb 2006 06:44:07 +0000] rev 1974
Public data members of xy became documented

Mon, 20 Feb 2006 06:43:08 +0000Spellchecking
alpar [Mon, 20 Feb 2006 06:43:08 +0000] rev 1973
Spellchecking

Mon, 20 Feb 2006 06:42:29 +0000Dewarningification
alpar [Mon, 20 Feb 2006 06:42:29 +0000] rev 1972
Dewarningification

Mon, 20 Feb 2006 06:41:12 +0000- RGB color related stuff is in color.h now
alpar [Mon, 20 Feb 2006 06:41:12 +0000] rev 1971
- RGB color related stuff is in color.h now
- eps.h: A simple class to create .eps figures (demo: eps_demo.h)

Mon, 20 Feb 2006 06:38:18 +0000Doc changes
alpar [Mon, 20 Feb 2006 06:38:18 +0000] rev 1970
Doc changes

Mon, 20 Feb 2006 06:32:15 +0000One more step towards Undir -> U conversion...
alpar [Mon, 20 Feb 2006 06:32:15 +0000] rev 1969
One more step towards Undir -> U conversion...

Tue, 14 Feb 2006 10:41:16 +0000Name modification
deba [Tue, 14 Feb 2006 10:41:16 +0000] rev 1968
Name modification

Mon, 13 Feb 2006 09:42:53 +0000New algorithm:
deba [Mon, 13 Feb 2006 09:42:53 +0000] rev 1967
New algorithm:
MaxCardinalitySearch
MinimalCut // in UGraph

Tue, 07 Feb 2006 09:32:55 +0000Easier checking in DEBUG mode
deba [Tue, 07 Feb 2006 09:32:55 +0000] rev 1966
Easier checking in DEBUG mode

I hope we should not test ArrayMap longer

The vector map checks its limits in debug mode what
helps us to find the bad memory accesses in the maps

Tue, 07 Feb 2006 09:20:47 +0000Compilation with G++ -ansi
deba [Tue, 07 Feb 2006 09:20:47 +0000] rev 1965
Compilation with G++ -ansi

Mon, 06 Feb 2006 20:32:29 +0000Bug fix
deba [Mon, 06 Feb 2006 20:32:29 +0000] rev 1964
Bug fix

Mon, 06 Feb 2006 17:00:41 +0000Bug fix
deba [Mon, 06 Feb 2006 17:00:41 +0000] rev 1963
Bug fix

Mon, 06 Feb 2006 16:58:39 +0000Bug fixes in ListEdgeSet
deba [Mon, 06 Feb 2006 16:58:39 +0000] rev 1962
Bug fixes in ListEdgeSet
Added SmartEdgeSet

Mon, 06 Feb 2006 15:52:32 +0000Bug fix
deba [Mon, 06 Feb 2006 15:52:32 +0000] rev 1961
Bug fix

Mon, 06 Feb 2006 09:11:53 +0000- Increased max. number of iteration
alpar [Mon, 06 Feb 2006 09:11:53 +0000] rev 1960
- Increased max. number of iteration
- Better tests.

Mon, 06 Feb 2006 09:10:43 +0000Spellcheck
alpar [Mon, 06 Feb 2006 09:10:43 +0000] rev 1959
Spellcheck

Fri, 03 Feb 2006 17:32:25 +0000- svn lock doesn't work lemon-0.5
alpar [Fri, 03 Feb 2006 17:32:25 +0000] rev 1958
- svn lock doesn't work
- fix bootstrap switch

Fri, 03 Feb 2006 17:21:21 +0000Last struggle against Doxygen.
alpar [Fri, 03 Feb 2006 17:21:21 +0000] rev 1957
Last struggle against Doxygen.

Fri, 03 Feb 2006 16:40:16 +0000Unified copyright notices
alpar [Fri, 03 Feb 2006 16:40:16 +0000] rev 1956
Unified copyright notices

Fri, 03 Feb 2006 16:11:08 +0000Change the compilation flag at release make distcheck.
alpar [Fri, 03 Feb 2006 16:11:08 +0000] rev 1955
Change the compilation flag at release make distcheck.
(This setting is probably indifferent, though.)

Fri, 03 Feb 2006 16:00:36 +0000Minor change.
alpar [Fri, 03 Feb 2006 16:00:36 +0000] rev 1954
Minor change.

Fri, 03 Feb 2006 15:58:24 +0000Polish the doc.
alpar [Fri, 03 Feb 2006 15:58:24 +0000] rev 1953
Polish the doc.

Fri, 03 Feb 2006 14:22:45 +0000graph_adaptor.h: spacing corrections in doc
klao [Fri, 03 Feb 2006 14:22:45 +0000] rev 1952
graph_adaptor.h: spacing corrections in doc

Fri, 03 Feb 2006 14:07:52 +0000graph_adaptor.h: probably a doxygen bug: in tex formulas there should be
klao [Fri, 03 Feb 2006 14:07:52 +0000] rev 1951
graph_adaptor.h: probably a doxygen bug: in tex formulas there should be
whitespace after the opening and before the closing \f$

Fri, 03 Feb 2006 12:20:10 +0000lp_cplex.cc: bugfix in _setColName, _getColName implemented
klao [Fri, 03 Feb 2006 12:20:10 +0000] rev 1950
lp_cplex.cc: bugfix in _setColName, _getColName implemented

Fri, 03 Feb 2006 09:18:17 +0000Fight with Doxygen.
alpar [Fri, 03 Feb 2006 09:18:17 +0000] rev 1949
Fight with Doxygen.
Victory hasn't been reached yet, but it's on the horizon.

Fri, 03 Feb 2006 09:03:05 +0000Hopefully we can release 0.5 today
alpar [Fri, 03 Feb 2006 09:03:05 +0000] rev 1948
Hopefully we can release 0.5 today

Thu, 02 Feb 2006 18:13:18 +0000minor changes
alpar [Thu, 02 Feb 2006 18:13:18 +0000] rev 1947
minor changes

Thu, 02 Feb 2006 17:43:24 +0000- workaround for a Doxygen 1.4.6 bug
alpar [Thu, 02 Feb 2006 17:43:24 +0000] rev 1946
- workaround for a Doxygen 1.4.6 bug
- other doc fixes

Thu, 02 Feb 2006 17:09:09 +0000NEWS: major changes since 0.4 added
klao [Thu, 02 Feb 2006 17:09:09 +0000] rev 1945
NEWS: major changes since 0.4 added

Thu, 02 Feb 2006 15:53:01 +0000Use short icpc paths
alpar [Thu, 02 Feb 2006 15:53:01 +0000] rev 1944
Use short icpc paths

Thu, 02 Feb 2006 15:44:45 +0000Fix crash when an arrow is clicked with the delete tool.
ladanyi [Thu, 02 Feb 2006 15:44:45 +0000] rev 1943
Fix crash when an arrow is clicked with the delete tool.

Thu, 02 Feb 2006 13:43:01 +0000kruskal.h: an overloaded function for older, pointer-style iterators
klao [Thu, 02 Feb 2006 13:43:01 +0000] rev 1942
kruskal.h: an overloaded function for older, pointer-style iterators

Thu, 02 Feb 2006 08:52:20 +0000The version tag of the trunk is svn-head
alpar [Thu, 02 Feb 2006 08:52:20 +0000] rev 1941
The version tag of the trunk is svn-head

Thu, 02 Feb 2006 08:51:10 +0000- also works off-line
alpar [Thu, 02 Feb 2006 08:51:10 +0000] rev 1940
- also works off-line
- icc-8.0 in (not) tested, as well.

Thu, 02 Feb 2006 08:49:41 +0000Towards icc-8.0 compatibility...
alpar [Thu, 02 Feb 2006 08:49:41 +0000] rev 1939
Towards icc-8.0 compatibility...

Wed, 01 Feb 2006 12:55:38 +0000Fix g++-3.4 executable's name
alpar [Wed, 01 Feb 2006 12:55:38 +0000] rev 1938
Fix g++-3.4 executable's name

Wed, 01 Feb 2006 11:33:16 +0000Some useful scripts:
alpar [Wed, 01 Feb 2006 11:33:16 +0000] rev 1937
Some useful scripts:
check-compiler: test whether the repo compiles warningless
with various compilers.
check-integrity: checks whether everything is svn-added,
the makefiles are correct etc.
release: creates a version numbered release. Is modifies the repository.
DO NOT PLAY WITH IT!

Tue, 31 Jan 2006 21:14:11 +0000Fix icc compilation failures.
alpar [Tue, 31 Jan 2006 21:14:11 +0000] rev 1936
Fix icc compilation failures.

Tue, 31 Jan 2006 20:16:53 +0000Spellcheck
alpar [Tue, 31 Jan 2006 20:16:53 +0000] rev 1935
Spellcheck

Tue, 31 Jan 2006 20:14:52 +0000Bug fix
deba [Tue, 31 Jan 2006 20:14:52 +0000] rev 1934
Bug fix

ANodeIt/BNodeIt should not be inherited from ANode/BNode

The reason:
assert(graph.id(ANodeIt(graph)) == graph.id((Node)ANodeIt(graph)));

Tue, 31 Jan 2006 20:04:36 +0000Revising the bpugraph concept
deba [Tue, 31 Jan 2006 20:04:36 +0000] rev 1933
Revising the bpugraph concept

We need a public but very limited ANode and BNode class
It can be used with ItemSetTraits and with some special maps

By example:
DescriptorMap<Graph, ANode>
InvertableMap<Graph, ANode, string>
IterableBoolMap<Graph, ANode>
IterableIntMap<Graph, ANode>
IterableValueMap<Graph, ANode, string>

Tue, 31 Jan 2006 19:57:35 +0000Bug fix
deba [Tue, 31 Jan 2006 19:57:35 +0000] rev 1932
Bug fix
friend does not declares type

Tue, 31 Jan 2006 19:33:48 +0000New iterable map with comparable values
deba [Tue, 31 Jan 2006 19:33:48 +0000] rev 1931
New iterable map with comparable values
it uses linked lists and balanced binary tree

IterableBoolMap has ItemIt type as the other iterable maps

InvertableMap got ValueIterator