COIN-OR::LEMON - Graph Library

Changeset 2260:4274224f8a7d in lemon-0.x for lemon/bellman_ford.h


Ignore:
Timestamp:
10/24/06 19:19:16 (13 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3016
Message:

concept -> concepts (namespace & directory)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/bellman_ford.h

    r2151 r2260  
    9393    ///
    9494    /// The type of the map that stores the edge lengths.
    95     /// It must meet the \ref concept::ReadMap "ReadMap" concept.
     95    /// It must meet the \ref concepts::ReadMap "ReadMap" concept.
    9696    typedef _LengthMap LengthMap;
    9797
     
    111111    /// The type of the map that stores the last
    112112    /// edges of the shortest paths.
    113     /// It must meet the \ref concept::WriteMap "WriteMap" concept.
     113    /// It must meet the \ref concepts::WriteMap "WriteMap" concept.
    114114    ///
    115115    typedef typename Graph::template NodeMap<typename _Graph::Edge> PredMap;
     
    126126    ///
    127127    /// The type of the map that stores the dists of the nodes.
    128     /// It must meet the \ref concept::WriteMap "WriteMap" concept.
     128    /// It must meet the \ref concepts::WriteMap "WriteMap" concept.
    129129    ///
    130130    typedef typename Graph::template NodeMap<typename _LengthMap::Value>
     
    147147  /// This class provides an efficient implementation of \c Bellman-Ford
    148148  /// algorithm. The edge lengths are passed to the algorithm using a
    149   /// \ref concept::ReadMap "ReadMap", so it is easy to change it to any
     149  /// \ref concepts::ReadMap "ReadMap", so it is easy to change it to any
    150150  /// kind of length.
    151151  ///
     
    159159  ///
    160160  /// The type of the length is determined by the
    161   /// \ref concept::ReadMap::Value "Value" of the length map.
     161  /// \ref concepts::ReadMap::Value "Value" of the length map.
    162162  ///
    163163  /// \param _Graph The graph type the algorithm runs on. The default value
     
    165165  /// BellmanFord, it is only passed to \ref BellmanFordDefaultTraits.
    166166  /// \param _LengthMap This read-only EdgeMap determines the lengths of the
    167   /// edges. The default map type is \ref concept::Graph::EdgeMap
     167  /// edges. The default map type is \ref concepts::Graph::EdgeMap
    168168  /// "Graph::EdgeMap<int>".  The value of _LengthMap is not used directly
    169169  /// by BellmanFord, it is only passed to \ref BellmanFordDefaultTraits. 
     
    791791    ///
    792792    /// The type of the map that stores the edge lengths.
    793     /// It must meet the \ref concept::ReadMap "ReadMap" concept.
     793    /// It must meet the \ref concepts::ReadMap "ReadMap" concept.
    794794    typedef _LengthMap LengthMap;
    795795
     
    809809    /// The type of the map that stores the last
    810810    /// edges of the shortest paths.
    811     /// It must meet the \ref concept::WriteMap "WriteMap" concept.
     811    /// It must meet the \ref concepts::WriteMap "WriteMap" concept.
    812812    typedef NullMap <typename _Graph::Node,typename _Graph::Edge> PredMap;
    813813
     
    821821    ///
    822822    /// The type of the map that stores the dists of the nodes.
    823     /// It must meet the \ref concept::WriteMap "WriteMap" concept.
     823    /// It must meet the \ref concepts::WriteMap "WriteMap" concept.
    824824    typedef NullMap<typename Graph::Node, Value> DistMap;
    825825    /// \brief Instantiates a DistMap.
Note: See TracChangeset for help on using the changeset viewer.