Class IncompleteSSSP¶

Defined in File IncompleteSSSP.hpp

Inheritance Relationships¶

Derived Type¶

public NetworKit::IncompleteDijkstra (Class IncompleteDijkstra)

Class Documentation¶

class IncompleteSSSP¶

Abstract base class for single-source shortest path algorithms that return the nodes in order of increasing distance from the source and do not necessarily need to compute all distances.

Subclassed by NetworKit::IncompleteDijkstra

Public Functions

virtual bool hasNext() = 0¶: Returns whether there is a next-nearest node or all of the nodes reachable from the source have already been processed.

virtual std::pair<node, edgeweight> next() = 0¶: Returns the next-nearest node from the source and its distance to the source. Should only be called if hasNext() returns true.