com.jgraph.layout.hierarchical.model

Class JGraphAbstractHierarchyCell

public abstract class JGraphAbstractHierarchyCell extends Object

An abstraction of an internal hierarchy node or edge

Field Summary
double	height The height of this cell
int	maxRank The maximum rank this cell occupies
int	minRank The minimum rank this cell occupies
protected List[]	nextLayerConnectedCells A cached version of the cells this cell connects to on the next layer up
protected List[]	previousLayerConnectedCells A cached version of the cells this cell connects to on the next layer down
int[]	temp Temporary variable for general use.
double	width The width of this cell
double[]	x The x position of this cell for each layer it occupies
double[]	y The y position of this cell for each layer it occupies

Method Summary
abstract int	getGeneralPurposeVariable(int layer) Gets the value of temp for the specified layer
abstract List	getNextLayerConnectedCells(int layer) Returns the cells this cell connects to on the next layer up
abstract List	getPreviousLayerConnectedCells(int layer) Returns the cells this cell connects to on the next layer down
double	getX(int layer) Gets the value of x on the specified layer
abstract boolean	isEdge()
abstract boolean	isVertex()
abstract void	setGeneralPurposeVariable(int layer, int value) Set the value of temp for the specified layer
void	setX(int layer, double value) Set the value of x for the specified layer
void	setY(int layer, double value) Set the value of y for the specified layer

Field Detail

height

public double height

The height of this cell

maxRank

public int maxRank

The maximum rank this cell occupies

minRank

public int minRank

The minimum rank this cell occupies

nextLayerConnectedCells

protected List[] nextLayerConnectedCells

A cached version of the cells this cell connects to on the next layer up

previousLayerConnectedCells

protected List[] previousLayerConnectedCells

A cached version of the cells this cell connects to on the next layer down

Temporary variable for general use. Generally, try to avoid carrying information between stages. Currently, the longest path layering sets temp to the rank position in fixRanks() and the crossing reduction uses this. This meant temp couldn't be used for hashing the nodes in the model dfs and so hashCode was created