equal
deleted
inserted
replaced
16 |
16 |
17 ///%Dijkstra algorithm class. |
17 ///%Dijkstra algorithm class. |
18 |
18 |
19 ///This class provides an efficient implementation of %Dijkstra algorithm. |
19 ///This class provides an efficient implementation of %Dijkstra algorithm. |
20 ///The edge lengths are passed to the algorithm using a |
20 ///The edge lengths are passed to the algorithm using a |
21 ///\ref ReadMapSkeleton "readable map", |
21 ///\ref ReadMap "readable map", |
22 ///so it is easy to change it to any kind of length. |
22 ///so it is easy to change it to any kind of length. |
23 /// |
23 /// |
24 ///The type of the length is determined by the \c ValueType of the length map. |
24 ///The type of the length is determined by the \c ValueType of the length map. |
25 /// |
25 /// |
26 ///It is also possible to change the underlying priority heap. |
26 ///It is also possible to change the underlying priority heap. |
30 ///EdgeMap |
30 ///EdgeMap |
31 ///determines the |
31 ///determines the |
32 ///lengths of the edges. It is read once for each edge, so the map |
32 ///lengths of the edges. It is read once for each edge, so the map |
33 ///may involve in relatively time consuming process to compute the edge |
33 ///may involve in relatively time consuming process to compute the edge |
34 ///length if it is necessary. The default map type is |
34 ///length if it is necessary. The default map type is |
35 ///\ref GraphSkeleton::EdgeMap "Graph::EdgeMap<int>" |
35 ///\ref Graph::EdgeMap "Graph::EdgeMap<int>" |
36 ///\param Heap The heap type used by the %Dijkstra |
36 ///\param Heap The heap type used by the %Dijkstra |
37 ///algorithm. The default |
37 ///algorithm. The default |
38 ///is using \ref BinHeap "binary heap". |
38 ///is using \ref BinHeap "binary heap". |
39 /// |
39 /// |
40 ///\author Jacint Szabo and Alpar Juttner |
40 ///\author Jacint Szabo and Alpar Juttner |