1.1 --- a/lemon/list_graph.h Fri Nov 04 16:10:23 2005 +0000
1.2 +++ b/lemon/list_graph.h Fri Nov 04 16:18:51 2005 +0000
1.3 @@ -412,7 +412,7 @@
1.4 ///referencing a moved edge remain
1.5 ///valid. However <tt>InEdge</tt>'s and <tt>OutEdge</tt>'s
1.6 ///may be invalidated.
1.7 - ///\warning This functionality cannot be used together with the SnapShot
1.8 + ///\warning This functionality cannot be used together with the Snapshot
1.9 ///feature.
1.10 ///\todo It could be implemented in a bit faster way.
1.11 Node split(Node n, bool connect = true)
1.12 @@ -436,9 +436,8 @@
1.13 ///restore() function.
1.14 ///
1.15 ///\warning Edge and node deletions cannot be restored.
1.16 - ///\warning SnapShots cannot be nested.
1.17 - ///\todo \c SnapShot or \c Snapshot?
1.18 - class SnapShot : protected AlterationNotifier<Node>::ObserverBase,
1.19 + ///\warning Snapshots cannot be nested.
1.20 + class Snapshot : protected AlterationNotifier<Node>::ObserverBase,
1.21 protected AlterationNotifier<Edge>::ObserverBase
1.22 {
1.23 protected:
1.24 @@ -496,17 +495,17 @@
1.25 ///Default constructur.
1.26 ///To actually make a snapshot you must call save().
1.27 ///
1.28 - SnapShot() : g(0) {}
1.29 + Snapshot() : g(0) {}
1.30 ///Constructor that immediately makes a snapshot.
1.31
1.32 ///This constructor immediately makes a snapshot of the graph.
1.33 ///\param _g The graph we make a snapshot of.
1.34 - SnapShot(ListGraph &_g) {
1.35 + Snapshot(ListGraph &_g) {
1.36 regist(_g);
1.37 }
1.38 ///\bug Is it necessary?
1.39 ///
1.40 - ~SnapShot()
1.41 + ~Snapshot()
1.42 {
1.43 if(g) deregist();
1.44 }
1.45 @@ -573,7 +572,7 @@
1.46 ///
1.47 ///\sa concept::UndirGraph.
1.48 ///
1.49 - ///\todo SnapShot, reverseEdge(), changeTarget(), changeSource(), contract()
1.50 + ///\todo Snapshot, reverseEdge(), changeTarget(), changeSource(), contract()
1.51 ///haven't been implemented yet.
1.52 ///
1.53 class UndirListGraph : public ExtendedUndirListGraphBase {