public abstract class LayoutStage
extends java.lang.Object
Constructor and Description |
---|
LayoutStage(HierarchicalLayoutContext context) |
Modifier and Type | Method and Description |
---|---|
HierarchicalLayoutContext |
getContext() |
static HierarchicalLayouter.EdgeParams |
getEdgeParams(prefuse.data.Edge e) |
static HierarchicalLayouter.NodeParams |
getNodeParams(prefuse.data.Node n) |
static NodeType |
getNodeType(prefuse.data.Node node) |
static java.util.Iterator<prefuse.data.Node> |
getRealPredecessors(prefuse.data.Node n) |
static java.util.Iterator<prefuse.data.Node> |
getRootNodes(prefuse.data.Graph graph)
Gets the root nodes of a graph.
|
static java.util.Iterator<prefuse.data.Node> |
getRootNodes(prefuse.data.Graph graph,
NodeType nodeType)
Gets the root nodes of a graph.
|
static java.util.Iterator<prefuse.data.Node> |
getSinkNodes(prefuse.data.Graph graph)
Gets the sink nodes of a graph.
|
static java.util.Iterator<prefuse.data.Node> |
getSuccessors(prefuse.data.Node n,
boolean undirected) |
static java.util.Iterator<prefuse.data.Node> |
getSuccessors(prefuse.data.Node n,
boolean undirected,
NodeType nodeType) |
static boolean |
isDummy(prefuse.data.Edge e) |
static boolean |
isDummy(prefuse.data.Node n) |
static boolean |
isReversed(prefuse.data.Edge e) |
static boolean |
isSimplified(prefuse.data.Edge edge) |
static boolean |
isSimplified(prefuse.data.Node node) |
static boolean |
isTransition(prefuse.data.Node node) |
static boolean |
isVisited(prefuse.data.Node n) |
abstract int |
run(prefuse.data.Graph graph) |
void |
setContext(HierarchicalLayoutContext context) |
static void |
setVisitedNode(prefuse.data.Node n,
boolean visited) |
static void |
unvisitNodes(prefuse.data.Graph graph) |
static void |
visitNodes(prefuse.data.Graph graph) |
public LayoutStage(HierarchicalLayoutContext context)
public HierarchicalLayoutContext getContext()
public void setContext(HierarchicalLayoutContext context)
public abstract int run(prefuse.data.Graph graph)
public static HierarchicalLayouter.NodeParams getNodeParams(prefuse.data.Node n)
public static HierarchicalLayouter.EdgeParams getEdgeParams(prefuse.data.Edge e)
public static NodeType getNodeType(prefuse.data.Node node)
public static boolean isDummy(prefuse.data.Edge e)
public static boolean isDummy(prefuse.data.Node n)
public static boolean isReversed(prefuse.data.Edge e)
public static boolean isTransition(prefuse.data.Node node)
public static boolean isSimplified(prefuse.data.Node node)
public static boolean isSimplified(prefuse.data.Edge edge)
public static void unvisitNodes(prefuse.data.Graph graph)
public static void visitNodes(prefuse.data.Graph graph)
public static void setVisitedNode(prefuse.data.Node n, boolean visited)
public static boolean isVisited(prefuse.data.Node n)
public static java.util.Iterator<prefuse.data.Node> getRootNodes(prefuse.data.Graph graph)
graph
- Graph to extract the root nodes from.public static java.util.Iterator<prefuse.data.Node> getRootNodes(prefuse.data.Graph graph, NodeType nodeType)
graph
- Graph to extract the root nodes from.nodeType
- This type will be used to determine which nodes are returned.public static java.util.Iterator<prefuse.data.Node> getSinkNodes(prefuse.data.Graph graph)
graph
- Graph to extract the root nodes from.public static java.util.Iterator<prefuse.data.Node> getSuccessors(prefuse.data.Node n, boolean undirected)
public static java.util.Iterator<prefuse.data.Node> getSuccessors(prefuse.data.Node n, boolean undirected, NodeType nodeType)
public static java.util.Iterator<prefuse.data.Node> getRealPredecessors(prefuse.data.Node n)