equal
deleted
inserted
replaced
396 ///restore() function. |
396 ///restore() function. |
397 /// |
397 /// |
398 ///\warning Edge and node deletions cannot be restored. |
398 ///\warning Edge and node deletions cannot be restored. |
399 ///\warning SnapShots cannot be nested. |
399 ///\warning SnapShots cannot be nested. |
400 ///\ingroup graphs |
400 ///\ingroup graphs |
|
401 ///\todo \c SnapShot or \c Snapshot? |
401 class SnapShot : protected AlterationObserverRegistry<Node>::ObserverBase, |
402 class SnapShot : protected AlterationObserverRegistry<Node>::ObserverBase, |
402 protected AlterationObserverRegistry<Edge>::ObserverBase |
403 protected AlterationObserverRegistry<Edge>::ObserverBase |
403 { |
404 { |
404 protected: |
405 protected: |
405 |
406 |
510 MappableUndirGraphExtender< |
511 MappableUndirGraphExtender< |
511 IterableUndirGraphExtender< |
512 IterableUndirGraphExtender< |
512 AlterableUndirGraphExtender< |
513 AlterableUndirGraphExtender< |
513 UndirGraphExtender<ListGraphBase> > > > > > > ErasableUndirListGraphBase; |
514 UndirGraphExtender<ListGraphBase> > > > > > > ErasableUndirListGraphBase; |
514 |
515 |
|
516 ///An undirected list graph class. |
|
517 |
|
518 ///This is a simple and fast erasable undirected graph implementation. |
|
519 /// |
|
520 ///It conforms to the |
|
521 ///\ref concept::UndirGraph "UndirGraph" concept. |
|
522 /// |
|
523 ///\sa concept::UndirGraph. |
|
524 /// |
|
525 ///\todo SnapShot hasn't been implemented yet. |
|
526 /// |
515 class UndirListGraph : public ErasableUndirListGraphBase { |
527 class UndirListGraph : public ErasableUndirListGraphBase { |
516 }; |
528 }; |
517 |
529 |
518 |
530 |
519 /// @} |
531 /// @} |