All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
IncompleteSSSP.h
Go to the documentation of this file.
1 /*
2  * IncompleteSSSP.h
3  *
4  * Created on: 15.07.2014
5  * Author: dhoske
6  */
7 
8 #ifndef INCOMPLETESSSP_H_
9 #define INCOMPLETESSSP_H_
10 
11 #include "../graph/Graph.h"
12 
13 namespace NetworKit {
14 
22 
23 public:
24 
30  virtual bool hasNext() = 0;
31 
37  virtual std::pair<node, edgeweight> next() = 0;
38 };
39 
40 }
41 
42 #endif
Abstract base class for single-source shortest path algorithms that return the nodes in order of incr...
Definition: IncompleteSSSP.h:21
virtual bool hasNext()=0
Returns whether there is a next-nearest node or all of the nodes reachable from the source have alrea...
virtual std::pair< node, edgeweight > next()=0
Returns the next-nearest node from the source and its distance to the source.