All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Dijkstra.h
Go to the documentation of this file.
1 /*
2  * Dijkstra.h
3  *
4  * Created on: Jul 23, 2013
5  * Author: Henning, Christian Staudt
6  */
7 
8 #ifndef DIJKSTRA_H_
9 #define DIJKSTRA_H_
10 
11 #include "../graph/Graph.h"
12 #include "SSSP.h"
13 #include "../auxiliary/PrioQueue.h"
14 
15 namespace NetworKit {
16 
21 class Dijkstra : public SSSP {
22 
23 friend class DynDijkstra;
24 friend class DynDijkstra2;
25 
26 public:
27 
37  Dijkstra(const Graph& G, node source, bool storePaths=true, bool storeNodesSortedByDistance=false, node target = none);
38 
42  virtual void run();
43 };
44 
45 } /* namespace NetworKit */
46 #endif /* DIJKSTRA_H_ */
virtual void run()
Performs the Dijkstra SSSP algorithm on the graph given in the constructor.
Definition: Dijkstra.cpp:18
node target
Definition: SSSP.h:129
const node source
Definition: SSSP.h:128
const Graph & G
Definition: SSSP.h:127
Dijkstra(const Graph &G, node source, bool storePaths=true, bool storeNodesSortedByDistance=false, node target=none)
Creates the Dijkstra class for G and the source node source.
Definition: Dijkstra.cpp:14
friend class DynDijkstra2
Definition: Dijkstra.h:24
Dijkstra's SSSP algorithm.
Definition: Dijkstra.h:21
Abstract base class for single-source shortest path algorithms.
Definition: SSSP.h:23
constexpr index none
Constants.
Definition: Globals.h:28
index node
Definition: Globals.h:23
bool storeNodesSortedByDistance
if true, store a vector of nodes ordered in increasing distance from the source
Definition: SSSP.h:137
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79
Dynamic Dijkstra.
Definition: DynDijkstra.h:19
bool storePaths
if true, paths are reconstructable and the number of paths is stored
Definition: SSSP.h:136