|
Gephi Toolkit Javadoc | ||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface HierarchicalDirectedGraph
Hierarchical directed graph.
GraphModel
Method Summary | |
---|---|
MetaEdge |
getMetaEdge(Node source,
Node target)
Finds and returns a meta-edge that connects source and
target . |
int |
getMetaInDegree(Node node)
Returns the number of node 's incoming meta edges. |
EdgeIterable |
getMetaInEdges(Node node)
Returns incoming meta edges incident to node . |
int |
getMetaOutDegree(Node node)
Returns the number of node 's outgoing meta edges. |
EdgeIterable |
getMetaOutEdges(Node node)
Returns outgoing meta edges incident to node . |
Methods inherited from interface org.gephi.graph.api.HierarchicalGraph |
---|
addNode, clearMetaEdges, expand, flatten, getChildren, getChildrenCount, getDescendant, getDescendantCount, getEdgesAndMetaEdges, getEdgesTree, getHeight, getHierarchyEdges, getInnerEdges, getLevel, getLevelSize, getMetaDegree, getMetaEdges, getMetaEdges, getNodes, getNodesTree, getOuterEdges, getParent, getTopNodes, groupNodes, isAncestor, isDescendant, isFollowing, isInView, isParent, isPreceding, moveToGroup, removeFromGroup, resetViewToLeaves, resetViewToLevel, resetViewToTopNodes, retract, ungroupNodes, wrapToTreeNode |
Methods inherited from interface org.gephi.graph.api.DirectedGraph |
---|
addEdge, getEdge, getInDegree, getInEdges, getMutualDegree, getOutDegree, getOutEdges, getPredecessors, getSuccessors, isPredecessor, isSuccessor |
Methods inherited from interface org.gephi.graph.api.Graph |
---|
addEdge, addNode, clear, clearEdges, clearEdges, contains, contains, getDegree, getEdge, getEdge, getEdgeCount, getEdges, getEdges, getEdgeVersion, getGraphModel, getNeighbors, getNode, getNode, getNodeCount, getNodes, getNodeVersion, getOpposite, getView, isAdjacent, isAdjacent, isDirected, isSelfLoop, readLock, readUnlock, readUnlockAll, removeEdge, removeNode, setId, setId, writeLock, writeUnlock |
Method Detail |
---|
EdgeIterable getMetaInEdges(Node node)
node
.
node
- the node whose incoming meta edges are to be returned
node
's incoming meta edges
java.lang.IllegalArgumentException
- if node
is null
or not legal in
the graphEdgeIterable getMetaOutEdges(Node node)
node
.
node
- the node whose outgoing meta edges are to be returned
node
's outgoing meta edges
java.lang.IllegalArgumentException
- if node
is null
or not legal in
the graphint getMetaInDegree(Node node)
node
's incoming meta edges.
Warning: This method is not thread safe, be sure to call it in a locked statement.
node
- the node whose meta in-degree is queried
node
java.lang.IllegalArgumentException
- if node
is null
or not legal in
the graph.int getMetaOutDegree(Node node)
node
's outgoing meta edges.
Warning: This method is not thread safe, be sure to call it in a locked statement.
node
- the node whose meta out-degree is queried
node
java.lang.IllegalArgumentException
- if node
is null
or not legal in
the graph.MetaEdge getMetaEdge(Node source, Node target)
source
and
target
. Returns null
if no such meta-edge is found.
Warning: This method is not thread safe, be sure to call it in a locked statement.
getMetaEdge
in interface HierarchicalGraph
source
- the first incident node of the queried edgetarget
- thge second incident node of the queried edge
source
and target
or null
if no such edge exists
java.lang.IllegalArgumentException
- if source
or target
are null
or not legal nodes in the graph
|
Gephi Toolkit Javadoc | ||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |