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