de.bioforscher.singa.javafx.renderer.graphs

Class GraphDrawingTool<NodeType extends Node<NodeType,Vector2D,IdentifierType>,EdgeType extends Edge<NodeType>,IdentifierType,GraphType extends Graph<NodeType,EdgeType,IdentifierType>>

java.lang.Object

de.bioforscher.singa.javafx.renderer.graphs.GraphDrawingTool<NodeType,EdgeType,IdentifierType,GraphType>

public class GraphDrawingTool<NodeType extends Node<NodeType,Vector2D,IdentifierType>,EdgeType extends Edge<NodeType>,IdentifierType,GraphType extends Graph<NodeType,EdgeType,IdentifierType>>
extends Object

This class tries to arrange a graph using force directed placement.
The algorithm is based on Fruchterman, Thomas MJ, and Edward M. Reingold. "Graph drawing by force-directed placement." Softw., Pract. Exper. 21.11 (1991): 1129-1164.
With some modifications.

Author:

cl

Constructor Summary

Constructors

Constructor and Description
GraphDrawingTool(GraphType graph, javafx.beans.property.DoubleProperty drawingWidth, javafx.beans.property.DoubleProperty drawingHeight, int totalIterations) Creates a new GraphDrawingTool.

Method Summary

Modifier and Type	Method and Description
GraphType	arrangeGraph(int i) Calculates one iteration of the optimization process and returns the resulting graph.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

GraphDrawingTool

public GraphDrawingTool(GraphType graph,
                        javafx.beans.property.DoubleProperty drawingWidth,
                        javafx.beans.property.DoubleProperty drawingHeight,
                        int totalIterations)

Creates a new GraphDrawingTool.

Parameters:

totalIterations - Number of total iterations

graph - The graph to arrange

drawingHeight - The height property.

drawingWidth - The width property.

Method Detail

arrangeGraph

public GraphType arrangeGraph(int i)

Calculates one iteration of the optimization process and returns the resulting graph.

Parameters:

i - The current iteration.

Returns:

The resulting graph