|
Cytoscape 2.8.0 API | |||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object fing.model.FingExtensibleRootGraph
public class FingExtensibleRootGraph
Please try to restrain from using this class. This class was created so that certain legacy applications would have an easier time using this giny.model implementation. Please use FingRootGraphFactory instead of this class.
FingRootGraphFactory
Field Summary |
---|
Fields inherited from interface cytoscape.graph.dynamic.DynamicGraph |
---|
DIRECTED_EDGE, UNDIRECTED_EDGE |
Constructor Summary | |
---|---|
FingExtensibleRootGraph(FingNodeDepot nodeDepot,
FingEdgeDepot edgeDepot)
Creates a new FingExtensibleRootGraph object. |
Method Summary | |
---|---|
boolean |
addEdgeMetaChild(int parentNodeInx,
int childEdgeInx)
DOCUMENT ME! |
boolean |
addMetaChild(Node parent,
Edge child)
DOCUMENT ME! |
boolean |
addMetaChild(Node parent,
Node child)
DOCUMENT ME! |
boolean |
addNodeMetaChild(int parentNodeInx,
int childNodeInx)
DOCUMENT ME! |
boolean |
containsEdge(Edge edge)
DOCUMENT ME! |
boolean |
containsNode(Node node)
DOCUMENT ME! |
int |
createEdge(int sourceNodeIndex,
int targetNodeIndex)
DOCUMENT ME! |
int |
createEdge(int sourceNodeIndex,
int targetNodeIndex,
boolean directed)
DOCUMENT ME! |
int |
createEdge(Node source,
Node target)
DOCUMENT ME! |
int |
createEdge(Node source,
Node target,
boolean directed)
DOCUMENT ME! |
int[] |
createEdges(int[] sourceNodeIndices,
int[] targetNodeIndices,
boolean directed)
DOCUMENT ME! |
GraphPerspective |
createGraphPerspective(int[] nodeInx,
int[] edgeInx)
DOCUMENT ME! |
GraphPerspective |
createGraphPerspective(Node[] nodes,
Edge[] edges)
DOCUMENT ME! |
int |
createNode()
DOCUMENT ME! |
int |
createNode(GraphPerspective perspective)
DOCUMENT ME! |
int |
createNode(int[] nodeIndices,
int[] edgeIndices)
DOCUMENT ME! |
int |
createNode(Node[] nodes,
Edge[] edges)
DOCUMENT ME! |
int[] |
createNodes(int numNewNodes)
DOCUMENT ME! |
int |
edgeCreate(int sourceNode,
int targetNode,
boolean directed)
DOCUMENT ME! |
boolean |
edgeExists(int fromNodeInx,
int toNodeInx)
DOCUMENT ME! |
boolean |
edgeExists(Node from,
Node to)
DOCUMENT ME! |
List |
edgeMetaChildrenList(int parentNodeInx)
DOCUMENT ME! |
List |
edgeMetaChildrenList(Node node)
DOCUMENT ME! |
List |
edgeMetaParentsList(int edgeInx)
DOCUMENT ME! |
boolean |
edgeRemove(int edge)
DOCUMENT ME! |
IntEnumerator |
edges()
DOCUMENT ME! |
IntEnumerator |
edgesAdjacent(int node,
boolean outgoing,
boolean incoming,
boolean undirected)
DOCUMENT ME! |
IntIterator |
edgesConnecting(int node0,
int node1,
boolean outgoing,
boolean incoming,
boolean undirected)
DOCUMENT ME! |
Iterator |
edgesIterator()
DOCUMENT ME! |
List |
edgesList()
DOCUMENT ME! |
List |
edgesList(int fromNodeInx,
int toNodeInx,
boolean includeUndirectedEdges)
DOCUMENT ME! |
List |
edgesList(Node from,
Node to)
DOCUMENT ME! |
int |
edgeSource(int edge)
DOCUMENT ME! |
int |
edgeTarget(int edge)
DOCUMENT ME! |
byte |
edgeType(int edge)
DOCUMENT ME! |
void |
ensureCapacity(int nodes,
int edges)
DOCUMENT ME! |
int[] |
getAdjacentEdgeIndicesArray(int nodeInx,
boolean undirected,
boolean incomingDirected,
boolean outgoingDirected)
DOCUMENT ME! |
int[] |
getChildlessMetaDescendants(int nodeInx)
DOCUMENT ME! |
int[] |
getConnectingEdgeIndicesArray(int[] nodeInx)
DOCUMENT ME! |
int[] |
getConnectingNodeIndicesArray(int[] edgeInx)
DOCUMENT ME! |
int |
getDegree(int nodeInx)
DOCUMENT ME! |
int |
getDegree(Node node)
DOCUMENT ME! |
Edge |
getEdge(int edgeInx)
DOCUMENT ME! |
int |
getEdgeCount()
DOCUMENT ME! |
int |
getEdgeCount(int fromNodeInx,
int toNodeInx,
boolean countUndirectedEdges)
DOCUMENT ME! |
int |
getEdgeCount(Node from,
Node to,
boolean countUndirectedEdges)
DOCUMENT ME! |
int[] |
getEdgeIndicesArray()
DOCUMENT ME! |
int[] |
getEdgeIndicesArray(int fromNodeInx,
int toNodeInx,
boolean includeUndirectedEdges)
DOCUMENT ME! |
int[] |
getEdgeIndicesArray(int fromNodeInx,
int toNodeInx,
boolean undirectedEdges,
boolean bothDirections)
DOCUMENT ME! |
int[] |
getEdgeMetaChildIndicesArray(int parentNodeInx)
DOCUMENT ME! |
int[] |
getEdgeMetaParentIndicesArray(int edgeInx)
DOCUMENT ME! |
int |
getEdgeSourceIndex(int edgeInx)
DOCUMENT ME! |
int |
getEdgeTargetIndex(int edgeInx)
DOCUMENT ME! |
int |
getInDegree(int nodeInx)
DOCUMENT ME! |
int |
getInDegree(int nodeInx,
boolean countUndirectedEdges)
DOCUMENT ME! |
int |
getInDegree(Node node)
DOCUMENT ME! |
int |
getInDegree(Node node,
boolean countUndirectedEdges)
DOCUMENT ME! |
int |
getIndex(Edge edge)
DOCUMENT ME! |
int |
getIndex(Node node)
DOCUMENT ME! |
Node |
getNode(int nodeInx)
DOCUMENT ME! |
int |
getNodeCount()
DOCUMENT ME! |
int[] |
getNodeIndicesArray()
DOCUMENT ME! |
int[] |
getNodeMetaChildIndicesArray(int parentNodeInx)
DOCUMENT ME! |
int[] |
getNodeMetaChildIndicesArray(int parentNodeInx,
boolean recursive)
DOCUMENT ME! |
int[] |
getNodeMetaParentIndicesArray(int nodeInx)
DOCUMENT ME! |
int |
getOutDegree(int nodeInx)
DOCUMENT ME! |
int |
getOutDegree(int nodeInx,
boolean countUndirectedEdges)
DOCUMENT ME! |
int |
getOutDegree(Node node)
DOCUMENT ME! |
int |
getOutDegree(Node node,
boolean countUndirectedEdges)
DOCUMENT ME! |
boolean |
isEdgeDirected(int edgeInx)
DOCUMENT ME! |
boolean |
isEdgeMetaChild(int parentNodeInx,
int childEdgeInx)
DOCUMENT ME! |
boolean |
isEdgeMetaParent(int childEdgeInx,
int parentNodeInx)
DOCUMENT ME! |
boolean |
isMetaChild(Node parent,
Edge child)
DOCUMENT ME! |
boolean |
isMetaChild(Node parent,
Node child)
DOCUMENT ME! |
boolean |
isMetaParent(Edge child,
Node parent)
DOCUMENT ME! |
boolean |
isMetaParent(Node child,
Node parent)
DOCUMENT ME! |
boolean |
isNeighbor(int nodeInxA,
int nodeInxB)
DOCUMENT ME! |
boolean |
isNeighbor(Node a,
Node b)
DOCUMENT ME! |
boolean |
isNodeMetaChild(int parentNodeInx,
int childNodeInx)
DOCUMENT ME! |
boolean |
isNodeMetaChild(int parentNodeInx,
int childNodeInx,
boolean recursive)
DOCUMENT ME! |
boolean |
isNodeMetaParent(int childNodeInx,
int parentNodeInx)
DOCUMENT ME! |
List |
metaParentsList(Edge edge)
DOCUMENT ME! |
List |
metaParentsList(Node node)
DOCUMENT ME! |
List |
neighborsList(Node node)
DOCUMENT ME! |
int |
nodeCreate()
DOCUMENT ME! |
boolean |
nodeExists(int node)
DOCUMENT ME! |
List |
nodeMetaChildrenList(int parentNodeInx)
DOCUMENT ME! |
List |
nodeMetaChildrenList(Node node)
DOCUMENT ME! |
List |
nodeMetaParentsList(int nodeInx)
DOCUMENT ME! |
boolean |
nodeRemove(int node)
DOCUMENT ME! |
IntEnumerator |
nodes()
DOCUMENT ME! |
Iterator |
nodesIterator()
DOCUMENT ME! |
List |
nodesList()
DOCUMENT ME! |
Edge |
removeEdge(Edge edge)
DOCUMENT ME! |
int |
removeEdge(int edgeInx)
DOCUMENT ME! |
boolean |
removeEdgeMetaChild(int parentNodeInx,
int childEdgeInx)
DOCUMENT ME! |
int[] |
removeEdges(int[] edgeIndices)
DOCUMENT ME! |
List |
removeEdges(List edges)
DOCUMENT ME! |
int |
removeNode(int nodeInx)
DOCUMENT ME! |
Node |
removeNode(Node node)
DOCUMENT ME! |
boolean |
removeNodeMetaChild(int parentNodeInx,
int childNodeInx)
DOCUMENT ME! |
int[] |
removeNodes(int[] nodeIndices)
DOCUMENT ME! |
List |
removeNodes(List nodes)
DOCUMENT ME! |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public FingExtensibleRootGraph(FingNodeDepot nodeDepot, FingEdgeDepot edgeDepot)
nodeDepot
- DOCUMENT ME!edgeDepot
- DOCUMENT ME!Method Detail |
---|
public IntEnumerator nodes()
nodes
in interface DynamicGraph
nodes
in interface FixedGraph
public IntEnumerator edges()
edges
in interface DynamicGraph
edges
in interface FixedGraph
public int nodeCreate()
nodeCreate
in interface DynamicGraph
public boolean nodeRemove(int node)
nodeRemove
in interface DynamicGraph
node
- DOCUMENT ME!
public int edgeCreate(int sourceNode, int targetNode, boolean directed)
edgeCreate
in interface DynamicGraph
sourceNode
- DOCUMENT ME!targetNode
- DOCUMENT ME!directed
- DOCUMENT ME!
public boolean edgeRemove(int edge)
edgeRemove
in interface DynamicGraph
edge
- DOCUMENT ME!
public boolean nodeExists(int node)
nodeExists
in interface DynamicGraph
nodeExists
in interface FixedGraph
node
- DOCUMENT ME!
public byte edgeType(int edge)
edgeType
in interface DynamicGraph
edgeType
in interface FixedGraph
edge
- DOCUMENT ME!
public int edgeSource(int edge)
edgeSource
in interface DynamicGraph
edgeSource
in interface FixedGraph
edge
- DOCUMENT ME!
public int edgeTarget(int edge)
edgeTarget
in interface DynamicGraph
edgeTarget
in interface FixedGraph
edge
- DOCUMENT ME!
public IntEnumerator edgesAdjacent(int node, boolean outgoing, boolean incoming, boolean undirected)
edgesAdjacent
in interface DynamicGraph
edgesAdjacent
in interface FixedGraph
node
- DOCUMENT ME!outgoing
- DOCUMENT ME!incoming
- DOCUMENT ME!undirected
- DOCUMENT ME!
public IntIterator edgesConnecting(int node0, int node1, boolean outgoing, boolean incoming, boolean undirected)
edgesConnecting
in interface DynamicGraph
edgesConnecting
in interface FixedGraph
node0
- DOCUMENT ME!node1
- DOCUMENT ME!outgoing
- DOCUMENT ME!incoming
- DOCUMENT ME!undirected
- DOCUMENT ME!
public GraphPerspective createGraphPerspective(Node[] nodes, Edge[] edges)
createGraphPerspective
in interface RootGraph
nodes
- DOCUMENT ME!edges
- DOCUMENT ME!
public GraphPerspective createGraphPerspective(int[] nodeInx, int[] edgeInx)
createGraphPerspective
in interface RootGraph
nodeInx
- DOCUMENT ME!edgeInx
- DOCUMENT ME!
public void ensureCapacity(int nodes, int edges)
ensureCapacity
in interface RootGraph
nodes
- DOCUMENT ME!edges
- DOCUMENT ME!public int getNodeCount()
getNodeCount
in interface RootGraph
public int getEdgeCount()
getEdgeCount
in interface RootGraph
public Iterator nodesIterator()
nodesIterator
in interface RootGraph
public List nodesList()
nodesList
in interface RootGraph
RootGraph.nodesIterator()
public int[] getNodeIndicesArray()
getNodeIndicesArray
in interface RootGraph
RootGraph.nodesIterator()
,
GraphObject.getRootGraphIndex()
public Iterator edgesIterator()
edgesIterator
in interface RootGraph
public List edgesList()
edgesList
in interface RootGraph
RootGraph.edgesIterator()
public int[] getEdgeIndicesArray()
getEdgeIndicesArray
in interface RootGraph
RootGraph.edgesIterator()
,
GraphObject.getRootGraphIndex()
public Node removeNode(Node node)
removeNode
in interface RootGraph
node
- DOCUMENT ME!
public int removeNode(int nodeInx)
removeNode
in interface RootGraph
nodeInx
- DOCUMENT ME!
public List removeNodes(List nodes)
removeNodes
in interface RootGraph
nodes
- DOCUMENT ME!
RootGraph.removeNode(Node)
,
RootGraph.removeNodes(int[])
public int[] removeNodes(int[] nodeIndices)
removeNodes
in interface RootGraph
nodeIndices
- DOCUMENT ME!
RootGraph.removeNode(int)
public int createNode()
createNode
in interface RootGraph
public int createNode(Node[] nodes, Edge[] edges)
createNode
in interface RootGraph
nodes
- DOCUMENT ME!edges
- DOCUMENT ME!
public int createNode(GraphPerspective perspective)
createNode
in interface RootGraph
perspective
- DOCUMENT ME!
public int createNode(int[] nodeIndices, int[] edgeIndices)
createNode
in interface RootGraph
nodeIndices
- DOCUMENT ME!edgeIndices
- DOCUMENT ME!
public int[] createNodes(int numNewNodes)
createNodes
in interface RootGraph
numNewNodes
- DOCUMENT ME!
RootGraph.createNode()
public Edge removeEdge(Edge edge)
removeEdge
in interface RootGraph
edge
- DOCUMENT ME!
public int removeEdge(int edgeInx)
removeEdge
in interface RootGraph
edgeInx
- DOCUMENT ME!
public List removeEdges(List edges)
removeEdges
in interface RootGraph
edges
- DOCUMENT ME!
RootGraph.removeEdge(Edge)
,
RootGraph.removeEdges(int[])
public int[] removeEdges(int[] edgeIndices)
removeEdges
in interface RootGraph
edgeIndices
- DOCUMENT ME!
RootGraph.removeEdge(int)
public int createEdge(Node source, Node target)
createEdge
in interface RootGraph
source
- DOCUMENT ME!target
- DOCUMENT ME!
public int createEdge(Node source, Node target, boolean directed)
createEdge
in interface RootGraph
source
- DOCUMENT ME!target
- DOCUMENT ME!directed
- DOCUMENT ME!
public int createEdge(int sourceNodeIndex, int targetNodeIndex)
createEdge
in interface RootGraph
sourceNodeIndex
- DOCUMENT ME!targetNodeIndex
- DOCUMENT ME!
public int createEdge(int sourceNodeIndex, int targetNodeIndex, boolean directed)
createEdge
in interface RootGraph
sourceNodeIndex
- DOCUMENT ME!targetNodeIndex
- DOCUMENT ME!directed
- DOCUMENT ME!
public int[] createEdges(int[] sourceNodeIndices, int[] targetNodeIndices, boolean directed)
createEdges
in interface RootGraph
sourceNodeIndices
- DOCUMENT ME!targetNodeIndices
- DOCUMENT ME!directed
- DOCUMENT ME!
RootGraph.createEdge(int, int, boolean)
public boolean containsNode(Node node)
containsNode
in interface RootGraph
node
- DOCUMENT ME!
public boolean containsEdge(Edge edge)
containsEdge
in interface RootGraph
edge
- DOCUMENT ME!
public List neighborsList(Node node)
neighborsList
in interface RootGraph
node
- DOCUMENT ME!
RootGraph.getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean)
public boolean isNeighbor(Node a, Node b)
isNeighbor
in interface RootGraph
a
- DOCUMENT ME!b
- DOCUMENT ME!
RootGraph.getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean)
public boolean isNeighbor(int nodeInxA, int nodeInxB)
isNeighbor
in interface RootGraph
nodeInxA
- DOCUMENT ME!nodeInxB
- DOCUMENT ME!
RootGraph.getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean)
public boolean edgeExists(Node from, Node to)
edgeExists
in interface RootGraph
from
- DOCUMENT ME!to
- DOCUMENT ME!
RootGraph.getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean)
public boolean edgeExists(int fromNodeInx, int toNodeInx)
edgeExists
in interface RootGraph
fromNodeInx
- DOCUMENT ME!toNodeInx
- DOCUMENT ME!
RootGraph.getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean)
public int getEdgeCount(Node from, Node to, boolean countUndirectedEdges)
getEdgeCount
in interface RootGraph
from
- DOCUMENT ME!to
- DOCUMENT ME!countUndirectedEdges
- DOCUMENT ME!
RootGraph.getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean)
public int getEdgeCount(int fromNodeInx, int toNodeInx, boolean countUndirectedEdges)
getEdgeCount
in interface RootGraph
fromNodeInx
- DOCUMENT ME!toNodeInx
- DOCUMENT ME!countUndirectedEdges
- DOCUMENT ME!
RootGraph.getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean)
public int[] getAdjacentEdgeIndicesArray(int nodeInx, boolean undirected, boolean incomingDirected, boolean outgoingDirected)
getAdjacentEdgeIndicesArray
in interface RootGraph
nodeInx
- DOCUMENT ME!undirected
- DOCUMENT ME!incomingDirected
- DOCUMENT ME!outgoingDirected
- DOCUMENT ME!
public int[] getConnectingEdgeIndicesArray(int[] nodeInx)
getConnectingEdgeIndicesArray
in interface RootGraph
nodeInx
- DOCUMENT ME!
public int[] getConnectingNodeIndicesArray(int[] edgeInx)
getConnectingNodeIndicesArray
in interface RootGraph
edgeInx
- DOCUMENT ME!
RootGraph.getEdgeSourceIndex(int)
,
RootGraph.getEdgeTargetIndex(int)
,
RootGraph.createGraphPerspective(int[], int[])
public int[] getEdgeIndicesArray(int fromNodeInx, int toNodeInx, boolean undirectedEdges, boolean bothDirections)
getEdgeIndicesArray
in interface RootGraph
fromNodeInx
- DOCUMENT ME!toNodeInx
- DOCUMENT ME!undirectedEdges
- DOCUMENT ME!bothDirections
- DOCUMENT ME!
RootGraph.getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean)
public List edgesList(Node from, Node to)
edgesList
in interface RootGraph
from
- DOCUMENT ME!to
- DOCUMENT ME!
RootGraph.getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean)
public List edgesList(int fromNodeInx, int toNodeInx, boolean includeUndirectedEdges)
edgesList
in interface RootGraph
fromNodeInx
- DOCUMENT ME!toNodeInx
- DOCUMENT ME!includeUndirectedEdges
- DOCUMENT ME!
RootGraph.getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean)
public int[] getEdgeIndicesArray(int fromNodeInx, int toNodeInx, boolean includeUndirectedEdges)
getEdgeIndicesArray
in interface RootGraph
fromNodeInx
- DOCUMENT ME!toNodeInx
- DOCUMENT ME!includeUndirectedEdges
- DOCUMENT ME!
RootGraph.getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean)
public int getInDegree(Node node)
getInDegree
in interface RootGraph
node
- DOCUMENT ME!
public int getInDegree(int nodeInx)
getInDegree
in interface RootGraph
nodeInx
- DOCUMENT ME!
public int getInDegree(Node node, boolean countUndirectedEdges)
getInDegree
in interface RootGraph
node
- DOCUMENT ME!countUndirectedEdges
- DOCUMENT ME!
public int getInDegree(int nodeInx, boolean countUndirectedEdges)
getInDegree
in interface RootGraph
nodeInx
- DOCUMENT ME!countUndirectedEdges
- DOCUMENT ME!
public int getOutDegree(Node node)
getOutDegree
in interface RootGraph
node
- DOCUMENT ME!
public int getOutDegree(int nodeInx)
getOutDegree
in interface RootGraph
nodeInx
- DOCUMENT ME!
public int getOutDegree(Node node, boolean countUndirectedEdges)
getOutDegree
in interface RootGraph
node
- DOCUMENT ME!countUndirectedEdges
- DOCUMENT ME!
public int getOutDegree(int nodeInx, boolean countUndirectedEdges)
getOutDegree
in interface RootGraph
nodeInx
- DOCUMENT ME!countUndirectedEdges
- DOCUMENT ME!
public int getDegree(Node node)
getDegree
in interface RootGraph
node
- DOCUMENT ME!
public int getDegree(int nodeInx)
getDegree
in interface RootGraph
nodeInx
- DOCUMENT ME!
public int getIndex(Node node)
getIndex
in interface RootGraph
node
- DOCUMENT ME!
public Node getNode(int nodeInx)
getNode
in interface RootGraph
nodeInx
- DOCUMENT ME!
public int getIndex(Edge edge)
getIndex
in interface RootGraph
edge
- DOCUMENT ME!
public Edge getEdge(int edgeInx)
getEdge
in interface RootGraph
edgeInx
- DOCUMENT ME!
public int getEdgeSourceIndex(int edgeInx)
getEdgeSourceIndex
in interface RootGraph
edgeInx
- DOCUMENT ME!
public int getEdgeTargetIndex(int edgeInx)
getEdgeTargetIndex
in interface RootGraph
edgeInx
- DOCUMENT ME!
public boolean isEdgeDirected(int edgeInx)
isEdgeDirected
in interface RootGraph
edgeInx
- DOCUMENT ME!
public boolean addMetaChild(Node parent, Node child)
addMetaChild
in interface RootGraph
parent
- DOCUMENT ME!child
- DOCUMENT ME!
public boolean addNodeMetaChild(int parentNodeInx, int childNodeInx)
addNodeMetaChild
in interface RootGraph
parentNodeInx
- DOCUMENT ME!childNodeInx
- DOCUMENT ME!
public boolean removeNodeMetaChild(int parentNodeInx, int childNodeInx)
removeNodeMetaChild
in interface RootGraph
parentNodeInx
- DOCUMENT ME!childNodeInx
- DOCUMENT ME!
public boolean isMetaParent(Node child, Node parent)
isMetaParent
in interface RootGraph
child
- DOCUMENT ME!parent
- DOCUMENT ME!
public boolean isNodeMetaParent(int childNodeInx, int parentNodeInx)
isNodeMetaParent
in interface RootGraph
childNodeInx
- DOCUMENT ME!parentNodeInx
- DOCUMENT ME!
public List metaParentsList(Node node)
metaParentsList
in interface RootGraph
node
- DOCUMENT ME!
RootGraph.getNodeMetaParentIndicesArray(int)
public List nodeMetaParentsList(int nodeInx)
nodeMetaParentsList
in interface RootGraph
nodeInx
- DOCUMENT ME!
RootGraph.getNodeMetaParentIndicesArray(int)
public int[] getNodeMetaParentIndicesArray(int nodeInx)
getNodeMetaParentIndicesArray
in interface RootGraph
nodeInx
- DOCUMENT ME!
public boolean isMetaChild(Node parent, Node child)
isMetaChild
in interface RootGraph
parent
- DOCUMENT ME!child
- DOCUMENT ME!
public boolean isNodeMetaChild(int parentNodeInx, int childNodeInx)
isNodeMetaChild
in interface RootGraph
parentNodeInx
- DOCUMENT ME!childNodeInx
- DOCUMENT ME!
public boolean isNodeMetaChild(int parentNodeInx, int childNodeInx, boolean recursive)
isNodeMetaChild
in interface RootGraph
parentNodeInx
- DOCUMENT ME!childNodeInx
- DOCUMENT ME!recursive
- DOCUMENT ME!
public List nodeMetaChildrenList(Node node)
nodeMetaChildrenList
in interface RootGraph
node
- DOCUMENT ME!
RootGraph.getNodeMetaChildIndicesArray(int)
public List nodeMetaChildrenList(int parentNodeInx)
nodeMetaChildrenList
in interface RootGraph
parentNodeInx
- DOCUMENT ME!
public int[] getNodeMetaChildIndicesArray(int parentNodeInx)
getNodeMetaChildIndicesArray
in interface RootGraph
parentNodeInx
- DOCUMENT ME!
public int[] getNodeMetaChildIndicesArray(int parentNodeInx, boolean recursive)
getNodeMetaChildIndicesArray
in interface RootGraph
parentNodeInx
- DOCUMENT ME!recursive
- DOCUMENT ME!
public int[] getChildlessMetaDescendants(int nodeInx)
getChildlessMetaDescendants
in interface RootGraph
nodeInx
- DOCUMENT ME!
public boolean addMetaChild(Node parent, Edge child)
addMetaChild
in interface RootGraph
parent
- DOCUMENT ME!child
- DOCUMENT ME!
public boolean addEdgeMetaChild(int parentNodeInx, int childEdgeInx)
addEdgeMetaChild
in interface RootGraph
parentNodeInx
- DOCUMENT ME!childEdgeInx
- DOCUMENT ME!
public boolean removeEdgeMetaChild(int parentNodeInx, int childEdgeInx)
removeEdgeMetaChild
in interface RootGraph
parentNodeInx
- DOCUMENT ME!childEdgeInx
- DOCUMENT ME!
public boolean isMetaParent(Edge child, Node parent)
isMetaParent
in interface RootGraph
child
- DOCUMENT ME!parent
- DOCUMENT ME!
public boolean isEdgeMetaParent(int childEdgeInx, int parentNodeInx)
isEdgeMetaParent
in interface RootGraph
childEdgeInx
- DOCUMENT ME!parentNodeInx
- DOCUMENT ME!
public List metaParentsList(Edge edge)
metaParentsList
in interface RootGraph
edge
- DOCUMENT ME!
RootGraph.getEdgeMetaParentIndicesArray(int)
public List edgeMetaParentsList(int edgeInx)
edgeMetaParentsList
in interface RootGraph
edgeInx
- DOCUMENT ME!
RootGraph.getEdgeMetaParentIndicesArray(int)
public int[] getEdgeMetaParentIndicesArray(int edgeInx)
getEdgeMetaParentIndicesArray
in interface RootGraph
edgeInx
- DOCUMENT ME!
public boolean isMetaChild(Node parent, Edge child)
isMetaChild
in interface RootGraph
parent
- DOCUMENT ME!child
- DOCUMENT ME!
public boolean isEdgeMetaChild(int parentNodeInx, int childEdgeInx)
isEdgeMetaChild
in interface RootGraph
parentNodeInx
- DOCUMENT ME!childEdgeInx
- DOCUMENT ME!
public List edgeMetaChildrenList(Node node)
edgeMetaChildrenList
in interface RootGraph
node
- DOCUMENT ME!
RootGraph.getEdgeMetaChildIndicesArray(int)
public List edgeMetaChildrenList(int parentNodeInx)
edgeMetaChildrenList
in interface RootGraph
parentNodeInx
- DOCUMENT ME!
RootGraph.getEdgeMetaChildIndicesArray(int)
public int[] getEdgeMetaChildIndicesArray(int parentNodeInx)
getEdgeMetaChildIndicesArray
in interface RootGraph
parentNodeInx
- DOCUMENT ME!
|
Cytoscape 2.8.0 API | |||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |