lemon-0.x: comparison lemon/smart

equal deleted inserted replaced

-:1be9ff805671
+:18d699f6fb40
 ///and target node \c t.
 ///\return the new edge.
 Edge addEdge(const Node& s, const Node& t) {
 return Parent::addEdge(s, t);
 }
+/// \brief Using this it is possible to avoid the superfluous memory
+/// allocation.
+/// Using this it is possible to avoid the superfluous memory
+/// allocation: if you know that the graph you want to build will
+/// be very 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); };
+/// \brief Using this it is possible to avoid the superfluous memory
+/// allocation.
+/// Using this it is possible to avoid the superfluous memory
+/// allocation: if you know that the graph you want to build will
+/// be very 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) { edges.reserve(m); };
 ///Clear the graph.
 ///Erase all the nodes and edges from the graph.
 ///