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

2005-11-16The first parameter of runningTimeTest became const.
alpar [Wed, 16 Nov 2005 13:21:57 +0000] rev 1806
The first parameter of runningTimeTest became const.
It is necessary to enable to pass of temporary objects.

2005-11-16Iterable Bool maps can count the number of true and false values.
alpar [Wed, 16 Nov 2005 13:19:05 +0000] rev 1805
Iterable Bool maps can count the number of true and false values.

2005-11-16(UNDIR)GRAPH_TYPEDEFS also defines some basic graph maps
alpar [Wed, 16 Nov 2005 13:17:02 +0000] rev 1804
(UNDIR)GRAPH_TYPEDEFS also defines some basic graph maps

2005-11-16Better doc.
alpar [Wed, 16 Nov 2005 13:15:33 +0000] rev 1803
Better doc.

2005-11-16Demo for topology
deba [Wed, 16 Nov 2005 09:15:41 +0000] rev 1802
Demo for topology

2005-11-16Images for doc
deba [Wed, 16 Nov 2005 09:11:44 +0000] rev 1801
Images for doc

2005-11-16bipartite by szakall
deba [Wed, 16 Nov 2005 09:10:24 +0000] rev 1800
bipartite by szakall

2005-11-16Warning because unused parameters
deba [Wed, 16 Nov 2005 09:08:36 +0000] rev 1799
Warning because unused parameters

2005-11-16lp_cplex: getDual compiles; untested
klao [Wed, 16 Nov 2005 05:01:04 +0000] rev 1798
lp_cplex: getDual compiles; untested