Changeset 695:887c551fb0aa in lemon-0.x for src/hugo

Timestamp:

07/06/04 13:27:36 (20 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@946

Message:

• Bugfix in erase()
• reserveEdge() added

File:

• src/hugo/list_graph.h (modified) (2 diffs)

src/hugo/list_graph.h

@@ -115 +115 @@
     int edgeNum() const { return edges.size(); }  //FIXME: What is this?
 
+    ///Set the expected number of edges
+
+    ///With this function, it is possible to set the expected number of edges.
+    ///The use of this fasten the building of the graph and makes
+    ///it possible to avoid the superfluous memory allocation.
+    void reserveEdge(int n) { edges.reserve(n); };
+    
     ///\bug This function does something different than
     ///its name would suggests...
@@ -261 +268 @@
       
       edges[n].next_in = first_free_edge;
-      first_free_edge = -1;      
+      first_free_edge = n;      
 
       //Update dynamic maps