Changeset 2260:4274224f8a7d in lemon-0.x for lemon/johnson.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/johnson.h
r2230 r2260 97 97 /// 98 98 /// The type of the map that stores the edge lengths. 99 /// It must meet the \ref concept ::ReadMap "ReadMap" concept.99 /// It must meet the \ref concepts::ReadMap "ReadMap" concept. 100 100 typedef _LengthMap LengthMap; 101 101 … … 163 163 /// 164 164 /// The type of the matrix map that stores the dists of the nodes. 165 /// It must meet the \ref concept ::WriteMatrixMap "WriteMatrixMap" concept.165 /// It must meet the \ref concepts::WriteMatrixMap "WriteMatrixMap" concept. 166 166 /// 167 167 typedef DynamicMatrixMap<Graph, typename Graph::Node, Value> DistMap; … … 183 183 /// This class provides an efficient implementation of \c %Johnson 184 184 /// algorithm. The edge lengths are passed to the algorithm using a 185 /// \ref concept ::ReadMap "ReadMap", so it is easy to change it to any185 /// \ref concepts::ReadMap "ReadMap", so it is easy to change it to any 186 186 /// kind of length. 187 187 /// … … 198 198 /// 199 199 /// The type of the length is determined by the 200 /// \ref concept ::ReadMap::Value "Value" of the length map.200 /// \ref concepts::ReadMap::Value "Value" of the length map. 201 201 /// 202 202 /// \param _Graph The graph type the algorithm runs on. The default value … … 207 207 /// relatively time consuming process to compute the edge length if 208 208 /// it is necessary. The default map type is \ref 209 /// concept ::Graph::EdgeMap "Graph::EdgeMap<int>". The value209 /// concepts::Graph::EdgeMap "Graph::EdgeMap<int>". The value 210 210 /// of _LengthMap is not used directly by Johnson, it is only passed 211 211 /// to \ref JohnsonDefaultTraits. \param _Traits Traits class to set
Note: See TracChangeset
for help on using the changeset viewer.