com.hp.hpl.guess.layout
Class Radial
java.lang.Object
edu.uci.ics.jung.visualization.AbstractLayout
com.hp.hpl.guess.layout.Radial
- All Implemented Interfaces:
- ChangeEventSupport, Layout, VertexLocationFunction
- public class Radial
- extends AbstractLayout
The layout computePositions method follows the algorithm
as given by Eades in his paper "Drawing Free Trees",
Bulletin of the Institute for Combinatorics and its Applications,
vol. 5, 10-36, 1992.
Note: as described by Eades, the algorithm does not allow variable
node size.
- Author:
- Hacked by Eytan Adar for Guess
|
Field Summary |
boolean |
done
|
| Methods inherited from class edu.uci.ics.jung.visualization.AbstractLayout |
addChangeListener, applyFilter, dontMove, fireStateChanged, forceMove, getBaseKey, getChangeListeners, getCoordinates, getCurrentSize, getEdge, getEdge, getGraph, getLocation, getStatus, getVertex, getVertex, getVertexIterator, getVisibleEdges, getVisibleVertices, initialize, initialize, lockVertex, removeChangeListener, resize, restart, unlockVertex |
done
public boolean done
Radial
public Radial(Graph tree,
Node center,
HashSet ve)
- Constructor
Radial
public Radial(Graph tree,
Node center)
getNextLayerEdgesPredef
public Vector getNextLayerEdgesPredef(Node center)
getNextLayer
public Vector getNextLayer(Node center)
advancePositions
public void advancePositions()
getX
public double getX(Vertex n)
getY
public double getY(Vertex n)
getCoordinates
public Coordinates getCoordinates(Node v)
incrementsAreDone
public boolean incrementsAreDone()
initialize_local_vertex
public void initialize_local_vertex(Vertex v)
initialize_local
public void initialize_local()
isIncremental
public boolean isIncremental()