# HG changeset patch
# User Peter Kovacs <kpeter@inf.elte.hu>
# Date 1251018640 -7200
# Node ID 2e20aad157545e53f341eccf177c6b480f50a6da
# Parent  853fcddcf282376265ff457bef17a4cef10167e7
Add reserve functions to ListGraph and SmartGraph (#311)
ListDigraph and SmartDigraph already have such functions.

diff -r 853fcddcf282 -r 2e20aad15754 lemon/list_graph.h
--- a/lemon/list_graph.h	Sun Aug 23 11:09:22 2009 +0200
+++ b/lemon/list_graph.h	Sun Aug 23 11:10:40 2009 +0200
@@ -1311,6 +1311,26 @@
       Parent::clear();
     }
 
+    /// Reserve memory for nodes.
+
+    /// Using this function, it is possible to avoid superfluous memory
+    /// allocation: if you know that the graph you want to build will
+    /// be large (e.g. it will contain millions of nodes and/or edges),
+    /// then it is worth reserving space for this amount before starting
+    /// to build the graph.
+    /// \sa reserveEdge()
+    void reserveNode(int n) { nodes.reserve(n); };
+
+    /// Reserve memory for edges.
+
+    /// Using this function, it is possible to avoid superfluous memory
+    /// allocation: if you know that the graph you want to build will
+    /// be large (e.g. it will contain millions of nodes and/or edges),
+    /// then it is worth reserving space for this amount before starting
+    /// to build the graph.
+    /// \sa reserveNode()
+    void reserveEdge(int m) { arcs.reserve(2 * m); };
+
     /// \brief Class to make a snapshot of the graph and restore
     /// it later.
     ///
diff -r 853fcddcf282 -r 2e20aad15754 lemon/smart_graph.h
--- a/lemon/smart_graph.h	Sun Aug 23 11:09:22 2009 +0200
+++ b/lemon/smart_graph.h	Sun Aug 23 11:10:40 2009 +0200
@@ -691,6 +691,26 @@
       Parent::clear();
     }
 
+    /// Reserve memory for nodes.
+
+    /// Using this function, it is possible to avoid superfluous memory
+    /// allocation: if you know that the graph you want to build will
+    /// be large (e.g. it will contain millions of nodes and/or edges),
+    /// then it is worth reserving space for this amount before starting
+    /// to build the graph.
+    /// \sa reserveEdge()
+    void reserveNode(int n) { nodes.reserve(n); };
+
+    /// Reserve memory for edges.
+
+    /// Using this function, it is possible to avoid superfluous memory
+    /// allocation: if you know that the graph you want to build will
+    /// be large (e.g. it will contain millions of nodes and/or edges),
+    /// then it is worth reserving space for this amount before starting
+    /// to build the graph.
+    /// \sa reserveNode()
+    void reserveEdge(int m) { arcs.reserve(2 * m); };
+
   public:
 
     class Snapshot;
diff -r 853fcddcf282 -r 2e20aad15754 test/digraph_test.cc
--- a/test/digraph_test.cc	Sun Aug 23 11:09:22 2009 +0200
+++ b/test/digraph_test.cc	Sun Aug 23 11:10:40 2009 +0200
@@ -35,6 +35,9 @@
   checkGraphNodeList(G, 0);
   checkGraphArcList(G, 0);
 
+  G.reserveNode(3);
+  G.reserveArc(4);
+
   Node
     n1 = G.addNode(),
     n2 = G.addNode(),
diff -r 853fcddcf282 -r 2e20aad15754 test/graph_test.cc
--- a/test/graph_test.cc	Sun Aug 23 11:09:22 2009 +0200
+++ b/test/graph_test.cc	Sun Aug 23 11:10:40 2009 +0200
@@ -38,6 +38,9 @@
   checkGraphEdgeList(G, 0);
   checkGraphArcList(G, 0);
 
+  G.reserveNode(3);
+  G.reserveEdge(3);
+
   Node
     n1 = G.addNode(),
     n2 = G.addNode(),