1.1 --- a/lemon/concepts/digraph.h	Mon Jul 16 16:21:40 2018 +0200
     1.2 +++ b/lemon/concepts/digraph.h	Wed Oct 17 19:14:07 2018 +0200
     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-2010
     1.8 + * Copyright (C) 2003-2013
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -312,7 +312,9 @@
    1.13  
    1.14          /// Sets the iterator to the first arc of the given digraph.
    1.15          ///
    1.16 -        explicit ArcIt(const Digraph& g) { ignore_unused_variable_warning(g); }
    1.17 +        explicit ArcIt(const Digraph& g) {
    1.18 +          ::lemon::ignore_unused_variable_warning(g);
    1.19 +        }
    1.20          /// Sets the iterator to the given arc.
    1.21  
    1.22          /// Sets the iterator to the given arc of the given digraph.
    1.23 @@ -409,13 +411,13 @@
    1.24  
    1.25        /// \brief The base node of the iterator.
    1.26        ///
    1.27 -      /// Returns the base node of the given incomming arc iterator
    1.28 +      /// Returns the base node of the given incoming arc iterator
    1.29        /// (i.e. the target node of the corresponding arc).
    1.30        Node baseNode(InArcIt) const { return INVALID; }
    1.31  
    1.32        /// \brief The running node of the iterator.
    1.33        ///
    1.34 -      /// Returns the running node of the given incomming arc iterator
    1.35 +      /// Returns the running node of the given incoming arc iterator
    1.36        /// (i.e. the source node of the corresponding arc).
    1.37        Node runningNode(InArcIt) const { return INVALID; }
    1.38