Package de.saar.chorus.domgraph.layout

Class FragmentLayoutAlgorithm

java.lang.Object

de.saar.chorus.domgraph.layout.LayoutAlgorithm

de.saar.chorus.domgraph.layout.FragmentLayoutAlgorithm

Direct Known Subclasses:

DomGraphChartLayout, DomGraphLayout

public abstract class FragmentLayoutAlgorithm
extends LayoutAlgorithm

Field Summary

Fields

Modifier and Type	Field	Description
protected Canvas	canvas
protected DomGraph	domgraph
protected Map<String,Integer>	fragHeight
protected Set<String>	fragments
protected Map<String,List<String>>	fragmentToHoles
protected Map<String,Integer>	fragOffset
protected Map<String,Integer>	fragWidth
protected Map<String,Integer>	fragXpos
protected Map<String,Integer>	fragYpos
protected NodeLabels	nodelabels
protected Map<String,Shape>	nodesToShape
protected Map<String,Integer>	relXtoParent
protected Map<String,Integer>	relXtoRoot
protected Map<String,Integer>	relYpos

Fields inherited from class de.saar.chorus.domgraph.layout.LayoutAlgorithm

nodeToLabel

Constructor Summary

Constructors

Constructor	Description
FragmentLayoutAlgorithm()

Method Summary

Modifier and Type	Method	Description
void	addRelXtoParent(String node, Integer x)
void	addRelXtoRoot(String node, Integer x)
void	addRelYpos(String node, Integer y)
protected abstract void	computeFragmentPositions()
protected abstract void	computeNodePositions()
protected abstract void	drawEdges()
protected int	getFragDegree(String frag)	Resolving the number of dominance edges adjacent to a fragment.
protected List<String>	getFragHoles(String frag)	Resolving the holes of a fragment in the right order.
protected List<org._3pq.jgrapht.Edge>	getFragInEdges(String frag)	Compute the incoming edges of a fragment.
protected List<org._3pq.jgrapht.Edge>	getFragOutEdges(String frag)	Compute the outgoing edges of a fragment.
Map<String,Shape>	getNodesToShape()
Shape	getNodesToShape(String node)
Integer	getRelXtoParent(String node)
Map<String,Integer>	getRelXtoRoot()
void	initialise(DomGraph graph, NodeLabels labels, Canvas canv)
protected void	layout(DomGraph graph, NodeLabels labels, Canvas canvas)
protected abstract void	placeNodes()
void	putNodeToShape(String node, Shape shape)

Methods inherited from class de.saar.chorus.domgraph.layout.LayoutAlgorithm

layout, removeRedundandEdges

Methods inherited from class java.lang.Object

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

Field Details

relXtoParent

protected Map<String,Integer> relXtoParent

relXtoRoot

protected Map<String,Integer> relXtoRoot

relYpos

protected Map<String,Integer> relYpos

fragWidth

protected Map<String,Integer> fragWidth

fragHeight

protected Map<String,Integer> fragHeight

fragOffset

protected Map<String,Integer> fragOffset

fragYpos

protected Map<String,Integer> fragYpos

fragXpos

protected Map<String,Integer> fragXpos

nodesToShape

protected Map<String,Shape> nodesToShape

fragmentToHoles

protected Map<String,List<String>> fragmentToHoles

fragments

protected Set<String> fragments

domgraph

protected DomGraph domgraph

nodelabels

protected NodeLabels nodelabels

canvas

protected Canvas canvas

Constructor Details

FragmentLayoutAlgorithm

public FragmentLayoutAlgorithm()

Method Details

getFragHoles

protected List<String> getFragHoles(String frag)

Resolving the holes of a fragment in the right order. This does not the same job as getFragLeaves, because leaves that are roots at the same time have to be excluded.

Parameters:

frag - the fragment to get the holes from

Returns:

the list of holes; an empty list if there are none.

getFragInEdges

protected List<org._3pq.jgrapht.Edge> getFragInEdges(String frag)

Compute the incoming edges of a fragment.

Parameters:

frag - the fragment to compute the in-edges for

Returns:

the sorted list of incoming edges.

getFragOutEdges

protected List<org._3pq.jgrapht.Edge> getFragOutEdges(String frag)

Compute the outgoing edges of a fragment.

Parameters:

frag - the fragment to compute the out-edges for

Returns:

the sorted list of outgoing edges.

getFragDegree

protected int getFragDegree(String frag)

Resolving the number of dominance edges adjacent to a fragment.

Parameters:

frag - the fragment to compute the degree for

Returns:

the fragment degree (considering the fragment graph)

getNodesToShape

public Map<String,Shape> getNodesToShape()

Returns:

Returns the nodesToShape.

getRelXtoParent

public Integer getRelXtoParent(String node)

addRelXtoParent

public void addRelXtoParent(String node,
 Integer x)

addRelYpos

public void addRelYpos(String node,
 Integer y)

getNodesToShape

public Shape getNodesToShape(String node)

addRelXtoRoot

public void addRelXtoRoot(String node,
 Integer x)

getRelXtoRoot

public Map<String,Integer> getRelXtoRoot()

Returns:

Returns the relXtoRoot.

putNodeToShape

public void putNodeToShape(String node,
 Shape shape)

initialise

public void initialise(DomGraph graph,
 NodeLabels labels,
 Canvas canv)
                throws LayoutException

Throws:

LayoutException

computeFragmentPositions

protected abstract void computeFragmentPositions()

computeNodePositions

protected abstract void computeNodePositions()

placeNodes

protected abstract void placeNodes()

drawEdges

protected abstract void drawEdges()

layout

protected void layout(DomGraph graph,
 NodeLabels labels,
 Canvas canvas)
               throws LayoutException

Specified by:

layout in class LayoutAlgorithm

Throws:

LayoutException