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
|
/**
*
* This file is part of Tulip (www.tulip-software.org)
*
* 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 LinLogAlgorithm_H_
#define LinLogAlgorithm_H_
/// An implementation of the LinLog layout algorithm
/** This plugin is an implementation of the LinLog
* algorithm first published as:
*
* Andreas Noack. \n
* "Energy Models for Graph Clustering", \n
* in Journal of Graph \n
* Algorithms and Applications 11(2):453-480, 2007
* http://www-sst.informatik.tu-cottbus.de/~an/Publications/JGAA2007.pdf
*
* The code of the plugin has been translated and adapted
* from A. Noack's java implementation of the LinLog algorithm
*/
#include <tulip/TulipPluginHeaders.h>
class LinLogLayout;
class LinLogAlgorithm : public tlp::LayoutAlgorithm {
public :
PLUGININFORMATION("LinLog", "B. Renoust","11/02/13",
"Implements the LinLog layout algorithm, an energy model layout algorithm, first published as:<br/>"
"<b>Energy Models for Graph Clustering</b>, Andreas Noack., "
"Journal of Graph Algorithms and Applications 11(2):453-480, 2007.",
"1.0","Force Directed");
LinLogAlgorithm(const tlp::PluginContext *context);
~LinLogAlgorithm ();
bool run();
private :
LinLogLayout* linlog;
};
#endif
|
