HopPlotApproximation.h
Go to the documentation of this file.
1 /*
2 * HopPlotApproximation.h
3 *
4 * Created on: 30.03.2016
5 * Author: Maximilian Vogel
6 */
7
8 #ifndef HOPPLOTAPPROXIMATION_H_
9 #define HOPPLOTAPPROXIMATION_H_
10
11 #include <map>
12 #include "../graph/Graph.h"
13 #include "../base/Algorithm.h"
14
15 namespace NetworKit {
16
21
22 public:
37  HopPlotApproximation(const Graph& G, const count maxDistance=0, const count k=64, const count r=7);
38
39  void run() override;
40
45  std::map<count, double> getHopPlot() const;
46
47 private:
48  const Graph& G;
49  const count maxDistance;
50  const count k;
51  const count r;
52  std::map<count, double> hopPlot;
53
54 };
55
56 } /* namespace NetworKit */
57
58 #endif /* HOPPLOTAPPROXIMATION_H_ */
std::map< count, double > getHopPlot() const
Returns the approximated hop-plot of the graph.
Definition: HopPlotApproximation.cpp:144
void run() override
The generic run method which calls runImpl() and takes care of setting to the appropriate value...
Definition: HopPlotApproximation.cpp:27
HopPlotApproximation(const Graph &G, const count maxDistance=0, const count k=64, const count r=7)
Computes an approxmation of the hop-plot of a given graph The hop-plot is the set of pairs (d...
Definition: HopPlotApproximation.cpp:20
Definition: HopPlotApproximation.h:20
uint64_t count
Definition: Globals.h:21
Definition: Algorithm.h:9
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79