equal
deleted
inserted
replaced
98 |
98 |
99 ///%Dijkstra algorithm class. |
99 ///%Dijkstra algorithm class. |
100 |
100 |
101 ///This class provides an efficient implementation of %Dijkstra algorithm. |
101 ///This class provides an efficient implementation of %Dijkstra algorithm. |
102 ///The edge lengths are passed to the algorithm using a |
102 ///The edge lengths are passed to the algorithm using a |
103 ///\ref skeleton::ReadMap "ReadMap", |
103 ///\ref concept::ReadMap "ReadMap", |
104 ///so it is easy to change it to any kind of length. |
104 ///so it is easy to change it to any kind of length. |
105 /// |
105 /// |
106 ///The type of the length is determined by the |
106 ///The type of the length is determined by the |
107 ///\ref skeleton::ReadMap::ValueType "ValueType" of the length map. |
107 ///\ref concept::ReadMap::ValueType "ValueType" of the length map. |
108 /// |
108 /// |
109 ///It is also possible to change the underlying priority heap. |
109 ///It is also possible to change the underlying priority heap. |
110 /// |
110 /// |
111 ///\param GR The graph type the algorithm runs on. The default value is |
111 ///\param GR The graph type the algorithm runs on. The default value is |
112 ///\ref ListGraph. The value of GR is not used directly by Dijkstra, it |
112 ///\ref ListGraph. The value of GR is not used directly by Dijkstra, it |
115 ///EdgeMap |
115 ///EdgeMap |
116 ///determines the |
116 ///determines the |
117 ///lengths of the edges. It is read once for each edge, so the map |
117 ///lengths of the edges. It is read once for each edge, so the map |
118 ///may involve in relatively time consuming process to compute the edge |
118 ///may involve in relatively time consuming process to compute the edge |
119 ///length if it is necessary. The default map type is |
119 ///length if it is necessary. The default map type is |
120 ///\ref skeleton::StaticGraph::EdgeMap "Graph::EdgeMap<int>". |
120 ///\ref concept::StaticGraph::EdgeMap "Graph::EdgeMap<int>". |
121 ///The value of LM is not used directly by Dijkstra, it |
121 ///The value of LM is not used directly by Dijkstra, it |
122 ///is only passed to \ref DijkstraDefaultTraits. |
122 ///is only passed to \ref DijkstraDefaultTraits. |
123 ///\param TR Traits class to set various data types used by the algorithm. |
123 ///\param TR Traits class to set various data types used by the algorithm. |
124 ///The default traits class is |
124 ///The default traits class is |
125 ///\ref DijkstraDefaultTraits "DijkstraDefaultTraits<GR,LM>". |
125 ///\ref DijkstraDefaultTraits "DijkstraDefaultTraits<GR,LM>". |