File: LinLogLayout.h

package info (click to toggle)
tulip 6.0.1%2Bdfsg-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 196,224 kB
  • sloc: cpp: 571,851; ansic: 13,983; python: 4,105; sh: 1,555; yacc: 522; xml: 484; makefile: 168; pascal: 148; lex: 55
file content (94 lines) | stat: -rw-r--r-- 2,957 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
/**
 *
 * This file is part of Tulip (https://tulip.labri.fr)
 *
 * Authors: David Auber and the Tulip development Team
 * from LaBRI, University of Bordeaux
 *
 * Tulip is free software; you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License
 * as published by the Free Software Foundation, either version 3
 * of the License, or (at your option) any later version.
 *
 * Tulip is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
 * See the GNU General Public License for more details.
 *
 */
#ifndef LinLogLayout_H
#define LinLogLayout_H

#include <tulip/TulipPluginHeaders.h>
#include "OctTree.h"

namespace tlp {

class LinLogLayout {

public:
  LinLogLayout(tlp::Graph *_graph, tlp::PluginProgress *pluginProgress);
  bool initAlgo(tlp::LayoutProperty *_layoutResult, tlp::NumericProperty *_weight,
                double _attrExponent, double _repuExponent, double _gravFactor,
                unsigned int _max_iter, bool _is3D, bool _useOctTree,
                tlp::BooleanProperty *_skipNodes);

  bool startAlgo();

private:
  tlp::NumericProperty *edgeWeight;
  tlp::LayoutProperty *layoutResult;
  tlp::DoubleProperty linLogWeight;
  tlp::BooleanProperty *skipNodes;
  tlp::Graph *graph;

  tlp::PluginProgress *pluginProgress;

  unsigned int _dim;     // 2 or 3;
  unsigned int _nbNodes; // number of nodes in the graph
  unsigned int max_iter; // the max number of iterations
  bool useOctTree;

  /** Factor for repulsion energy. */
  double repuFactor;
  /** Exponent of the Euclidean distance in the repulsion energy. */
  double repuExponent;
  /** Exponent of the Euclidean distance in the attraction energy. */
  double attrExponent;
  /** Factor for the gravitation energy = attraction to the barycenter.
      Set to 0.0 for no gravitation. */
  double gravFactor;

  /** Position of the barycenter of the nodes. */
  Coord baryCenter;

  double getGravitationEnergy(node u);
  double getAttractionEnergy(node u);
  double getRepulsionEnergy(node u);
  double getEnergy(node u);
  double getDist(const Coord &pos1, const Coord &pos2);
  double getDistForComparison(const Coord &pos1, const Coord &pos2);

  double addRepulsionDir(node u, double *dir);
  double addAttractionDir(node u, double *dir);
  double addGravitationDir(node u, double *dir);
  void getDirection(node u, double *dir);

  bool minimizeEnergyNoTree(int nrIterations);

  void initEnergyFactors();
  void computeBaryCenter();

  void setComputationalWeigths();

  void initWeights();

  OctTree *buildOctTree();
  bool minimizeEnergy(int nrIterations);
  double addRepulsionDir(node u, double *dir, OctTree *tree);
  double getRepulsionEnergy(node u, OctTree *tree);
  double getEnergy(node u, OctTree *tree);
  void getDirection(node u, double *dir, OctTree *tree);
};
} // namespace tlp
#endif