/usr/include/vtk-6.3/vtkForceDirectedLayoutStrategy.h is in libvtk6-dev 6.3.0+dfsg1-5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 | /*=========================================================================
Program: Visualization Toolkit
Module: vtkForceDirectedLayoutStrategy.h
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
/*-------------------------------------------------------------------------
Copyright 2008 Sandia Corporation.
Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
the U.S. Government retains certain rights in this software.
-------------------------------------------------------------------------*/
// .NAME vtkForceDirectedLayoutStrategy - a force directed graph layout algorithm
//
// .SECTION Description
// Lays out a graph in 2D or 3D using a force-directed algorithm.
// The user may specify whether to layout the graph randomly initially,
// the bounds, the number of dimensions (2 or 3), and the cool-down rate.
//
// .SECTION Thanks
// Thanks to Brian Wylie for adding functionality for allowing this layout
// to be incremental.
#ifndef vtkForceDirectedLayoutStrategy_h
#define vtkForceDirectedLayoutStrategy_h
#include "vtkInfovisLayoutModule.h" // For export macro
#include "vtkGraphLayoutStrategy.h"
class VTKINFOVISLAYOUT_EXPORT vtkForceDirectedLayoutStrategy : public vtkGraphLayoutStrategy
{
public:
static vtkForceDirectedLayoutStrategy *New();
vtkTypeMacro(vtkForceDirectedLayoutStrategy, vtkGraphLayoutStrategy);
void PrintSelf(ostream& os, vtkIndent indent);
// Description:
// Seed the random number generator used to jitter point positions.
// This has a significant effect on their final positions when
// the layout is complete.
vtkSetClampMacro(RandomSeed, int, 0, VTK_INT_MAX);
vtkGetMacro(RandomSeed, int);
// Description:
// Set / get the region in space in which to place the final graph.
// The GraphBounds only affects the results if AutomaticBoundsComputation
// is off.
vtkSetVector6Macro(GraphBounds,double);
vtkGetVectorMacro(GraphBounds,double,6);
// Description:
// Turn on/off automatic graph bounds calculation. If this
// boolean is off, then the manually specified GraphBounds is used.
// If on, then the input's bounds us used as the graph bounds.
vtkSetMacro(AutomaticBoundsComputation, int);
vtkGetMacro(AutomaticBoundsComputation, int);
vtkBooleanMacro(AutomaticBoundsComputation, int);
// Description:
// Set/Get the maximum number of iterations to be used.
// The higher this number, the more iterations through the algorithm
// is possible, and thus, the more the graph gets modified.
// The default is '50' for no particular reason
vtkSetClampMacro(MaxNumberOfIterations, int, 0, VTK_INT_MAX);
vtkGetMacro(MaxNumberOfIterations, int);
// Description:
// Set/Get the number of iterations per layout.
// The only use for this ivar is for the application
// to do visualizations of the layout before it's complete.
// The default is '50' to match the default 'MaxNumberOfIterations'
vtkSetClampMacro(IterationsPerLayout, int, 0, VTK_INT_MAX);
vtkGetMacro(IterationsPerLayout, int);
// Description:
// Set/Get the Cool-down rate.
// The higher this number is, the longer it will take to "cool-down",
// and thus, the more the graph will be modified.
vtkSetClampMacro(CoolDownRate, double, 0.01, VTK_DOUBLE_MAX);
vtkGetMacro(CoolDownRate, double);
// Description:
// Turn on/off layout of graph in three dimensions. If off, graph
// layout occurs in two dimensions. By default, three dimensional
// layout is off.
vtkSetMacro(ThreeDimensionalLayout, int);
vtkGetMacro(ThreeDimensionalLayout, int);
vtkBooleanMacro(ThreeDimensionalLayout, int);
// Description:
// Turn on/off use of random positions within the graph bounds as initial points.
vtkSetMacro(RandomInitialPoints, int);
vtkGetMacro(RandomInitialPoints, int);
vtkBooleanMacro(RandomInitialPoints, int);
// Description:
// Set the initial temperature. If zero (the default) , the initial temperature
// will be computed automatically.
vtkSetClampMacro(InitialTemperature, float, 0.0, VTK_FLOAT_MAX);
vtkGetMacro(InitialTemperature, float);
// Description:
// This strategy sets up some data structures
// for faster processing of each Layout() call
virtual void Initialize();
// Description:
// This is the layout method where the graph that was
// set in SetGraph() is laid out. The method can either
// entirely layout the graph or iteratively lay out the
// graph. If you have an iterative layout please implement
// the IsLayoutComplete() method.
virtual void Layout();
// Description:
// I'm an iterative layout so this method lets the caller
// know if I'm done laying out the graph
virtual int IsLayoutComplete() {return this->LayoutComplete;}
protected:
vtkForceDirectedLayoutStrategy();
~vtkForceDirectedLayoutStrategy();
double GraphBounds[6];
int AutomaticBoundsComputation; //Boolean controls automatic bounds calc.
int MaxNumberOfIterations; //Maximum number of iterations.
double CoolDownRate; //Cool-down rate. Note: Higher # = Slower rate.
double InitialTemperature;
int ThreeDimensionalLayout; //Boolean for a third dimension.
int RandomInitialPoints; //Boolean for having random points
private:
//BTX
// A vertex contains a position and a displacement.
typedef struct
{
double x[3];
double d[3];
} vtkLayoutVertex;
// An edge consists of two vertices joined together.
// This struct acts as a "pointer" to those two vertices.
typedef struct
{
int t;
int u;
} vtkLayoutEdge;
//ETX
int RandomSeed;
int IterationsPerLayout;
int TotalIterations;
int LayoutComplete;
double Temp;
double optDist;
vtkLayoutVertex *v;
vtkLayoutEdge *e;
vtkForceDirectedLayoutStrategy(const vtkForceDirectedLayoutStrategy&); // Not implemented.
void operator=(const vtkForceDirectedLayoutStrategy&); // Not implemented.
};
#endif
|