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 {

     2.1 --- a/lemon/smart_graph.h	Fri Nov 04 16:10:23 2005 +0000
     2.2 +++ b/lemon/smart_graph.h	Fri Nov 04 16:18:51 2005 +0000
     2.3 @@ -249,11 +249,11 @@
     2.4    class SmartGraph : public ExtendedSmartGraphBase {
     2.5    public:
     2.6      
     2.7 -    class SnapShot;
     2.8 -    friend class SnapShot;
     2.9 +    class Snapshot;
    2.10 +    friend class Snapshot;
    2.11  
    2.12    protected:
    2.13 -    void restoreSnapShot(const SnapShot &s)
    2.14 +    void restoreSnapshot(const Snapshot &s)
    2.15      {
    2.16        while(s.edge_num<edges.size()) {
    2.17  	Parent::getNotifier(Edge()).erase(Edge(edges.size()-1));
    2.18 @@ -282,7 +282,7 @@
    2.19      ///referencing a moved edge remain
    2.20      ///valid. However <tt>InEdge</tt>'s and <tt>OutEdge</tt>'s
    2.21      ///may be invalidated.
    2.22 -    ///\warning This functionality cannot be used together with the SnapShot
    2.23 +    ///\warning This functionality cannot be used together with the Snapshot
    2.24      ///feature.
    2.25      ///\todo It could be implemented in a bit faster way.
    2.26      Node split(Node n, bool connect = true) 
    2.27 @@ -300,9 +300,9 @@
    2.28      ///restore() function.
    2.29      ///\note After you restore a state, you cannot restore
    2.30      ///a later state, in other word you cannot add again the edges deleted
    2.31 -    ///by restore() using another SnapShot instance.
    2.32 +    ///by restore() using another Snapshot instance.
    2.33      ///
    2.34 -    class SnapShot 
    2.35 +    class Snapshot 
    2.36      {
    2.37        SmartGraph *g;
    2.38      protected:
    2.39 @@ -315,12 +315,12 @@
    2.40        ///Default constructor.
    2.41        ///To actually make a snapshot you must call save().
    2.42        ///
    2.43 -      SnapShot() : g(0) {}
    2.44 +      Snapshot() : g(0) {}
    2.45        ///Constructor that immediately makes a snapshot
    2.46        
    2.47        ///This constructor immediately makes a snapshot of the graph.
    2.48        ///\param _g The graph we make a snapshot of.
    2.49 -      SnapShot(SmartGraph &_g) :g(&_g) {
    2.50 +      Snapshot(SmartGraph &_g) :g(&_g) {
    2.51  	node_num=g->nodes.size();
    2.52  	edge_num=g->edges.size();
    2.53        }
    2.54 @@ -351,7 +351,7 @@
    2.55        
    2.56        void restore()
    2.57        {
    2.58 -	g->restoreSnapShot(*this);
    2.59 +	g->restoreSnapshot(*this);
    2.60        }
    2.61      };
    2.62    };
    2.63 @@ -376,7 +376,7 @@
    2.64    ///the \ref concept::UndirGraph "UndirGraph" concept.
    2.65    ///\sa concept::UndirGraph.
    2.66    ///
    2.67 -  ///\todo SnapShot hasn't been implemented yet.
    2.68 +  ///\todo Snapshot hasn't been implemented yet.
    2.69    ///
    2.70    class UndirSmartGraph : public ExtendedUndirSmartGraphBase {
    2.71    };