Template Class PriorityFrontier

• Defined in File ShortestPaths.h

Class Documentation

template<PriorityQueue Q>
class PriorityFrontier

a priority queue of the nodes [see PriorityQueue.h] as S: the priority of a node its distance or, if the priority is a pair, the pair ( distance , node ), which breaks the ties by the names of the nodes, so that any priority queue extracts the same nodes in the same order

Public Functions

inline PriorityFrontier(Q &q, int n)

S on the queue q, empty, for the nodes [ 0 , n )

Pre:

q is empty, n >= 0

template<class D>
inline void add(int v, const D &d, bool)

inline int extract(void)

template<class D>
inline void update(int v, const D &d)

inline bool empty(void) const

Public Static Functions

template<class D>
static inline Q::Priority key(int v, const D &d)

the priority of v at the distance d