All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
GraphDistance.h
Go to the documentation of this file.
1 /*
2  * GraphDistance.h
3  *
4  * Created on: Jul 23, 2013
5  * Author: Henning
6  */
7 
8 #ifndef GRAPHDISTANCE_H_
9 #define GRAPHDISTANCE_H_
10 
11 #include "../graph/Graph.h"
12 #include "Dijkstra.h"
13 #include "BFS.h"
14 
15 namespace NetworKit {
16 
17 // TODO: inherit from NodeDistance
22 public:
23 
25  virtual ~GraphDistance() = default;
26 
36  virtual edgeweight weightedDistance(const Graph& g, node u, node v) const;
37 
46  virtual count unweightedDistance(const Graph& g, node u, node v) const;
47 };
48 
49 } /* namespace NetworKit */
50 #endif /* GRAPHDISTANCE_H_ */
virtual ~GraphDistance()=default
Default destructor.
Definition: GraphDistance.h:21
virtual edgeweight weightedDistance(const Graph &g, node u, node v) const
Returns the distance between u and v in Graph g i.e., the length of the shortest path between the two...
Definition: GraphDistance.cpp:12
uint64_t count
Definition: Globals.h:21
index node
Definition: Globals.h:23
virtual count unweightedDistance(const Graph &g, node u, node v) const
Returns the number of edges on shortest unweighted path between u and v in Graph g.
Definition: GraphDistance.cpp:20
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79
double edgeweight
Definition: Globals.h:24