All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
FruchtermanReingold.h
Go to the documentation of this file.
1 /*
2  * ForceDirected.h
3  *
4  * Created on: Apr 11, 2013
5  * Author: Henning
6  */
7 
8 #ifndef FORCEDIRECTED_H_
9 #define FORCEDIRECTED_H_
10 
11 #include "Layouter.h"
12 #include "Point.h"
13 #include "PostscriptWriter.h"
14 
15 #include <vector>
16 #include <cmath>
17 
18 
19 namespace NetworKit {
20 
21 const count MAX_ITER = 300;
22 const double EPS = 0.1;
23 
34 class [[deprecated]]
35 FruchtermanReingold: public NetworKit::Layouter {
36 private:
37  static const float INITIAL_STEP_LENGTH;
38  static const float OPT_PAIR_SQR_DIST_SCALE;
39 
40  count maxIter;
41  float prec;
42  float step;
43 
44 public:
45 
51 
57  FruchtermanReingold(Point<float> bottomLeft, Point<float> topRight, bool useGivenCoordinates = false, count maxIterations = MAX_ITER, float precision = EPS);
58 
62  virtual void draw(Graph& g);
63 };
64 
65 } /* namespace NetworKit */
66 #endif /* FORCEDIRECTED_H_ */
DEPRECATED Fruchterman-Reingold graph drawing algorithm.
Definition: FruchtermanReingold.h:34
class deprecated("Use MaximalCliques instead.")]] MaxClique
Exact algorithm for computing the size of the largest clique in a graph.
Definition: MaxClique.h:24
FruchtermanReingold()
Constructor.
Definition: FruchtermanReingold.h:50
uint64_t count
Definition: Globals.h:21
const count MAX_ITER
Definition: FruchtermanReingold.h:21
const double EPS
Definition: FruchtermanReingold.h:22
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79