1.1 --- a/lemon/bellman_ford.h	Mon Jul 16 16:21:40 2018 +0200
     1.2 +++ b/lemon/bellman_ford.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 @@ -149,7 +149,7 @@
    1.13    /// \ingroup shortest_path
    1.14    /// This class provides an efficient implementation of the Bellman-Ford
    1.15    /// algorithm. The maximum time complexity of the algorithm is
    1.16 -  /// <tt>O(ne)</tt>.
    1.17 +  /// <tt>O(nm)</tt>.
    1.18    ///
    1.19    /// The Bellman-Ford algorithm solves the single-source shortest path
    1.20    /// problem when the arcs can have negative lengths, but the digraph
    1.21 @@ -200,11 +200,12 @@
    1.22      typedef typename TR::DistMap DistMap;
    1.23      /// The type of the paths.
    1.24      typedef PredMapPath<Digraph, PredMap> Path;
    1.25 -    ///\brief The \ref BellmanFordDefaultOperationTraits
    1.26 +    ///\brief The \ref lemon::BellmanFordDefaultOperationTraits
    1.27      /// "operation traits class" of the algorithm.
    1.28      typedef typename TR::OperationTraits OperationTraits;
    1.29  
    1.30 -    ///The \ref BellmanFordDefaultTraits "traits class" of the algorithm.
    1.31 +    ///\brief The \ref lemon::BellmanFordDefaultTraits "traits class"
    1.32 +    ///of the algorithm.
    1.33      typedef TR Traits;
    1.34  
    1.35    private: