|
Cytoscape 2.6.2 (c) 2006,2007 ISB, MSKCC, UCSD | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectfing.model.FingExtensibleRootGraph
cytoscape.giny.CytoscapeFingRootGraph
public class CytoscapeFingRootGraph
| Field Summary |
|---|
| Fields inherited from interface cytoscape.graph.dynamic.DynamicGraph |
|---|
DIRECTED_EDGE, UNDIRECTED_EDGE |
| Constructor Summary | |
|---|---|
CytoscapeFingRootGraph()
Creates a new CytoscapeFingRootGraph 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! |
CyNetwork |
createNetwork(Collection nodes,
Collection edges)
DOCUMENT ME! |
CyNetwork |
createNetwork(int[] nodeInx,
int[] edgeInx)
Uses Code copied from ColtRootGraph to create a new Network. |
CyNetwork |
createNetwork(Node[] nodes,
Edge[] edges)
Creates a new Network |
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! |
CyEdge |
getEdge(String identifier)
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! |
CyNode |
getNode(String identifier)
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! |
void |
setEdgeIdentifier(String identifier,
int index)
DOCUMENT ME! |
void |
setNodeIdentifier(String identifier,
int index)
DOCUMENT ME! |
| Methods inherited from class java.lang.Object |
|---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public CytoscapeFingRootGraph()
| Method Detail |
|---|
public CyNetwork createNetwork(Collection nodes,
Collection edges)
createNetwork in interface CytoscapeRootGraphnodes - DOCUMENT ME!edges - DOCUMENT ME!
public CyNetwork createNetwork(Node[] nodes,
Edge[] edges)
createNetwork in interface CytoscapeRootGraph
public CyNetwork createNetwork(int[] nodeInx,
int[] edgeInx)
createNetwork in interface CytoscapeRootGraphpublic CyNode getNode(String identifier)
getNode in interface CytoscapeRootGraphidentifier - DOCUMENT ME!
public CyEdge getEdge(String identifier)
getEdge in interface CytoscapeRootGraphidentifier - DOCUMENT ME!
public void setNodeIdentifier(String identifier,
int index)
setNodeIdentifier in interface CytoscapeRootGraphidentifier - DOCUMENT ME!index - DOCUMENT ME!
public void setEdgeIdentifier(String identifier,
int index)
setEdgeIdentifier in interface CytoscapeRootGraphidentifier - DOCUMENT ME!index - DOCUMENT ME!public IntEnumerator nodes()
nodes in interface cytoscape.graph.dynamic.DynamicGraphnodes in interface cytoscape.graph.fixed.FixedGraphpublic IntEnumerator edges()
edges in interface cytoscape.graph.dynamic.DynamicGraphedges in interface cytoscape.graph.fixed.FixedGraphpublic int nodeCreate()
nodeCreate in interface cytoscape.graph.dynamic.DynamicGraphpublic boolean nodeRemove(int node)
nodeRemove in interface cytoscape.graph.dynamic.DynamicGraphnode - DOCUMENT ME!
public int edgeCreate(int sourceNode,
int targetNode,
boolean directed)
edgeCreate in interface cytoscape.graph.dynamic.DynamicGraphsourceNode - DOCUMENT ME!targetNode - DOCUMENT ME!directed - DOCUMENT ME!
public boolean edgeRemove(int edge)
edgeRemove in interface cytoscape.graph.dynamic.DynamicGraphedge - DOCUMENT ME!
public boolean nodeExists(int node)
nodeExists in interface cytoscape.graph.dynamic.DynamicGraphnodeExists in interface cytoscape.graph.fixed.FixedGraphnode - DOCUMENT ME!
public byte edgeType(int edge)
edgeType in interface cytoscape.graph.dynamic.DynamicGraphedgeType in interface cytoscape.graph.fixed.FixedGraphedge - DOCUMENT ME!
public int edgeSource(int edge)
edgeSource in interface cytoscape.graph.dynamic.DynamicGraphedgeSource in interface cytoscape.graph.fixed.FixedGraphedge - DOCUMENT ME!
public int edgeTarget(int edge)
edgeTarget in interface cytoscape.graph.dynamic.DynamicGraphedgeTarget in interface cytoscape.graph.fixed.FixedGraphedge - DOCUMENT ME!
public IntEnumerator edgesAdjacent(int node,
boolean outgoing,
boolean incoming,
boolean undirected)
edgesAdjacent in interface cytoscape.graph.dynamic.DynamicGraphedgesAdjacent in interface cytoscape.graph.fixed.FixedGraphnode - 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 cytoscape.graph.dynamic.DynamicGraphedgesConnecting in interface cytoscape.graph.fixed.FixedGraphnode0 - DOCUMENT ME!node1 - DOCUMENT ME!outgoing - DOCUMENT ME!incoming - DOCUMENT ME!undirected - DOCUMENT ME!
public GraphPerspective createGraphPerspective(Node[] nodes,
Edge[] edges)
createGraphPerspective in interface RootGraphnodes - DOCUMENT ME!edges - DOCUMENT ME!
public GraphPerspective createGraphPerspective(int[] nodeInx,
int[] edgeInx)
createGraphPerspective in interface RootGraphnodeInx - DOCUMENT ME!edgeInx - DOCUMENT ME!
public void ensureCapacity(int nodes,
int edges)
ensureCapacity in interface RootGraphnodes - DOCUMENT ME!edges - DOCUMENT ME!public int getNodeCount()
getNodeCount in interface RootGraphpublic int getEdgeCount()
getEdgeCount in interface RootGraphpublic Iterator nodesIterator()
nodesIterator in interface RootGraphpublic List nodesList()
nodesList in interface RootGraphRootGraph.nodesIterator()public int[] getNodeIndicesArray()
getNodeIndicesArray in interface RootGraphRootGraph.nodesIterator(),
GraphObject.getRootGraphIndex()public Iterator edgesIterator()
edgesIterator in interface RootGraphpublic List edgesList()
edgesList in interface RootGraphRootGraph.edgesIterator()public int[] getEdgeIndicesArray()
getEdgeIndicesArray in interface RootGraphRootGraph.edgesIterator(),
GraphObject.getRootGraphIndex()public Node removeNode(Node node)
removeNode in interface RootGraphnode - DOCUMENT ME!
public int removeNode(int nodeInx)
removeNode in interface RootGraphnodeInx - DOCUMENT ME!
public List removeNodes(List nodes)
removeNodes in interface RootGraphnodes - DOCUMENT ME!
RootGraph.removeNode(Node),
RootGraph.removeNodes(int[])public int[] removeNodes(int[] nodeIndices)
removeNodes in interface RootGraphnodeIndices - DOCUMENT ME!
RootGraph.removeNode(int)public int createNode()
createNode in interface RootGraph
public int createNode(Node[] nodes,
Edge[] edges)
createNode in interface RootGraphnodes - DOCUMENT ME!edges - DOCUMENT ME!
public int createNode(GraphPerspective perspective)
createNode in interface RootGraphperspective - DOCUMENT ME!
public int createNode(int[] nodeIndices,
int[] edgeIndices)
createNode in interface RootGraphnodeIndices - DOCUMENT ME!edgeIndices - DOCUMENT ME!
public int[] createNodes(int numNewNodes)
createNodes in interface RootGraphnumNewNodes - DOCUMENT ME!
RootGraph.createNode()public Edge removeEdge(Edge edge)
removeEdge in interface RootGraphedge - DOCUMENT ME!
public int removeEdge(int edgeInx)
removeEdge in interface RootGraphedgeInx - DOCUMENT ME!
public List removeEdges(List edges)
removeEdges in interface RootGraphedges - DOCUMENT ME!
RootGraph.removeEdge(Edge),
RootGraph.removeEdges(int[])public int[] removeEdges(int[] edgeIndices)
removeEdges in interface RootGraphedgeIndices - DOCUMENT ME!
RootGraph.removeEdge(int)
public int createEdge(Node source,
Node target)
createEdge in interface RootGraphsource - DOCUMENT ME!target - DOCUMENT ME!
public int createEdge(Node source,
Node target,
boolean directed)
createEdge in interface RootGraphsource - DOCUMENT ME!target - DOCUMENT ME!directed - DOCUMENT ME!
public int createEdge(int sourceNodeIndex,
int targetNodeIndex)
createEdge in interface RootGraphsourceNodeIndex - DOCUMENT ME!targetNodeIndex - DOCUMENT ME!
public int createEdge(int sourceNodeIndex,
int targetNodeIndex,
boolean directed)
createEdge in interface RootGraphsourceNodeIndex - DOCUMENT ME!targetNodeIndex - DOCUMENT ME!directed - DOCUMENT ME!
public int[] createEdges(int[] sourceNodeIndices,
int[] targetNodeIndices,
boolean directed)
createEdges in interface RootGraphsourceNodeIndices - DOCUMENT ME!targetNodeIndices - DOCUMENT ME!directed - DOCUMENT ME!
RootGraph.createEdge(int, int, boolean)public boolean containsNode(Node node)
containsNode in interface RootGraphnode - DOCUMENT ME!
public boolean containsEdge(Edge edge)
containsEdge in interface RootGraphedge - DOCUMENT ME!
public List neighborsList(Node node)
neighborsList in interface RootGraphnode - DOCUMENT ME!
RootGraph.getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean)
public boolean isNeighbor(Node a,
Node b)
isNeighbor in interface RootGrapha - DOCUMENT ME!b - DOCUMENT ME!
RootGraph.getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean)
public boolean isNeighbor(int nodeInxA,
int nodeInxB)
isNeighbor in interface RootGraphnodeInxA - DOCUMENT ME!nodeInxB - DOCUMENT ME!
RootGraph.getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean)
public boolean edgeExists(Node from,
Node to)
edgeExists in interface RootGraphfrom - DOCUMENT ME!to - DOCUMENT ME!
RootGraph.getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean)
public boolean edgeExists(int fromNodeInx,
int toNodeInx)
edgeExists in interface RootGraphfromNodeInx - DOCUMENT ME!toNodeInx - DOCUMENT ME!
RootGraph.getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean)
public int getEdgeCount(Node from,
Node to,
boolean countUndirectedEdges)
getEdgeCount in interface RootGraphfrom - 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 RootGraphfromNodeInx - 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 RootGraphnodeInx - DOCUMENT ME!undirected - DOCUMENT ME!incomingDirected - DOCUMENT ME!outgoingDirected - DOCUMENT ME!
public int[] getConnectingEdgeIndicesArray(int[] nodeInx)
getConnectingEdgeIndicesArray in interface RootGraphnodeInx - DOCUMENT ME!
public int[] getConnectingNodeIndicesArray(int[] edgeInx)
getConnectingNodeIndicesArray in interface RootGraphedgeInx - 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 RootGraphfromNodeInx - 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 RootGraphfrom - DOCUMENT ME!to - DOCUMENT ME!
RootGraph.getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean)
public List edgesList(int fromNodeInx,
int toNodeInx,
boolean includeUndirectedEdges)
edgesList in interface RootGraphfromNodeInx - 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 RootGraphfromNodeInx - DOCUMENT ME!toNodeInx - DOCUMENT ME!includeUndirectedEdges - DOCUMENT ME!
RootGraph.getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean)public int getInDegree(Node node)
getInDegree in interface RootGraphnode - DOCUMENT ME!
public int getInDegree(int nodeInx)
getInDegree in interface RootGraphnodeInx - DOCUMENT ME!
public int getInDegree(Node node,
boolean countUndirectedEdges)
getInDegree in interface RootGraphnode - DOCUMENT ME!countUndirectedEdges - DOCUMENT ME!
public int getInDegree(int nodeInx,
boolean countUndirectedEdges)
getInDegree in interface RootGraphnodeInx - DOCUMENT ME!countUndirectedEdges - DOCUMENT ME!
public int getOutDegree(Node node)
getOutDegree in interface RootGraphnode - DOCUMENT ME!
public int getOutDegree(int nodeInx)
getOutDegree in interface RootGraphnodeInx - DOCUMENT ME!
public int getOutDegree(Node node,
boolean countUndirectedEdges)
getOutDegree in interface RootGraphnode - DOCUMENT ME!countUndirectedEdges - DOCUMENT ME!
public int getOutDegree(int nodeInx,
boolean countUndirectedEdges)
getOutDegree in interface RootGraphnodeInx - DOCUMENT ME!countUndirectedEdges - DOCUMENT ME!
public int getDegree(Node node)
getDegree in interface RootGraphnode - DOCUMENT ME!
public int getDegree(int nodeInx)
getDegree in interface RootGraphnodeInx - DOCUMENT ME!
public int getIndex(Node node)
getIndex in interface RootGraphnode - DOCUMENT ME!
public Node getNode(int nodeInx)
getNode in interface RootGraphnodeInx - DOCUMENT ME!
public int getIndex(Edge edge)
getIndex in interface RootGraphedge - DOCUMENT ME!
public Edge getEdge(int edgeInx)
getEdge in interface RootGraphedgeInx - DOCUMENT ME!
public int getEdgeSourceIndex(int edgeInx)
getEdgeSourceIndex in interface RootGraphedgeInx - DOCUMENT ME!
public int getEdgeTargetIndex(int edgeInx)
getEdgeTargetIndex in interface RootGraphedgeInx - DOCUMENT ME!
public boolean isEdgeDirected(int edgeInx)
isEdgeDirected in interface RootGraphedgeInx - DOCUMENT ME!
public boolean addMetaChild(Node parent,
Node child)
addMetaChild in interface RootGraphparent - DOCUMENT ME!child - DOCUMENT ME!
public boolean addNodeMetaChild(int parentNodeInx,
int childNodeInx)
addNodeMetaChild in interface RootGraphparentNodeInx - DOCUMENT ME!childNodeInx - DOCUMENT ME!
public boolean removeNodeMetaChild(int parentNodeInx,
int childNodeInx)
removeNodeMetaChild in interface RootGraphparentNodeInx - DOCUMENT ME!childNodeInx - DOCUMENT ME!
public boolean isMetaParent(Node child,
Node parent)
isMetaParent in interface RootGraphchild - DOCUMENT ME!parent - DOCUMENT ME!
public boolean isNodeMetaParent(int childNodeInx,
int parentNodeInx)
isNodeMetaParent in interface RootGraphchildNodeInx - DOCUMENT ME!parentNodeInx - DOCUMENT ME!
public List metaParentsList(Node node)
metaParentsList in interface RootGraphnode - DOCUMENT ME!
RootGraph.getNodeMetaParentIndicesArray(int)public List nodeMetaParentsList(int nodeInx)
nodeMetaParentsList in interface RootGraphnodeInx - DOCUMENT ME!
RootGraph.getNodeMetaParentIndicesArray(int)public int[] getNodeMetaParentIndicesArray(int nodeInx)
getNodeMetaParentIndicesArray in interface RootGraphnodeInx - DOCUMENT ME!
public boolean isMetaChild(Node parent,
Node child)
isMetaChild in interface RootGraphparent - DOCUMENT ME!child - DOCUMENT ME!
public boolean isNodeMetaChild(int parentNodeInx,
int childNodeInx)
isNodeMetaChild in interface RootGraphparentNodeInx - DOCUMENT ME!childNodeInx - DOCUMENT ME!
public boolean isNodeMetaChild(int parentNodeInx,
int childNodeInx,
boolean recursive)
isNodeMetaChild in interface RootGraphparentNodeInx - DOCUMENT ME!childNodeInx - DOCUMENT ME!recursive - DOCUMENT ME!
public List nodeMetaChildrenList(Node node)
nodeMetaChildrenList in interface RootGraphnode - DOCUMENT ME!
RootGraph.getNodeMetaChildIndicesArray(int)public List nodeMetaChildrenList(int parentNodeInx)
nodeMetaChildrenList in interface RootGraphparentNodeInx - DOCUMENT ME!
public int[] getNodeMetaChildIndicesArray(int parentNodeInx)
getNodeMetaChildIndicesArray in interface RootGraphparentNodeInx - DOCUMENT ME!
public int[] getNodeMetaChildIndicesArray(int parentNodeInx,
boolean recursive)
getNodeMetaChildIndicesArray in interface RootGraphparentNodeInx - DOCUMENT ME!recursive - DOCUMENT ME!
public int[] getChildlessMetaDescendants(int nodeInx)
getChildlessMetaDescendants in interface RootGraphnodeInx - DOCUMENT ME!
public boolean addMetaChild(Node parent,
Edge child)
addMetaChild in interface RootGraphparent - DOCUMENT ME!child - DOCUMENT ME!
public boolean addEdgeMetaChild(int parentNodeInx,
int childEdgeInx)
addEdgeMetaChild in interface RootGraphparentNodeInx - DOCUMENT ME!childEdgeInx - DOCUMENT ME!
public boolean removeEdgeMetaChild(int parentNodeInx,
int childEdgeInx)
removeEdgeMetaChild in interface RootGraphparentNodeInx - DOCUMENT ME!childEdgeInx - DOCUMENT ME!
public boolean isMetaParent(Edge child,
Node parent)
isMetaParent in interface RootGraphchild - DOCUMENT ME!parent - DOCUMENT ME!
public boolean isEdgeMetaParent(int childEdgeInx,
int parentNodeInx)
isEdgeMetaParent in interface RootGraphchildEdgeInx - DOCUMENT ME!parentNodeInx - DOCUMENT ME!
public List metaParentsList(Edge edge)
metaParentsList in interface RootGraphedge - DOCUMENT ME!
RootGraph.getEdgeMetaParentIndicesArray(int)public List edgeMetaParentsList(int edgeInx)
edgeMetaParentsList in interface RootGraphedgeInx - DOCUMENT ME!
RootGraph.getEdgeMetaParentIndicesArray(int)public int[] getEdgeMetaParentIndicesArray(int edgeInx)
getEdgeMetaParentIndicesArray in interface RootGraphedgeInx - DOCUMENT ME!
public boolean isMetaChild(Node parent,
Edge child)
isMetaChild in interface RootGraphparent - DOCUMENT ME!child - DOCUMENT ME!
public boolean isEdgeMetaChild(int parentNodeInx,
int childEdgeInx)
isEdgeMetaChild in interface RootGraphparentNodeInx - DOCUMENT ME!childEdgeInx - DOCUMENT ME!
public List edgeMetaChildrenList(Node node)
edgeMetaChildrenList in interface RootGraphnode - DOCUMENT ME!
RootGraph.getEdgeMetaChildIndicesArray(int)public List edgeMetaChildrenList(int parentNodeInx)
edgeMetaChildrenList in interface RootGraphparentNodeInx - DOCUMENT ME!
RootGraph.getEdgeMetaChildIndicesArray(int)public int[] getEdgeMetaChildIndicesArray(int parentNodeInx)
getEdgeMetaChildIndicesArray in interface RootGraphparentNodeInx - DOCUMENT ME!
|
www.cytoscape.org | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||