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