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

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

Mon, 30 Jan 2006 09:37:41 +0000Solve bug #23: Floating versus Integer Coordinates
alpar [Mon, 30 Jan 2006 09:37:41 +0000] rev 1930
Solve bug #23: Floating versus Integer Coordinates

- BoundingBox values rounds to integer
- The generated .eps rescales if the bounding box were too small otherwise.

Mon, 30 Jan 2006 09:32:52 +0000Better doc.
alpar [Mon, 30 Jan 2006 09:32:52 +0000] rev 1929
Better doc.

Mon, 30 Jan 2006 09:32:26 +0000Use [] instead of set().
alpar [Mon, 30 Jan 2006 09:32:26 +0000] rev 1928
Use [] instead of set().

Mon, 30 Jan 2006 09:31:15 +0000Functions added to set the edges/corners of the bounding box directly.
alpar [Mon, 30 Jan 2006 09:31:15 +0000] rev 1927
Functions added to set the edges/corners of the bounding box directly.

Sun, 29 Jan 2006 23:46:05 +0000Do not rely on the autodetection of cplex and glpk.
ladanyi [Sun, 29 Jan 2006 23:46:05 +0000] rev 1926
Do not rely on the autodetection of cplex and glpk.

Sun, 29 Jan 2006 23:32:46 +0000Updated rpm specfile to include the gui too. Couldn't test it.
ladanyi [Sun, 29 Jan 2006 23:32:46 +0000] rev 1925
Updated rpm specfile to include the gui too. Couldn't test it.

Sun, 29 Jan 2006 22:50:55 +0000ignore radix_sort-bench
ladanyi [Sun, 29 Jan 2006 22:50:55 +0000] rev 1924
ignore radix_sort-bench

Sun, 29 Jan 2006 22:41:55 +0000distribute simann.h too
ladanyi [Sun, 29 Jan 2006 22:41:55 +0000] rev 1923
distribute simann.h too

Sun, 29 Jan 2006 22:21:37 +0000Undir -> U transition
ladanyi [Sun, 29 Jan 2006 22:21:37 +0000] rev 1922
Undir -> U transition

Sun, 29 Jan 2006 22:10:06 +0000test for simann
ladanyi [Sun, 29 Jan 2006 22:10:06 +0000] rev 1921
test for simann

Sun, 29 Jan 2006 22:07:52 +0000added simann_maxcut_demo
ladanyi [Sun, 29 Jan 2006 22:07:52 +0000] rev 1920
added simann_maxcut_demo

Sun, 29 Jan 2006 22:06:45 +0000demo for simann
ladanyi [Sun, 29 Jan 2006 22:06:45 +0000] rev 1919
demo for simann

Sun, 29 Jan 2006 22:06:10 +0000more doc
ladanyi [Sun, 29 Jan 2006 22:06:10 +0000] rev 1918
more doc

Sun, 29 Jan 2006 22:04:48 +0000include the gui in the deb
ladanyi [Sun, 29 Jan 2006 22:04:48 +0000] rev 1917
include the gui in the deb

Fri, 27 Jan 2006 14:32:33 +0000make public the shiftedStart inorder to compute just n dijkstra
deba [Fri, 27 Jan 2006 14:32:33 +0000] rev 1916
make public the shiftedStart inorder to compute just n dijkstra

Fri, 27 Jan 2006 14:18:11 +0000Add new ItemSetTraits for ANode and BNode
deba [Fri, 27 Jan 2006 14:18:11 +0000] rev 1915
Add new ItemSetTraits for ANode and BNode

Fri, 27 Jan 2006 08:19:42 +0000Doc bug fix
deba [Fri, 27 Jan 2006 08:19:42 +0000] rev 1914
Doc bug fix

Fri, 27 Jan 2006 08:18:47 +0000Making iterable bool map dynamic
deba [Fri, 27 Jan 2006 08:18:47 +0000] rev 1913
Making iterable bool map dynamic
Changed interface

Fri, 27 Jan 2006 08:17:25 +0000Algorithms by szakall
deba [Fri, 27 Jan 2006 08:17:25 +0000] rev 1912
Algorithms by szakall

Thu, 26 Jan 2006 17:18:12 +0000The pre BpUGraph concept
deba [Thu, 26 Jan 2006 17:18:12 +0000] rev 1911
The pre BpUGraph concept

Thu, 26 Jan 2006 16:24:40 +0000Bipartite => Bp
deba [Thu, 26 Jan 2006 16:24:40 +0000] rev 1910
Bipartite => Bp
Upper => A
Lower => B

+ some bug fix

Thu, 26 Jan 2006 15:42:13 +0000Undir -> U transition
klao [Thu, 26 Jan 2006 15:42:13 +0000] rev 1909
Undir -> U transition

Thu, 26 Jan 2006 06:44:22 +0000Better doc.
alpar [Thu, 26 Jan 2006 06:44:22 +0000] rev 1908
Better doc.

Thu, 26 Jan 2006 06:43:59 +0000MALE and FEMALE node shape added.
alpar [Thu, 26 Jan 2006 06:43:59 +0000] rev 1907
MALE and FEMALE node shape added.

Wed, 25 Jan 2006 16:44:19 +0000Omitting warnings
deba [Wed, 25 Jan 2006 16:44:19 +0000] rev 1906
Omitting warnings

Wed, 25 Jan 2006 15:03:45 +0000Do not append -Wall -W to CXXFLAGS when it is set on the commandline.
ladanyi [Wed, 25 Jan 2006 15:03:45 +0000] rev 1905
Do not append -Wall -W to CXXFLAGS when it is set on the commandline.

Wed, 25 Jan 2006 14:58:04 +0000Bug fix for empty intervall sorting
deba [Wed, 25 Jan 2006 14:58:04 +0000] rev 1904
Bug fix for empty intervall sorting

Wed, 25 Jan 2006 14:40:26 +0000Bug fix
deba [Wed, 25 Jan 2006 14:40:26 +0000] rev 1903
Bug fix

Wed, 25 Jan 2006 12:10:18 +0000state setting function for heaps
deba [Wed, 25 Jan 2006 12:10:18 +0000] rev 1902
state setting function for heaps

If we know that which elements were in the heap then
we can clear it in better time complexity.

Tue, 24 Jan 2006 16:07:38 +0000Lemon Graph Format uses label instead of id named map.
deba [Tue, 24 Jan 2006 16:07:38 +0000] rev 1901
Lemon Graph Format uses label instead of id named map.

Thu, 19 Jan 2006 16:56:39 +0000Fix bug #18: bug in LpSolverBase::Col operator!= and ::Row operator!=
alpar [Thu, 19 Jan 2006 16:56:39 +0000] rev 1900
Fix bug #18: bug in LpSolverBase::Col operator!= and ::Row operator!=

Wed, 18 Jan 2006 09:42:59 +0000- setCol() -> col()
alpar [Wed, 18 Jan 2006 09:42:59 +0000] rev 1899
- setCol() -> col()
- better doc.

Wed, 18 Jan 2006 09:42:08 +0000- tolerance() added.
alpar [Wed, 18 Jan 2006 09:42:08 +0000] rev 1898
- tolerance() added.
- better doc.

Wed, 18 Jan 2006 09:40:53 +0000Tolerance<long double> added
alpar [Wed, 18 Jan 2006 09:40:53 +0000] rev 1897
Tolerance<long double> added

Sat, 14 Jan 2006 13:42:37 +0000Documentation of classes realizing algorithm running.
hegyi [Sat, 14 Jan 2006 13:42:37 +0000] rev 1896
Documentation of classes realizing algorithm running.

Sat, 14 Jan 2006 08:44:59 +0000- colName() added (untested on CPLEX)
alpar [Sat, 14 Jan 2006 08:44:59 +0000] rev 1895
- colName() added (untested on CPLEX)
- possibility to set lower/upper bounds of several cols at once
- setObj() -> obj()
- setRow() -> row()

Sat, 14 Jan 2006 08:17:00 +0000Changes in doc
alpar [Sat, 14 Jan 2006 08:17:00 +0000] rev 1894
Changes in doc

Thu, 12 Jan 2006 15:24:24 +0000Documenatation of MapWin.
hegyi [Thu, 12 Jan 2006 15:24:24 +0000] rev 1893
Documenatation of MapWin.

Thu, 12 Jan 2006 14:36:08 +0000Documentation of MapSelector. If no default value is present in MapSelector, Reset button does not appear.
hegyi [Thu, 12 Jan 2006 14:36:08 +0000] rev 1892
Documentation of MapSelector. If no default value is present in MapSelector, Reset button does not appear.

Thu, 12 Jan 2006 13:28:54 +0000Documentation of NoteBookTab. Redundant function parameters are removed from other classes as well.
hegyi [Thu, 12 Jan 2006 13:28:54 +0000] rev 1891
Documentation of NoteBookTab. Redundant function parameters are removed from other classes as well.

Wed, 11 Jan 2006 15:49:06 +0000Documentation of NewMapWin.
hegyi [Wed, 11 Jan 2006 15:49:06 +0000] rev 1890
Documentation of NewMapWin.

Wed, 11 Jan 2006 15:06:17 +0000Documentation of MainWin.
hegyi [Wed, 11 Jan 2006 15:06:17 +0000] rev 1889
Documentation of MainWin.

Tue, 10 Jan 2006 15:15:57 +0000If default value of a new map is constant, the newly created elements will get that value as well. Documentation is added to BrokenEdge, MapStorage and GraphDisplazCanvas classes.
hegyi [Tue, 10 Jan 2006 15:15:57 +0000] rev 1888
If default value of a new map is constant, the newly created elements will get that value as well. Documentation is added to BrokenEdge, MapStorage and GraphDisplazCanvas classes.

Mon, 09 Jan 2006 12:41:06 +0000The tree that is created for evaluation of expression string at new map creation is deleted after usage.
hegyi [Mon, 09 Jan 2006 12:41:06 +0000] rev 1887
The tree that is created for evaluation of expression string at new map creation is deleted after usage.

Mon, 09 Jan 2006 11:55:47 +0000Creation of algorithm dialog is even simpler by the usage of the newly created addMapSelector function.
hegyi [Mon, 09 Jan 2006 11:55:47 +0000] rev 1886
Creation of algorithm dialog is even simpler by the usage of the newly created addMapSelector function.

Fri, 06 Jan 2006 23:16:51 +0000Forgotten file committed.
hegyi [Fri, 06 Jan 2006 23:16:51 +0000] rev 1885
Forgotten file committed.

Fri, 06 Jan 2006 16:07:08 +0000In algorithm window maps can be selected and reated through MapSelector widget.
hegyi [Fri, 06 Jan 2006 16:07:08 +0000] rev 1884
In algorithm window maps can be selected and reated through MapSelector widget.

Fri, 06 Jan 2006 14:44:04 +0000Set arrow coordinates when creating a new edge.
ladanyi [Fri, 06 Jan 2006 14:44:04 +0000] rev 1883
Set arrow coordinates when creating a new edge.

Fri, 06 Jan 2006 14:36:46 +0000MapSelector has become a standalone class.
hegyi [Fri, 06 Jan 2006 14:36:46 +0000] rev 1882
MapSelector has become a standalone class.

Fri, 06 Jan 2006 13:58:49 +0000Result of KruskalGUIAlgo is refreshed if displayed, but no more setin a forced way.
hegyi [Fri, 06 Jan 2006 13:58:49 +0000] rev 1881
Result of KruskalGUIAlgo is refreshed if displayed, but no more setin a forced way.

Fri, 06 Jan 2006 10:42:58 +0000Reformatting: too long code lines.
alpar [Fri, 06 Jan 2006 10:42:58 +0000] rev 1880
Reformatting: too long code lines.

Thu, 05 Jan 2006 16:54:34 +0000Kruskal algorithm can be run from GUI from now on.
hegyi [Thu, 05 Jan 2006 16:54:34 +0000] rev 1879
Kruskal algorithm can be run from GUI from now on.

Thu, 05 Jan 2006 12:30:09 +0000Several changes. \n If new map is added to mapstorage it emits signal with the name of the new map. This was important, because from now on not only tha mapwin should be updated. \n Furthermore algobox gets a pointer to mapstorage instead of only the mapnames from it. This is important because without it it would be complicated to pass all of the required maps to algobox.
hegyi [Thu, 05 Jan 2006 12:30:09 +0000] rev 1878
Several changes. \n If new map is added to mapstorage it emits signal with the name of the new map. This was important, because from now on not only tha mapwin should be updated. \n Furthermore algobox gets a pointer to mapstorage instead of only the mapnames from it. This is important because without it it would be complicated to pass all of the required maps to algobox.

Thu, 05 Jan 2006 01:54:24 +0000Set the move tool active by default.
ladanyi [Thu, 05 Jan 2006 01:54:24 +0000] rev 1877
Set the move tool active by default.

Wed, 04 Jan 2006 18:05:55 +0000Communication with algorithm window is developed.
hegyi [Wed, 04 Jan 2006 18:05:55 +0000] rev 1876
Communication with algorithm window is developed.

Wed, 04 Jan 2006 13:31:59 +0000Happy new year to LEMON
alpar [Wed, 04 Jan 2006 13:31:59 +0000] rev 1875
Happy new year to LEMON

Wed, 04 Jan 2006 13:20:17 +0000Doc updates
alpar [Wed, 04 Jan 2006 13:20:17 +0000] rev 1874
Doc updates

Wed, 04 Jan 2006 13:19:12 +0000IterableBool{Upper/Lower}NodeMaps
alpar [Wed, 04 Jan 2006 13:19:12 +0000] rev 1873
IterableBool{Upper/Lower}NodeMaps

Wed, 04 Jan 2006 11:41:58 +0000Best feature ever\! Name of tabs are different from now on\!
hegyi [Wed, 04 Jan 2006 11:41:58 +0000] rev 1872
Best feature ever\! Name of tabs are different from now on\!

Tue, 03 Jan 2006 17:30:22 +0000Coding of Algorithms has begun, but code is really-really ugly yet.
hegyi [Tue, 03 Jan 2006 17:30:22 +0000] rev 1871
Coding of Algorithms has begun, but code is really-really ugly yet.

Tue, 03 Jan 2006 16:05:27 +0000Delete misnamed file
deba [Tue, 03 Jan 2006 16:05:27 +0000] rev 1870
Delete misnamed file

Tue, 03 Jan 2006 14:56:45 +0000Handling of tabs is rationalized a bit. More than one file can be given at startup in command prompt. If there is no file given in command prompt, an empty tab will be present at startup.
hegyi [Tue, 03 Jan 2006 14:56:45 +0000] rev 1869
Handling of tabs is rationalized a bit. More than one file can be given at startup in command prompt. If there is no file given in command prompt, an empty tab will be present at startup.

Wed, 21 Dec 2005 08:47:38 +0000Bug fix in bipartite graph
deba [Wed, 21 Dec 2005 08:47:38 +0000] rev 1868
Bug fix in bipartite graph

Mon, 19 Dec 2005 16:59:05 +0000Fix crash when the input file does not contain any nodeset or edgeset.
ladanyi [Mon, 19 Dec 2005 16:59:05 +0000] rev 1867
Fix crash when the input file does not contain any nodeset or edgeset.

Mon, 19 Dec 2005 14:58:09 +0000New file and data structures: sub_graph
deba [Mon, 19 Dec 2005 14:58:09 +0000] rev 1866
New file and data structures: sub_graph
Moved to new group with the edge_sets

Mon, 19 Dec 2005 09:47:10 +0000Doc fix
deba [Mon, 19 Dec 2005 09:47:10 +0000] rev 1865
Doc fix

Mon, 19 Dec 2005 09:43:13 +0000Fixing Bellman's name
deba [Mon, 19 Dec 2005 09:43:13 +0000] rev 1864
Fixing Bellman's name

Sun, 18 Dec 2005 03:01:53 +0000Demos and benchmarks are not built by default now. They can be enabled with the --enable-demo and --enable-benchmark configure flags.
ladanyi [Sun, 18 Dec 2005 03:01:53 +0000] rev 1863
Demos and benchmarks are not built by default now. They can be enabled with the --enable-demo and --enable-benchmark configure flags.

Sun, 18 Dec 2005 01:51:03 +0000Added guipixbufs.h to BUILT_SOURCES. This solves 'make dist' problems.
ladanyi [Sun, 18 Dec 2005 01:51:03 +0000] rev 1862
Added guipixbufs.h to BUILT_SOURCES. This solves 'make dist' problems.

Sat, 17 Dec 2005 21:51:10 +0000Distribute xml.h too.
ladanyi [Sat, 17 Dec 2005 21:51:10 +0000] rev 1861
Distribute xml.h too.

Sat, 17 Dec 2005 20:55:41 +0000Save and load the coordinates of the arrows on the edges.
ladanyi [Sat, 17 Dec 2005 20:55:41 +0000] rev 1860
Save and load the coordinates of the arrows on the edges.

Wed, 14 Dec 2005 18:11:03 +0000Bug fix
deba [Wed, 14 Dec 2005 18:11:03 +0000] rev 1859
Bug fix
and doc fix

Wed, 14 Dec 2005 18:07:28 +0000Bug fix in def pred map
deba [Wed, 14 Dec 2005 18:07:28 +0000] rev 1858
Bug fix in def pred map

Sat, 10 Dec 2005 19:38:53 +0000belmann_ford:
klao [Sat, 10 Dec 2005 19:38:53 +0000] rev 1857
belmann_ford:
* run() with length limit
* bugfix in processNextRound()

Thu, 08 Dec 2005 14:16:08 +0000Notebook tabs can be closed.
hegyi [Thu, 08 Dec 2005 14:16:08 +0000] rev 1856
Notebook tabs can be closed.

Wed, 07 Dec 2005 15:43:44 +0000Eliminate warnins
alpar [Wed, 07 Dec 2005 15:43:44 +0000] rev 1855
Eliminate warnins

Wed, 07 Dec 2005 15:40:27 +0000Bugfix
alpar [Wed, 07 Dec 2005 15:40:27 +0000] rev 1854
Bugfix

Wed, 07 Dec 2005 15:39:48 +0000Fix template version of Invalid.
alpar [Wed, 07 Dec 2005 15:39:48 +0000] rev 1853
Fix template version of Invalid.

Wed, 07 Dec 2005 11:57:30 +0000Some bug fixes and improvments in the io classes
deba [Wed, 07 Dec 2005 11:57:30 +0000] rev 1852
Some bug fixes and improvments in the io classes

Tue, 06 Dec 2005 18:44:26 +0000Doc improvements
alpar [Tue, 06 Dec 2005 18:44:26 +0000] rev 1851
Doc improvements

Tue, 06 Dec 2005 11:59:44 +0000Bugfix
marci [Tue, 06 Dec 2005 11:59:44 +0000] rev 1850
Bugfix

Tue, 06 Dec 2005 10:53:38 +0000Notebook style is provided. Without opportunity to close tabs. :-) But with all other necessary things (I think).
hegyi [Tue, 06 Dec 2005 10:53:38 +0000] rev 1849
Notebook style is provided. Without opportunity to close tabs. :-) But with all other necessary things (I think).

Mon, 05 Dec 2005 17:03:58 +0000Doc bug fix
deba [Mon, 05 Dec 2005 17:03:58 +0000] rev 1848
Doc bug fix

Mon, 05 Dec 2005 17:03:31 +0000- Changed and improved Timer interface
alpar [Mon, 05 Dec 2005 17:03:31 +0000] rev 1847
- Changed and improved Timer interface
- several new member functions
- reset() -> restart() renaming
- TimeReport: a Timer that prints a report on destruction.
- counter.h: a tool to measure the number of streps of algorithms.
- New documentation module for time measuring and counting.

Sat, 03 Dec 2005 18:30:31 +0000I have forgot the attributes
deba [Sat, 03 Dec 2005 18:30:31 +0000] rev 1846
I have forgot the attributes

Sat, 03 Dec 2005 18:17:29 +0000Implementation redesign
deba [Sat, 03 Dec 2005 18:17:29 +0000] rev 1845
Implementation redesign
Throws exception

Sat, 03 Dec 2005 18:15:43 +0000Changed implementation and bug fix
deba [Sat, 03 Dec 2005 18:15:43 +0000] rev 1844
Changed implementation and bug fix

Fri, 02 Dec 2005 10:02:40 +0000bugfix
alpar [Fri, 02 Dec 2005 10:02:40 +0000] rev 1843
bugfix

Thu, 01 Dec 2005 15:08:46 +0000NewEdgeSetAdaptor -> ListEdgeSet
deba [Thu, 01 Dec 2005 15:08:46 +0000] rev 1842
NewEdgeSetAdaptor -> ListEdgeSet
and moved to edge_set.h

Wed, 30 Nov 2005 17:49:01 +0000bug fix
marci [Wed, 30 Nov 2005 17:49:01 +0000] rev 1841
bug fix

Wed, 30 Nov 2005 17:00:17 +0000max flow with lp column generation
marci [Wed, 30 Nov 2005 17:00:17 +0000] rev 1840
max flow with lp column generation

Wed, 30 Nov 2005 13:24:37 +0000Some bug fix
deba [Wed, 30 Nov 2005 13:24:37 +0000] rev 1839
Some bug fix

Wed, 30 Nov 2005 13:24:23 +0000MapWin is created and disposed from now instead of being show and hide.
hegyi [Wed, 30 Nov 2005 13:24:23 +0000] rev 1838
MapWin is created and disposed from now instead of being show and hide.

Tue, 29 Nov 2005 19:31:58 +0000Structure of GUI is now more clear-cut than before.
hegyi [Tue, 29 Nov 2005 19:31:58 +0000] rev 1837
Structure of GUI is now more clear-cut than before.

Tue, 29 Nov 2005 08:43:50 +0000Clarify INVALID implementation.
alpar [Tue, 29 Nov 2005 08:43:50 +0000] rev 1836
Clarify INVALID implementation.

Tue, 29 Nov 2005 08:40:03 +0000- tolerance.h added
alpar [Tue, 29 Nov 2005 08:40:03 +0000] rev 1835
- tolerance.h added
- tolerance handler added to preflow (but not yet used!!).

Mon, 28 Nov 2005 11:14:59 +0000Doc fix
deba [Mon, 28 Nov 2005 11:14:59 +0000] rev 1834
Doc fix

Mon, 28 Nov 2005 11:14:01 +0000Radix sort algorithm
deba [Mon, 28 Nov 2005 11:14:01 +0000] rev 1833
Radix sort algorithm

Thu, 24 Nov 2005 15:48:53 +0000Bug fix
deba [Thu, 24 Nov 2005 15:48:53 +0000] rev 1832
Bug fix

Wed, 23 Nov 2005 16:24:59 +0000No segmentation fault caused by zero long edges.
hegyi [Wed, 23 Nov 2005 16:24:59 +0000] rev 1831
No segmentation fault caused by zero long edges.

Wed, 23 Nov 2005 16:08:02 +0000Document improvments
deba [Wed, 23 Nov 2005 16:08:02 +0000] rev 1830
Document improvments

Wed, 23 Nov 2005 15:42:36 +0000Correcting alteration notifing
deba [Wed, 23 Nov 2005 15:42:36 +0000] rev 1829
Correcting alteration notifing

Wed, 23 Nov 2005 11:20:14 +0000Static maps for bipartite graphs.
deba [Wed, 23 Nov 2005 11:20:14 +0000] rev 1828
Static maps for bipartite graphs.

Tue, 22 Nov 2005 15:15:31 +0000Fixing bug in g++-3.3
deba [Tue, 22 Nov 2005 15:15:31 +0000] rev 1827
Fixing bug in g++-3.3

Tue, 22 Nov 2005 14:35:33 +0000clean-up
ladanyi [Tue, 22 Nov 2005 14:35:33 +0000] rev 1826
clean-up

Tue, 22 Nov 2005 10:27:25 +0000fixed some memory leaks
ladanyi [Tue, 22 Nov 2005 10:27:25 +0000] rev 1825
fixed some memory leaks

Mon, 21 Nov 2005 18:12:11 +0000Erasing old header
deba [Mon, 21 Nov 2005 18:12:11 +0000] rev 1824
Erasing old header
Correcting makefile

Mon, 21 Nov 2005 18:03:20 +0000NewMapWin has become Dialog instead of Window. Therefore it is created dynamically, when there is need for it, instead of keeping one instance in memory. This solution is slower, but more correct than before.
hegyi [Mon, 21 Nov 2005 18:03:20 +0000] rev 1823
NewMapWin has become Dialog instead of Window. Therefore it is created dynamically, when there is need for it, instead of keeping one instance in memory. This solution is slower, but more correct than before.

Mon, 21 Nov 2005 17:59:27 +0000Erasing from the Makefile.am too
deba [Mon, 21 Nov 2005 17:59:27 +0000] rev 1822
Erasing from the Makefile.am too

Mon, 21 Nov 2005 17:58:24 +0000Erasing old tests
deba [Mon, 21 Nov 2005 17:58:24 +0000] rev 1821
Erasing old tests

Mon, 21 Nov 2005 17:48:00 +0000Undir Bipartite Graph/Full and Smart/ without concept, doc and concept
deba [Mon, 21 Nov 2005 17:48:00 +0000] rev 1820
Undir Bipartite Graph/Full and Smart/ without concept, doc and concept
checking

Mon, 21 Nov 2005 12:07:05 +0000Reorganizing.
hegyi [Mon, 21 Nov 2005 12:07:05 +0000] rev 1819
Reorganizing.

Mon, 21 Nov 2005 09:08:16 +0000UndirEulerIt added
alpar [Mon, 21 Nov 2005 09:08:16 +0000] rev 1818
UndirEulerIt added

Fri, 18 Nov 2005 11:17:08 +0000- Spellcheck (pathes->paths)
alpar [Fri, 18 Nov 2005 11:17:08 +0000] rev 1817
- Spellcheck (pathes->paths)

Fri, 18 Nov 2005 11:13:11 +0000- Spellcheck (pathes->paths)
alpar [Fri, 18 Nov 2005 11:13:11 +0000] rev 1816
- Spellcheck (pathes->paths)
- todos

Fri, 18 Nov 2005 11:10:53 +0000Bugfix
alpar [Fri, 18 Nov 2005 11:10:53 +0000] rev 1815
Bugfix

Thu, 17 Nov 2005 15:34:18 +0000As initial value of a new map expression with ()+-/* operators can be given. These operators work on numbers, or on maps. If maps are given, then the new value for a given graph element will be calculated using the value from the given maps that belong to that graph element.
hegyi [Thu, 17 Nov 2005 15:34:18 +0000] rev 1814
As initial value of a new map expression with ()+-/* operators can be given. These operators work on numbers, or on maps. If maps are given, then the new value for a given graph element will be calculated using the value from the given maps that belong to that graph element.

Thu, 17 Nov 2005 10:46:38 +0000Bug fix
deba [Thu, 17 Nov 2005 10:46:38 +0000] rev 1813
Bug fix

Thu, 17 Nov 2005 10:16:29 +0000split(Edge) member function added.
alpar [Thu, 17 Nov 2005 10:16:29 +0000] rev 1812
split(Edge) member function added.

Thu, 17 Nov 2005 10:14:55 +0000Several bugfices.
alpar [Thu, 17 Nov 2005 10:14:55 +0000] rev 1811
Several bugfices.

Wed, 16 Nov 2005 18:58:10 +0000Modified iterators on graph maps
deba [Wed, 16 Nov 2005 18:58:10 +0000] rev 1810
Modified iterators on graph maps
Other iterators for not graph maps

Wed, 16 Nov 2005 14:46:22 +0000The GRAPH_TYPEDEFS macro is a bug.
marci [Wed, 16 Nov 2005 14:46:22 +0000] rev 1809
The GRAPH_TYPEDEFS macro is a bug.

Wed, 16 Nov 2005 13:39:29 +0000wirteable -> writable
alpar [Wed, 16 Nov 2005 13:39:29 +0000] rev 1808
wirteable -> writable

Wed, 16 Nov 2005 13:26:04 +0000Empty graph is (strongly) connected.
alpar [Wed, 16 Nov 2005 13:26:04 +0000] rev 1807
Empty graph is (strongly) connected.