1.1 --- a/lemon/full_graph.h	Wed Mar 17 12:35:52 2010 +0100
     1.2 +++ b/lemon/full_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 @@ -203,7 +203,7 @@
    1.13  
    1.14      /// \brief Returns the node with the given index.
    1.15      ///
    1.16 -    /// Returns the node with the given index. Since this structure is 
    1.17 +    /// Returns the node with the given index. Since this structure is
    1.18      /// completely static, the nodes can be indexed with integers from
    1.19      /// the range <tt>[0..nodeNum()-1]</tt>.
    1.20      /// The index of a node is the same as its ID.
    1.21 @@ -212,7 +212,7 @@
    1.22  
    1.23      /// \brief Returns the index of the given node.
    1.24      ///
    1.25 -    /// Returns the index of the given node. Since this structure is 
    1.26 +    /// Returns the index of the given node. Since this structure is
    1.27      /// completely static, the nodes can be indexed with integers from
    1.28      /// the range <tt>[0..nodeNum()-1]</tt>.
    1.29      /// The index of a node is the same as its ID.
    1.30 @@ -582,7 +582,7 @@
    1.31  
    1.32      /// \brief Returns the node with the given index.
    1.33      ///
    1.34 -    /// Returns the node with the given index. Since this structure is 
    1.35 +    /// Returns the node with the given index. Since this structure is
    1.36      /// completely static, the nodes can be indexed with integers from
    1.37      /// the range <tt>[0..nodeNum()-1]</tt>.
    1.38      /// The index of a node is the same as its ID.
    1.39 @@ -591,7 +591,7 @@
    1.40  
    1.41      /// \brief Returns the index of the given node.
    1.42      ///
    1.43 -    /// Returns the index of the given node. Since this structure is 
    1.44 +    /// Returns the index of the given node. Since this structure is
    1.45      /// completely static, the nodes can be indexed with integers from
    1.46      /// the range <tt>[0..nodeNum()-1]</tt>.
    1.47      /// The index of a node is the same as its ID.