Thu, 17 Nov 2005 15:34:18 +0000 hegyi 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 +0000 deba Bug fix
Thu, 17 Nov 2005 10:16:29 +0000 alpar split(Edge) member function added.
Thu, 17 Nov 2005 10:14:55 +0000 alpar Several bugfices.
Wed, 16 Nov 2005 18:58:10 +0000 deba Modified iterators on graph maps
Wed, 16 Nov 2005 14:46:22 +0000 marci The GRAPH_TYPEDEFS macro is a bug.
Wed, 16 Nov 2005 13:39:29 +0000 alpar wirteable -> writable
Wed, 16 Nov 2005 13:26:04 +0000 alpar Empty graph is (strongly) connected.
Wed, 16 Nov 2005 13:21:57 +0000 alpar The first parameter of runningTimeTest became const.
Wed, 16 Nov 2005 13:19:05 +0000 alpar Iterable Bool maps can count the number of true and false values.
Wed, 16 Nov 2005 13:17:02 +0000 alpar (UNDIR)GRAPH_TYPEDEFS also defines some basic graph maps
Wed, 16 Nov 2005 13:15:33 +0000 alpar Better doc.
Wed, 16 Nov 2005 09:15:41 +0000 deba Demo for topology
Wed, 16 Nov 2005 09:11:44 +0000 deba Images for doc
Wed, 16 Nov 2005 09:10:24 +0000 deba bipartite by szakall
Wed, 16 Nov 2005 09:08:36 +0000 deba Warning because unused parameters