Changeset 2260:4274224f8a7d in lemon-0.x for lemon/dijkstra.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/dijkstra.h
r2230 r2260 49 49 50 50 ///The type of the map that stores the edge lengths. 51 ///It must meet the \ref concept ::ReadMap "ReadMap" concept.51 ///It must meet the \ref concepts::ReadMap "ReadMap" concept. 52 52 typedef LM LengthMap; 53 53 //The type of the length of the edges. … … 87 87 ///The type of the map that stores the last 88 88 ///edges of the shortest paths. 89 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.89 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 90 90 /// 91 91 typedef typename Graph::template NodeMap<typename GR::Edge> PredMap; … … 103 103 104 104 ///The type of the map that stores whether a nodes is processed. 105 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.105 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 106 106 ///By default it is a NullMap. 107 107 ///\todo If it is set to a real map, … … 125 125 126 126 ///The type of the map that stores the dists of the nodes. 127 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.127 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 128 128 /// 129 129 typedef typename Graph::template NodeMap<typename LM::Value> DistMap; … … 143 143 ///This class provides an efficient implementation of %Dijkstra algorithm. 144 144 ///The edge lengths are passed to the algorithm using a 145 ///\ref concept ::ReadMap "ReadMap",145 ///\ref concepts::ReadMap "ReadMap", 146 146 ///so it is easy to change it to any kind of length. 147 147 /// 148 148 ///The type of the length is determined by the 149 ///\ref concept ::ReadMap::Value "Value" of the length map.149 ///\ref concepts::ReadMap::Value "Value" of the length map. 150 150 /// 151 151 ///It is also possible to change the underlying priority heap. … … 158 158 ///relatively time consuming process to compute the edge length if 159 159 ///it is necessary. The default map type is \ref 160 ///concept ::Graph::EdgeMap "Graph::EdgeMap<int>". The value160 ///concepts::Graph::EdgeMap "Graph::EdgeMap<int>". The value 161 161 ///of LM is not used directly by Dijkstra, it is only passed to \ref 162 162 ///DijkstraDefaultTraits. \param TR Traits class to set … … 820 820 821 821 ///The type of the map that stores the edge lengths. 822 ///It must meet the \ref concept ::ReadMap "ReadMap" concept.822 ///It must meet the \ref concepts::ReadMap "ReadMap" concept. 823 823 typedef LM LengthMap; 824 824 //The type of the length of the edges. … … 862 862 ///The type of the map that stores the last 863 863 ///edges of the shortest paths. 864 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.864 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 865 865 /// 866 866 typedef NullMap <typename GR::Node,typename GR::Edge> PredMap; … … 881 881 882 882 ///The type of the map that stores whether a nodes is processed. 883 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.883 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 884 884 ///By default it is a NullMap. 885 885 ///\todo If it is set to a real map, … … 903 903 904 904 ///The type of the map that stores the dists of the nodes. 905 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.905 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 906 906 /// 907 907 typedef NullMap<typename Graph::Node,typename LM::Value> DistMap;
Note: See TracChangeset
for help on using the changeset viewer.