COIN-OR::LEMON - Graph Library

Changeset 2260:4274224f8a7d in lemon-0.x for lemon/dag_shortest_path.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/dag_shortest_path.h

    r2151 r2260  
    9494    ///
    9595    /// The type of the map that stores the edge lengths.
    96     /// It must meet the \ref concept::ReadMap "ReadMap" concept.
     96    /// It must meet the \ref concepts::ReadMap "ReadMap" concept.
    9797    typedef _LengthMap LengthMap;
    9898
     
    112112    /// The type of the map that stores the last
    113113    /// edges of the shortest paths.
    114     /// It must meet the \ref concept::WriteMap "WriteMap" concept.
     114    /// It must meet the \ref concepts::WriteMap "WriteMap" concept.
    115115    ///
    116116    typedef typename Graph::template NodeMap<typename _Graph::Edge> PredMap;
     
    129129    ///
    130130    /// The type of the map that stores the dists of the nodes.
    131     /// It must meet the \ref concept::WriteMap "WriteMap" concept.
     131    /// It must meet the \ref concepts::WriteMap "WriteMap" concept.
    132132    ///
    133133    typedef typename Graph::template NodeMap<typename _LengthMap::Value>
     
    206206    ///
    207207    /// The type of the map that stores the edge lengths.
    208     /// It must meet the \ref concept::ReadMap "ReadMap" concept.
     208    /// It must meet the \ref concepts::ReadMap "ReadMap" concept.
    209209    typedef _LengthMap LengthMap;
    210210
     
    224224    /// The type of the map that stores the last
    225225    /// edges of the longest paths.
    226     /// It must meet the \ref concept::WriteMap "WriteMap" concept.
     226    /// It must meet the \ref concepts::WriteMap "WriteMap" concept.
    227227    ///
    228228    typedef typename Graph::template NodeMap<typename _Graph::Edge> PredMap;
     
    241241    ///
    242242    /// The type of the map that stores the dists of the nodes.
    243     /// It must meet the \ref concept::WriteMap "WriteMap" concept.
     243    /// It must meet the \ref concepts::WriteMap "WriteMap" concept.
    244244    ///
    245245    typedef typename Graph::template NodeMap<typename _LengthMap::Value>
     
    263263  /// This class provides an efficient implementation of a Dag sortest path
    264264  /// searching algorithm. The edge lengths are passed to the algorithm
    265   /// using a \ref concept::ReadMap "ReadMap", so it is easy to change it
     265  /// using a \ref concepts::ReadMap "ReadMap", so it is easy to change it
    266266  /// to any kind of length.
    267267  ///
     
    269269  ///
    270270  /// The type of the length is determined by the
    271   /// \ref concept::ReadMap::Value "Value" of the length map.
     271  /// \ref concepts::ReadMap::Value "Value" of the length map.
    272272  ///
    273273  /// \param _Graph The graph type the algorithm runs on. The default value
     
    275275  /// DagShortestPath, it is only passed to \ref DagShortestPathDefaultTraits.
    276276  /// \param _LengthMap This read-only EdgeMap determines the lengths of the
    277   /// edges. The default map type is \ref concept::Graph::EdgeMap
     277  /// edges. The default map type is \ref concepts::Graph::EdgeMap
    278278  /// "Graph::EdgeMap<int>".  The value of _LengthMap is not used directly
    279279  /// by DagShortestPath, it is only passed to \ref DagShortestPathDefaultTraits. 
     
    812812    ///
    813813    /// The type of the map that stores the edge lengths.
    814     /// It must meet the \ref concept::ReadMap "ReadMap" concept.
     814    /// It must meet the \ref concepts::ReadMap "ReadMap" concept.
    815815    typedef _LengthMap LengthMap;
    816816
     
    830830    /// The type of the map that stores the last
    831831    /// edges of the shortest paths.
    832     /// It must meet the \ref concept::WriteMap "WriteMap" concept.
     832    /// It must meet the \ref concepts::WriteMap "WriteMap" concept.
    833833    typedef NullMap <typename _Graph::Node,typename _Graph::Edge> PredMap;
    834834
     
    842842    ///
    843843    /// The type of the map that stores the dists of the nodes.
    844     /// It must meet the \ref concept::WriteMap "WriteMap" concept.
     844    /// It must meet the \ref concepts::WriteMap "WriteMap" concept.
    845845    typedef NullMap<typename Graph::Node, Value> DistMap;
    846846    /// \brief Instantiates a DistMap.
Note: See TracChangeset for help on using the changeset viewer.