Template Class QueueFrontier

• Defined in File ShortestPaths.h

Class Documentation

template<class Q>
class QueueFrontier

a queue as S, enqueue() and dequeue(): first in, first out, so that a node leaves S at most n times unless a negative cycle is reachable

Public Functions

inline explicit QueueFrontier(Q &q)

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

inline int extract(void)

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

inline bool empty(void) const

Public Static Attributes

static constexpr bool fifo = true

the bound of the extractions