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 |
41 ///\todo We need a typedef-names should be standardized. |
41 ///\todo We need a typedef-names should be standardized. (-: |
42 |
42 |
43 #ifdef DOXYGEN |
43 #ifdef DOXYGEN |
44 template <typename GR, |
44 template <typename GR, |
45 typename LM, |
45 typename LM, |
46 typename Heap> |
46 typename Heap> |
58 typedef typename Graph::Edge Edge; |
58 typedef typename Graph::Edge Edge; |
59 typedef typename Graph::OutEdgeIt OutEdgeIt; |
59 typedef typename Graph::OutEdgeIt OutEdgeIt; |
60 |
60 |
61 ///The type of the length of the edges. |
61 ///The type of the length of the edges. |
62 typedef typename LM::ValueType ValueType; |
62 typedef typename LM::ValueType ValueType; |
63 ///The the type of the map that stores the edge lengths. |
63 ///The type of the map that stores the edge lengths. |
64 typedef LM LengthMap; |
64 typedef LM LengthMap; |
65 ///\brief The the type of the map that stores the last |
65 ///\brief The type of the map that stores the last |
66 ///edges of the shortest paths. |
66 ///edges of the shortest paths. |
67 typedef typename Graph::template NodeMap<Edge> PredMap; |
67 typedef typename Graph::template NodeMap<Edge> PredMap; |
68 ///\brief The the type of the map that stores the last but one |
68 ///\brief The type of the map that stores the last but one |
69 ///nodes of the shortest paths. |
69 ///nodes of the shortest paths. |
70 typedef typename Graph::template NodeMap<Node> PredNodeMap; |
70 typedef typename Graph::template NodeMap<Node> PredNodeMap; |
71 ///The the type of the map that stores the dists of the nodes. |
71 ///The type of the map that stores the dists of the nodes. |
72 typedef typename Graph::template NodeMap<ValueType> DistMap; |
72 typedef typename Graph::template NodeMap<ValueType> DistMap; |
73 |
73 |
74 private: |
74 private: |
75 const Graph *G; |
75 const Graph *G; |
76 const LM *length; |
76 const LM *length; |