src/lemon/dijkstra.h
changeset 978 175cf8c3a994
parent 921 818510fa3d99
child 986 e997802b855c
equal deleted inserted replaced
0:b5b612d14e1d 1:69ecae2eb7be
    31 
    31 
    32   ///%Dijkstra algorithm class.
    32   ///%Dijkstra algorithm class.
    33 
    33 
    34   ///This class provides an efficient implementation of %Dijkstra algorithm.
    34   ///This class provides an efficient implementation of %Dijkstra algorithm.
    35   ///The edge lengths are passed to the algorithm using a
    35   ///The edge lengths are passed to the algorithm using a
    36   ///\ref skeleton::ReadMap "ReadMap",
    36   ///\ref concept::ReadMap "ReadMap",
    37   ///so it is easy to change it to any kind of length.
    37   ///so it is easy to change it to any kind of length.
    38   ///
    38   ///
    39   ///The type of the length is determined by the
    39   ///The type of the length is determined by the
    40   ///\ref skeleton::ReadMap::ValueType "ValueType" of the length map.
    40   ///\ref concept::ReadMap::ValueType "ValueType" of the length map.
    41   ///
    41   ///
    42   ///It is also possible to change the underlying priority heap.
    42   ///It is also possible to change the underlying priority heap.
    43   ///
    43   ///
    44   ///\param GR The graph type the algorithm runs on.
    44   ///\param GR The graph type the algorithm runs on.
    45   ///\param LM This read-only
    45   ///\param LM This read-only
    46   ///EdgeMap
    46   ///EdgeMap
    47   ///determines the
    47   ///determines the
    48   ///lengths of the edges. It is read once for each edge, so the map
    48   ///lengths of the edges. It is read once for each edge, so the map
    49   ///may involve in relatively time consuming process to compute the edge
    49   ///may involve in relatively time consuming process to compute the edge
    50   ///length if it is necessary. The default map type is
    50   ///length if it is necessary. The default map type is
    51   ///\ref skeleton::StaticGraph::EdgeMap "Graph::EdgeMap<int>"
    51   ///\ref concept::StaticGraph::EdgeMap "Graph::EdgeMap<int>"
    52   ///\param Heap The heap type used by the %Dijkstra
    52   ///\param Heap The heap type used by the %Dijkstra
    53   ///algorithm. The default
    53   ///algorithm. The default
    54   ///is using \ref BinHeap "binary heap".
    54   ///is using \ref BinHeap "binary heap".
    55   ///
    55   ///
    56   ///\author Jacint Szabo and Alpar Juttner
    56   ///\author Jacint Szabo and Alpar Juttner