Abstract base class for singlesource shortest path algorithms that return the nodes in order of increasing distance from the source and do not necessarily need to compute all distances. More...
#include <IncompleteSSSP.h>
Public Member Functions  
virtual bool  hasNext ()=0 
Returns whether there is a nextnearest node or all of the nodes reachable from the source have already been processed. More...  
virtual std::pair< node, edgeweight >  next ()=0 
Returns the nextnearest node from the source and its distance to the source. More...  
Abstract base class for singlesource shortest path algorithms that return the nodes in order of increasing distance from the source and do not necessarily need to compute all distances.

pure virtual 
Returns whether there is a nextnearest node or all of the nodes reachable from the source have already been processed.
Implemented in NetworKit::IncompleteDijkstra.

pure virtual 
Returns the nextnearest node from the source and its distance to the source.
Should only be called if hasNext() returns true.
Implemented in NetworKit::IncompleteDijkstra.