1.1 --- a/basics.dox	Mon Feb 15 01:47:33 2010 +0100
     1.2 +++ b/basics.dox	Mon Feb 15 01:51:58 2010 +0100
     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 @@ -124,9 +124,9 @@
    1.13  
    1.14  \note Contrary to the iterators in the C++ Standard Template Library (STL),
    1.15  LEMON iterators are convertible to the corresponding
    1.16 -item types without having to use \c %operator*(). This is not confusing, since the
    1.17 -program context always indicates whether we refer to the iterator or to the graph
    1.18 -item (they do not have conflicting functionalities).
    1.19 +item types without having to use \c %operator*(). This is not confusing,
    1.20 +since the program context always indicates whether we refer to the iterator
    1.21 +or to the graph item (they do not have conflicting functionalities).
    1.22  
    1.23  The graph items are also ordered by the 'less than' operator (with respect to
    1.24  their integer identifiers). For example, this code will add only one of the
    1.25 @@ -154,7 +154,7 @@
    1.26  \endcode
    1.27  
    1.28  Finally, you can also list the arcs starting from or arriving at a
    1.29 -certain node with 
    1.30 +certain node with
    1.31  \ref concepts::Digraph::OutArcIt "ListDigraph::OutArcIt"
    1.32  and
    1.33  \ref concepts::Digraph::InArcIt "ListDigraph::InArcIt".