Wed, 30 Sep 2009 08:41:06 +0200Merge #311
Alpar Juttner <alpar@cs.elte.hu> [Wed, 30 Sep 2009 08:41:06 +0200] rev 742
Merge #311

Wed, 30 Sep 2009 08:36:43 +0200Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 30 Sep 2009 08:36:43 +0200] rev 741
Merge

Tue, 29 Sep 2009 10:21:51 +0200Add a warning for List(Di)Graph::Snapshot (#311)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 29 Sep 2009 10:21:51 +0200] rev 740
Add a warning for List(Di)Graph::Snapshot (#311)
and extend tests for snapshots

Mon, 28 Sep 2009 12:48:44 +0200Modify the implementation of ListDigraph::ArcIt (#311)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 28 Sep 2009 12:48:44 +0200] rev 739
Modify the implementation of ListDigraph::ArcIt (#311)

The new implementation is based on out-arc iteration (like
ListGraph::ArcIt) instead of in-arc iteration to make it
consistent with the documentation.

Sun, 23 Aug 2009 11:13:21 +0200Much better implementation for node splitting (#311)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 23 Aug 2009 11:13:21 +0200] rev 738
Much better implementation for node splitting (#311)
in ListDigraph. This solution is the same as the one that
is used in SmartDigraph. It is much faster and does not
invalidate any iterator like the former implementation.

Sun, 23 Aug 2009 11:11:49 +0200Add a resize() function to HypercubeGraph (#311)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 23 Aug 2009 11:11:49 +0200] rev 737
Add a resize() function to HypercubeGraph (#311)
just like the similar functions in other static graph structures,
and extend the test files to check these functions.