Template Class DequeFrontier

Defined in File ShortestPaths.h

Class Documentation

template<class Q> class DequeFrontier

a deque as S, the rule of Pape and D’Esopo: a node at the tail the first time, at the head afterwards, extracted from the head

Public Functions

inline explicit DequeFrontier(Q &q)

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

inline int extract(void)

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

inline bool empty(void) const