src/hugo/dijkstra.h
changeset 890 3a48bc350e0f
parent 802 bc0c74eeb151
child 906 17f31d280385
equal deleted inserted replaced
15:86860d5ab29b 16:3f2469b20d7c
    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 skeleton::ReadMap "ReadMap",
    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
       
    25   ///\ref skeleton::ReadMap::ValueType "ValueType" of the length map.
    25   ///
    26   ///
    26   ///It is also possible to change the underlying priority heap.
    27   ///It is also possible to change the underlying priority heap.
    27   ///
    28   ///
    28   ///\param GR The graph type the algorithm runs on.
    29   ///\param GR The graph type the algorithm runs on.
    29   ///\param LM This read-only
    30   ///\param LM This read-only
    30   ///EdgeMap
    31   ///EdgeMap
    31   ///determines the
    32   ///determines the
    32   ///lengths of the edges. It is read once for each edge, so the map
    33   ///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
    34   ///may involve in relatively time consuming process to compute the edge
    34   ///length if it is necessary. The default map type is
    35   ///length if it is necessary. The default map type is
    35   ///\ref GraphSkeleton::EdgeMap "Graph::EdgeMap<int>"
    36   ///\ref skeleton::StaticGraph::EdgeMap "Graph::EdgeMap<int>"
    36   ///\param Heap The heap type used by the %Dijkstra
    37   ///\param Heap The heap type used by the %Dijkstra
    37   ///algorithm. The default
    38   ///algorithm. The default
    38   ///is using \ref BinHeap "binary heap".
    39   ///is using \ref BinHeap "binary heap".
    39   ///
    40   ///
    40   ///\author Jacint Szabo and Alpar Juttner
    41   ///\author Jacint Szabo and Alpar Juttner