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.
deba [Thu, 17 Nov 2005 10:46:38 +0000] rev 1813
Bug fix
alpar [Thu, 17 Nov 2005 10:16:29 +0000] rev 1812
split(Edge) member function added.
alpar [Thu, 17 Nov 2005 10:14:55 +0000] rev 1811
Several bugfices.
deba [Wed, 16 Nov 2005 18:58:10 +0000] rev 1810
Modified iterators on graph maps
Other iterators for not graph maps
marci [Wed, 16 Nov 2005 14:46:22 +0000] rev 1809
The GRAPH_TYPEDEFS macro is a bug.
alpar [Wed, 16 Nov 2005 13:39:29 +0000] rev 1808
wirteable -> writable
alpar [Wed, 16 Nov 2005 13:26:04 +0000] rev 1807
Empty graph is (strongly) connected.
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.
alpar [Wed, 16 Nov 2005 13:19:05 +0000] rev 1805
Iterable Bool maps can count the number of true and false values.
alpar [Wed, 16 Nov 2005 13:17:02 +0000] rev 1804
(UNDIR)GRAPH_TYPEDEFS also defines some basic graph maps
alpar [Wed, 16 Nov 2005 13:15:33 +0000] rev 1803
Better doc.
deba [Wed, 16 Nov 2005 09:15:41 +0000] rev 1802
Demo for topology
deba [Wed, 16 Nov 2005 09:11:44 +0000] rev 1801
Images for doc
deba [Wed, 16 Nov 2005 09:10:24 +0000] rev 1800
bipartite by szakall