Changeset 974:785062a83f8e in lemon-0.x for src/lemon
- Timestamp:
- 11/10/04 12:42:00 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1362
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/lemon/smart_graph.h
r973 r974 233 233 ///This is a simple and fast graph implementation. 234 234 ///It is also quite memory efficient, but at the price 235 ///that <b> it does not support node and edge deletion</b>. 235 ///that <b> it does support only limited (only stack-like) 236 ///node and edge deletions</b>. 236 237 ///It conforms to 237 238 ///the \ref concept::ExtendableGraph "ExtendableGraph" concept. … … 239 240 /// 240 241 ///\todo Some member functions could be \c static. 241 ///242 ///\todo A possibly useful functionality: a function saveState()243 ///(or snapshot() ) would244 ///give back a data sturcture X and then the function restoreState(X)245 ///(or rollBack() )246 ///would remove the nodes and edges added after the call of saveState().247 ///Of course it should be used as a stack. (Maybe X is not necessary.)248 242 /// 249 243 ///\author Alpar Juttner … … 294 288 ///a later state, in other word you cannot add again the edges deleted 295 289 ///by rollBack(). 290 ///\todo This function might be called saveState() or getState(). 296 291 SnapShot makeSnapShot() 297 292 {
Note: See TracChangeset
for help on using the changeset viewer.