java.lang.Object
de.grogra.persistence.ShareableBase
de.grogra.imp2d.layout.Layout
de.grogra.imp2d.layout.HierarchyLayout
- All Implemented Interfaces:
Manageable
,Shareable
A
HierarchyLayout
computes a graph layout based on a
hierarchy model. The concrete hierarchy model has to be implemented
in subclasses (e. g. TreeLayout, SugiyamaLayout)- Author:
- Birka Fonkeng
-
Nested Class Summary
Nested ClassesNested classes/interfaces inherited from class de.grogra.imp2d.layout.Layout
Layout.Algorithm, Layout.Type
-
Field Summary
Fields inherited from class de.grogra.imp2d.layout.Layout
$TYPE, fit$FIELD, transformationSteps$FIELD
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionprotected Layout.Algorithm
Creates an algorithm for this layout.int
Returns the number of nodes of the graphboolean
isEdgeAccessed
(Edge edgeTemp) checks if a edge is marked or unmarkedboolean
isNodeAccessed
(Node nodeTemp) checks if a node is marked or unmarkedvoid
setAllEdgesAccessed
(Node nodeList, boolean value) void
setAllNodesEdgesAccessed
(Node nodeList, boolean value) void
setEdgeAccessed
(Edge edgeTemp, boolean value) Setting a concrete edge marked or unmarkedvoid
setNodeAccessed
(Node nodeTemp, boolean value) Setting a concrete Node marked or unmarkedMethods inherited from class de.grogra.imp2d.layout.Layout
getParam, invoke, setParam, setRedraw, setTransformationSteps
Methods inherited from class de.grogra.persistence.ShareableBase
addReference, appendReferencesTo, fieldModified, getProvider, getStamp, initProvider, manageableReadResolve, manageableWriteReplace, removeReference
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
Methods inherited from interface de.grogra.persistence.Manageable
getManageableType
-
Constructor Details
-
HierarchyLayout
public HierarchyLayout()
-
-
Method Details
-
setAllNodesEdgesAccessed
-
setAllEdgesAccessed
-
getNodeCount
public int getNodeCount()Returns the number of nodes of the graph- Returns:
- nodeCount number of nodes
-
setNodeAccessed
Setting a concrete Node marked or unmarked- Parameters:
node
- Node that has to be markedvalue
-true
if unmarked,false
if marked
-
setEdgeAccessed
Setting a concrete edge marked or unmarked- Parameters:
edge
- Edge that has to be markedvalue
-true
if unmarked,false
if marked
-
isNodeAccessed
checks if a node is marked or unmarked- Parameters:
node
- Node that will be checked- Returns:
true
if unmarked,false
if marked
-
isEdgeAccessed
checks if a edge is marked or unmarked- Parameters:
edge
- Edge that will be checked- Returns:
true
if unmarked,false
if marked
-
createAlgorithm
Description copied from class:Layout
Creates an algorithm for this layout.- Specified by:
createAlgorithm
in classLayout
- Returns:
- a new
Algorithm
instance
-