All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Layouter.h
Go to the documentation of this file.
1 /*
2  * Layouter.h
3  *
4  * Created on: Apr 11, 2013
5  * Author: Henning
6  */
7 
8 #ifndef LAYOUTER_H_
9 #define LAYOUTER_H_
10 
11 #include "../graph/Graph.h"
12 
13 namespace NetworKit {
14 
19 class [[deprecated("Use base class LayoutAlgorithm instead")]]
20 Layouter {
21 protected:
22  Point<float> bottomLeft;
23  Point<float> topRight;
24  std::vector<Point<float> > layout;
25  bool initNecessary;
26 
27 public:
31  Layouter() {}
32  Layouter(Point<float> bottomLeft, Point<float> topRight, bool useGivenLayout = false);
33  virtual ~Layouter();
34 
35  virtual void draw(Graph& g) = 0;
36 
37  virtual void initialize(Graph& g);
38  virtual void randomInitCoordinates(Graph& g);
39 };
40 
41 } /* namespace NetworKit */
42 #endif /* LAYOUTER_H_ */
Base class for graph layout algorithms, i.e.
Definition: LayoutAlgorithm.h:21
class deprecated("Use MaximalCliques instead.")]] MaxClique
Exact algorithm for computing the size of the largest clique in a graph.
Definition: MaxClique.h:24
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79