equal
deleted
inserted
replaced
234 _processed = Traits::createProcessedMap(*G); |
234 _processed = Traits::createProcessedMap(*G); |
235 } |
235 } |
236 } |
236 } |
237 |
237 |
238 public : |
238 public : |
|
239 |
|
240 typedef Dijkstra Create; |
239 |
241 |
240 ///\name Named template parameters |
242 ///\name Named template parameters |
241 |
243 |
242 ///@{ |
244 ///@{ |
243 |
245 |
318 |
320 |
319 |
321 |
320 private: |
322 private: |
321 typename Graph::template NodeMap<int> _heap_map; |
323 typename Graph::template NodeMap<int> _heap_map; |
322 Heap _heap; |
324 Heap _heap; |
|
325 protected: |
|
326 |
|
327 Dijkstra() {} |
|
328 |
323 public: |
329 public: |
324 |
330 |
325 ///Constructor. |
331 ///Constructor. |
326 |
332 |
327 ///\param _G the graph the algorithm will run on. |
333 ///\param _G the graph the algorithm will run on. |