Changeset 2260:4274224f8a7d in lemon-0.x for lemon/bellman_ford.h
- Timestamp:
- 10/24/06 19:19:16 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3016
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/bellman_ford.h
r2151 r2260 93 93 /// 94 94 /// 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. 96 96 typedef _LengthMap LengthMap; 97 97 … … 111 111 /// The type of the map that stores the last 112 112 /// 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. 114 114 /// 115 115 typedef typename Graph::template NodeMap<typename _Graph::Edge> PredMap; … … 126 126 /// 127 127 /// 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. 129 129 /// 130 130 typedef typename Graph::template NodeMap<typename _LengthMap::Value> … … 147 147 /// This class provides an efficient implementation of \c Bellman-Ford 148 148 /// algorithm. The edge lengths are passed to the algorithm using a 149 /// \ref concept ::ReadMap "ReadMap", so it is easy to change it to any149 /// \ref concepts::ReadMap "ReadMap", so it is easy to change it to any 150 150 /// kind of length. 151 151 /// … … 159 159 /// 160 160 /// 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. 162 162 /// 163 163 /// \param _Graph The graph type the algorithm runs on. The default value … … 165 165 /// BellmanFord, it is only passed to \ref BellmanFordDefaultTraits. 166 166 /// \param _LengthMap This read-only EdgeMap determines the lengths of the 167 /// edges. The default map type is \ref concept ::Graph::EdgeMap167 /// edges. The default map type is \ref concepts::Graph::EdgeMap 168 168 /// "Graph::EdgeMap<int>". The value of _LengthMap is not used directly 169 169 /// by BellmanFord, it is only passed to \ref BellmanFordDefaultTraits. … … 791 791 /// 792 792 /// 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. 794 794 typedef _LengthMap LengthMap; 795 795 … … 809 809 /// The type of the map that stores the last 810 810 /// 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. 812 812 typedef NullMap <typename _Graph::Node,typename _Graph::Edge> PredMap; 813 813 … … 821 821 /// 822 822 /// 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. 824 824 typedef NullMap<typename Graph::Node, Value> DistMap; 825 825 /// \brief Instantiates a DistMap.
Note: See TracChangeset
for help on using the changeset viewer.