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>