equal
deleted
inserted
replaced
225 typedef PredMapPath<Digraph, PredMap> Path; |
225 typedef PredMapPath<Digraph, PredMap> Path; |
226 ///The cross reference type used for the current heap. |
226 ///The cross reference type used for the current heap. |
227 typedef typename TR::HeapCrossRef HeapCrossRef; |
227 typedef typename TR::HeapCrossRef HeapCrossRef; |
228 ///The heap type used by the algorithm. |
228 ///The heap type used by the algorithm. |
229 typedef typename TR::Heap Heap; |
229 typedef typename TR::Heap Heap; |
230 ///\brief The \ref DijkstraDefaultOperationTraits "operation traits class" |
230 /// \brief The \ref lemon::DijkstraDefaultOperationTraits |
231 ///of the algorithm. |
231 /// "operation traits class" of the algorithm. |
232 typedef typename TR::OperationTraits OperationTraits; |
232 typedef typename TR::OperationTraits OperationTraits; |
233 |
233 |
234 ///The \ref DijkstraDefaultTraits "traits class" of the algorithm. |
234 ///The \ref lemon::DijkstraDefaultTraits "traits class" of the algorithm. |
235 typedef TR Traits; |
235 typedef TR Traits; |
236 |
236 |
237 private: |
237 private: |
238 |
238 |
239 typedef typename Digraph::Node Node; |
239 typedef typename Digraph::Node Node; |