All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
LayoutAlgorithm.h
Go to the documentation of this file.
1 /*
2  * LayoutAlgorithm.h
3  *
4  * Created on: May 20 2015
5  * Author: Christian Staudt
6  */
7 
8 #ifndef LAYOUTALGORITHM_H_
9 #define LAYOUTALGORITHM_H_
10 
11 #include "../graph/Graph.h"
12 
13 namespace NetworKit {
14 
22 
23 
24 public:
25 
26  LayoutAlgorithm(const Graph& G) : G(G) {
27 
28  };
29 
30  virtual void run() = 0;
31 
32  virtual std::vector<std::pair<double, double> > getLayout() {
33  return layout;
34  };
35 
36 protected:
37 
38  const Graph& G;
39  std::vector<std::pair<double, double> > layout;
40 
41 };
42 
43 } /* namespace NetworKit */
44 #endif /* LAYOUTALGORITHM_H_ */
Base class for graph layout algorithms, i.e.
Definition: LayoutAlgorithm.h:21
const Graph & G
Definition: LayoutAlgorithm.h:34
virtual std::vector< std::pair< double, double > > getLayout()
Definition: LayoutAlgorithm.h:32
LayoutAlgorithm(const Graph &G)
Definition: LayoutAlgorithm.h:26
std::vector< std::pair< double, double > > layout
Definition: LayoutAlgorithm.h:39
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79