Changeset 2456:717a5134ddeb in lemon-0.x for lemon/list_graph.h
- Timestamp:
- 06/15/07 16:32:48 (17 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3293
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/list_graph.h
r2391 r2456 390 390 } 391 391 392 /// Using this it is possible to avoid the superfluous memory 393 /// allocation: if you know that the graph you want to build will 394 /// be very large (e.g. it will contain millions of nodes and/or edges) 395 /// then it is worth reserving space for this amount before starting 396 /// to build the graph. 397 /// \sa reserveEdge 398 void reserveNode(int n) { nodes.reserve(n); }; 399 392 400 /// \brief Using this it is possible to avoid the superfluous memory 393 401 /// allocation. 394 402 395 ///Using this it is possible to avoid the superfluous memory 396 ///allocation: if you know that the graph you want to build will 397 ///contain at least 10 million nodes then it is worth reserving 398 ///space for this amount before starting to build the graph. 399 void reserveNode(int n) { nodes.reserve(n); }; 400 401 /// \brief Using this it is possible to avoid the superfluous memory 402 /// allocation. 403 404 ///Using this it is possible to avoid the superfluous memory 405 ///allocation: see the \ref reserveNode function. 406 void reserveEdge(int n) { edges.reserve(n); }; 407 403 /// Using this it is possible to avoid the superfluous memory 404 /// allocation: if you know that the graph you want to build will 405 /// be very large (e.g. it will contain millions of nodes and/or edges) 406 /// then it is worth reserving space for this amount before starting 407 /// to build the graph. 408 /// \sa reserveNode 409 void reserveEdge(int m) { edges.reserve(m); }; 408 410 409 411 ///Contract two nodes.
Note: See TracChangeset
for help on using the changeset viewer.