Dijkstra< GR, LEN, TR >::SetStandardHeap< H, CR > Struct Template Reference

---

Detailed Description

template<typename GR, typename LEN, typename TR>
template<class H, class CR = typename Digraph::template NodeMap<int>>
struct lemon::Dijkstra< GR, LEN, TR >::SetStandardHeap< H, CR >

Named parameter for setting heap and cross reference types with automatic allocation. They should have standard constructor interfaces to be able to automatically created by the algorithm (i.e. the digraph should be passed to the constructor of the cross reference and the cross reference should be passed to the constructor of the heap). However external heap and cross reference objects could also be passed to the algorithm using the heap() function before calling run() or init().

See also:

SetHeap

#include <lemon/dijkstra.h>

Inheritance diagram for Dijkstra< GR, LEN, TR >::SetStandardHeap< H, CR >:

List of all members.