lemon/smart_graph.h
changeset 877 141f9c0db4a3
parent 787 c2230649a493
     1.1 --- a/lemon/smart_graph.h	Wed Mar 17 12:35:52 2010 +0100
     1.2 +++ b/lemon/smart_graph.h	Sat Mar 06 14:35:12 2010 +0000
     1.3 @@ -2,7 +2,7 @@
     1.4   *
     1.5   * This file is a part of LEMON, a generic C++ optimization library.
     1.6   *
     1.7 - * Copyright (C) 2003-2009
     1.8 + * Copyright (C) 2003-2010
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -186,7 +186,7 @@
    1.13    ///
    1.14    ///\ref SmartDigraph is a simple and fast digraph implementation.
    1.15    ///It is also quite memory efficient but at the price
    1.16 -  ///that it does not support node and arc deletion 
    1.17 +  ///that it does not support node and arc deletion
    1.18    ///(except for the Snapshot feature).
    1.19    ///
    1.20    ///This type fully conforms to the \ref concepts::Digraph "Digraph concept"
    1.21 @@ -335,7 +335,7 @@
    1.22      ///restore() function. This is the only way for deleting nodes and/or
    1.23      ///arcs from a SmartDigraph structure.
    1.24      ///
    1.25 -    ///\note After a state is restored, you cannot restore a later state, 
    1.26 +    ///\note After a state is restored, you cannot restore a later state,
    1.27      ///i.e. you cannot add the removed nodes and arcs again using
    1.28      ///another Snapshot instance.
    1.29      ///
    1.30 @@ -614,7 +614,7 @@
    1.31    ///
    1.32    /// \ref SmartGraph is a simple and fast graph implementation.
    1.33    /// It is also quite memory efficient but at the price
    1.34 -  /// that it does not support node and edge deletion 
    1.35 +  /// that it does not support node and edge deletion
    1.36    /// (except for the Snapshot feature).
    1.37    ///
    1.38    /// This type fully conforms to the \ref concepts::Graph "Graph concept"
    1.39 @@ -761,7 +761,7 @@
    1.40      ///restore() function. This is the only way for deleting nodes and/or
    1.41      ///edges from a SmartGraph structure.
    1.42      ///
    1.43 -    ///\note After a state is restored, you cannot restore a later state, 
    1.44 +    ///\note After a state is restored, you cannot restore a later state,
    1.45      ///i.e. you cannot add the removed nodes and edges again using
    1.46      ///another Snapshot instance.
    1.47      ///