All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Public Member Functions | List of all members
NetworKit::IncompleteSSSP Class Referenceabstract

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. More...

#include <IncompleteSSSP.h>

Public Member 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. More...
 
virtual std::pair< node,
edgeweight
next ()=0
 Returns the next-nearest node from the source and its distance to the source. More...
 

Detailed Description

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.

Member Function Documentation

virtual bool NetworKit::IncompleteSSSP::hasNext ( )
pure virtual

Returns whether there is a next-nearest node or all of the nodes reachable from the source have already been processed.

Implemented in NetworKit::IncompleteDijkstra.

virtual std::pair<node, edgeweight> NetworKit::IncompleteSSSP::next ( )
pure virtual

Returns the next-nearest node from the source and its distance to the source.

Should only be called if hasNext() returns true.

Implemented in NetworKit::IncompleteDijkstra.


The documentation for this class was generated from the following file: