Changeset 2260:4274224f8a7d in lemon-0.x for lemon/dag_shortest_path.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/dag_shortest_path.h
r2151 r2260 94 94 /// 95 95 /// 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. 97 97 typedef _LengthMap LengthMap; 98 98 … … 112 112 /// The type of the map that stores the last 113 113 /// 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. 115 115 /// 116 116 typedef typename Graph::template NodeMap<typename _Graph::Edge> PredMap; … … 129 129 /// 130 130 /// 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. 132 132 /// 133 133 typedef typename Graph::template NodeMap<typename _LengthMap::Value> … … 206 206 /// 207 207 /// 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. 209 209 typedef _LengthMap LengthMap; 210 210 … … 224 224 /// The type of the map that stores the last 225 225 /// 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. 227 227 /// 228 228 typedef typename Graph::template NodeMap<typename _Graph::Edge> PredMap; … … 241 241 /// 242 242 /// 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. 244 244 /// 245 245 typedef typename Graph::template NodeMap<typename _LengthMap::Value> … … 263 263 /// This class provides an efficient implementation of a Dag sortest path 264 264 /// searching algorithm. The edge lengths are passed to the algorithm 265 /// using a \ref concept ::ReadMap "ReadMap", so it is easy to change it265 /// using a \ref concepts::ReadMap "ReadMap", so it is easy to change it 266 266 /// to any kind of length. 267 267 /// … … 269 269 /// 270 270 /// 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. 272 272 /// 273 273 /// \param _Graph The graph type the algorithm runs on. The default value … … 275 275 /// DagShortestPath, it is only passed to \ref DagShortestPathDefaultTraits. 276 276 /// \param _LengthMap This read-only EdgeMap determines the lengths of the 277 /// edges. The default map type is \ref concept ::Graph::EdgeMap277 /// edges. The default map type is \ref concepts::Graph::EdgeMap 278 278 /// "Graph::EdgeMap<int>". The value of _LengthMap is not used directly 279 279 /// by DagShortestPath, it is only passed to \ref DagShortestPathDefaultTraits. … … 812 812 /// 813 813 /// 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. 815 815 typedef _LengthMap LengthMap; 816 816 … … 830 830 /// The type of the map that stores the last 831 831 /// 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. 833 833 typedef NullMap <typename _Graph::Node,typename _Graph::Edge> PredMap; 834 834 … … 842 842 /// 843 843 /// 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. 845 845 typedef NullMap<typename Graph::Node, Value> DistMap; 846 846 /// \brief Instantiates a DistMap.
Note: See TracChangeset
for help on using the changeset viewer.