#include <forcebundler.h>
ForceBundler class performs the main bundling algorithm on the graph passed as an argument.
void ForceBundler::bundleEdges |
( |
int |
cycles, |
|
|
int |
iterations, |
|
|
double |
springConstant |
|
) |
| |
bundleEdges performs the main bundling algorithm on the graph.
- Parameters
-
cycles | determines how many cycles the edge bundling process iterates over. |
iterations | specifies the number of iterations within one cycle. |
springConstant | denotes the stiffness of the edges |
DO ALL THE CYCLES!
DO ALL THE ITERATIONS!
DO ALL THE EDGES!
COMPARE ALL THE EDGES!
QVector< QVector< double > > * ForceBundler::calculateCompatibilities |
( |
QList< Edge * > * |
edges | ) |
|
UNUSED: Deprecated approach that also calculates pairwise compatibilities for the list of passed edges. Does not sort out smaller compatibilities.
- Parameters
-
edges | list of edges the pairwise compatibilities are to be calculated from |
- Returns
- a vector that stores for each edge a vector containing the compatibilities to all other edges
QVector< QMap< int, double > > * ForceBundler::compatibleEdges |
( |
QList< Edge * > * |
edges | ) |
|
for performance reasons, the costly compatibility calculation is performed only once per bundling call and stored in a Map.
- Parameters
-
edges | list of edges the pairwise compatibilities are to be calculated from |
- Returns
- a vector that stores for each edge a map of compatible edges with a compatibility > 0.1
void ForceBundler::setGraph |
( |
Graph * |
g | ) |
|
|
inline |
void ForceBundler::setProgress |
( |
int |
p | ) |
|
|
signal |
TODO signal to notify the main window's progress bar of the progress of graph generation
The documentation for this class was generated from the following files: