Topology Class Reference

#include <Topology.h>

Public Member Functions
	Topology ()
virtual	~Topology ()
void	applyCircleAlignment (DataList dataList, qreal radius=0)
void	applyMinCutTreeAlignment (DataList dataList)
void	directedGraphDefaultTopology (DataStructurePtr dataStructure)
void	undirectedGraphDefaultTopology (DataStructurePtr dataStructure)

Detailed Description

this class provides topology modifiers for data structures

Methods of this class either can be applied to data structures to make unique changes or connected to specific re-format signals to apply a given topology after every change of the structure.

Definition at line 36 of file Topology.h.

Constructor & Destructor Documentation

Topology::Topology

(

)

Definition at line 56 of file Topology.cpp.

Topology::~Topology ( )

virtual

Definition at line 61 of file Topology.cpp.

Member Function Documentation

void Topology::applyCircleAlignment	(	DataList	dataList,
		qreal	radius = 0
	)

applies Circle topology to data set

For the given data set this algorithm applies the Boost implementation to create a circle layout. If a radius is specified, the circle will get the specified radius, otherwise with no radius set the diameter of the minimal bounding box of all data element positions is used to determine the radius.

Parameters

dataList	is the list of data
radius	to optionally specify target radius

Returns

void

Definition at line 143 of file Topology.cpp.

void Topology::applyMinCutTreeAlignment

(

DataList

dataList

)

applies Fruchterman-Reingold cut minimization

For the given data set this algorithm applies the Boost implementation of the Frutherman-Reingold force directed layout algorithm to minimize crossing edges. Data must be element of the same data structure. The crossings of all present edges contained in this data structure are minimized. This method directly modifies the data.

Parameters

dataList

is the list of data

Returns

void

Definition at line 66 of file Topology.cpp.

void Topology::directedGraphDefaultTopology

(

DataStructurePtr

dataStructure

)

applies a default topology for undirected graphs

Use this method to apply a best-fit topology to an undirected graph (though the data structure need not to be of type "Graph") only based on the node connections. I.e., no possible present coordinates are respected.

Definition at line 214 of file Topology.cpp.

void Topology::undirectedGraphDefaultTopology

(

DataStructurePtr

dataStructure

)

applies a default topology for undirected graphs

Use this method to apply a best-fit topology to an undirected graph (though the data structure need not to be of type "Graph") only based on the node connections. I.e., no possible present coordinates are respected.

Definition at line 228 of file Topology.cpp.

---

The documentation for this class was generated from the following files:

• Topology.h
• Topology.cpp