Module imp2d

Package de.grogra.imp2d.layout

Class HierarchyLayout.HAlgorithm

java.lang.Object

de.grogra.imp2d.layout.Layout.Algorithm

de.grogra.imp2d.layout.HierarchyLayout.HAlgorithm

Enclosing class:

HierarchyLayout

public class HierarchyLayout.HAlgorithm
extends Layout.Algorithm

Field Summary

Fields inherited from class de.grogra.imp2d.layout.Layout.Algorithm

finalGraph, graph, state, view

Constructor Summary

Constructors

Constructor	Description
HAlgorithm()

Method Summary

Modifier and Type	Method	Description
void	disassociateNodes()	Dividing the nodes of the graph into connectedNodes (= nodes that have edges to other nodes) and unconnectedNodes (= nodes that don't have edges to other nodes of the graph)
protected void	layout(Node nodes)	This method has to be implemented to perform the layout.

Methods inherited from class de.grogra.imp2d.layout.Layout.Algorithm

acceptNode, fitLayoutToWindow, getCommandName, getGlobalMaxBounds, getGlobalMaxCoordinates, getGlobalMaxCoordinates, getGlobalMaxDistances, invokeLayout, setProgress

Methods inherited from class java.lang.Object

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

Constructor Details

HAlgorithm

public HAlgorithm()

Method Details

layout

protected void layout(Node nodes)

Description copied from class: Layout.Algorithm

This method has to be implemented to perform the layout.

Specified by:

layout in class Layout.Algorithm

Parameters:

nodes - the first node of the linked list of all nodes

See Also:

• Node

disassociateNodes

public void disassociateNodes()

Dividing the nodes of the graph into connectedNodes (= nodes that have edges to other nodes) and unconnectedNodes (= nodes that don't have edges to other nodes of the graph)