|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectuk.ed.inf.graph.compound.base.BaseSubCompoundGraph
public abstract class BaseSubCompoundGraph
Constructor Summary | |
---|---|
protected |
BaseSubCompoundGraph()
|
Method Summary | |
---|---|
(package private) void |
addEdge(BaseCompoundEdge newEdge)
|
(package private) void |
addTopNode(BaseCompoundNode newNode)
|
(package private) void |
buildComplete()
|
boolean |
containsConnection(BaseCompoundNode thisNode,
BaseCompoundNode thatNode)
Tests if the graph contains an edge connecting these nodes. |
boolean |
containsConnection(IBasicPair<? extends BaseCompoundNode,? extends BaseCompoundEdge> ends)
Tests if the ends define any edge in this graph. |
boolean |
containsDirectedEdge(BaseCompoundNode outNode,
BaseCompoundNode inNode)
Tests if there is one or more directed edges from the outNode to the inNode . |
boolean |
containsDirectedEdge(IDirectedPair<? extends BaseCompoundNode,? extends BaseCompoundEdge> ends)
Tests if the ends define one or more directed edges. |
boolean |
containsEdge(BaseCompoundEdge edge)
Tests if the graph contains the edge. |
boolean |
containsEdge(int edgeIdx)
Tests if the graph contains the edge of the given index. |
boolean |
containsNode(BaseCompoundNode node)
Tests if this node exists in the graph. |
boolean |
containsNode(int nodeIdx)
Tests if the graph contains the node with the given index number. |
boolean |
containsRoot()
Checks if this SubGraph contains the RootNode of the CompoundGraph. |
protected void |
createEdgeSet(IDirectedEdgeSet<BaseCompoundNode,BaseCompoundEdge> edgeSet)
|
protected void |
createNodeSet(INodeSet<BaseCompoundNode,BaseCompoundEdge> nodeSet)
|
java.util.Iterator<BaseCompoundEdge> |
edgeIterator()
Get an iterator that traverses all the edges in this graph. |
BaseCompoundEdge |
getEdge(int edgeIdx)
Get the edge with this index. |
BaseCompoundNode |
getNode(int nodeIdx)
Get the node matching the nodeIdx. |
int |
getNumEdges()
Get the number of edges in the graph. |
int |
getNumNodes()
Get the number of nodes in the graph. |
int |
getNumTopNodes()
|
abstract BaseCompoundGraph |
getSuperGraph()
|
boolean |
isConsistentSnapShot()
|
boolean |
isInducedSubgraph()
|
java.util.Iterator<BaseCompoundNode> |
nodeIterator()
Get an iterator that traverses all the nodes in this graph. |
java.util.Iterator<BaseCompoundNode> |
topNodeIterator()
|
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
protected BaseSubCompoundGraph()
Method Detail |
---|
protected final void createNodeSet(INodeSet<BaseCompoundNode,BaseCompoundEdge> nodeSet)
protected final void createEdgeSet(IDirectedEdgeSet<BaseCompoundNode,BaseCompoundEdge> edgeSet)
public abstract BaseCompoundGraph getSuperGraph()
getSuperGraph
in interface IBasicSubgraph<BaseCompoundNode,BaseCompoundEdge>
getSuperGraph
in interface ISubCompoundGraph<BaseCompoundNode,BaseCompoundEdge>
public boolean isInducedSubgraph()
isInducedSubgraph
in interface IBasicSubgraph<BaseCompoundNode,BaseCompoundEdge>
public boolean containsConnection(BaseCompoundNode thisNode, BaseCompoundNode thatNode)
IBasicGraph
containsConnection
in interface IBasicGraph<BaseCompoundNode,BaseCompoundEdge>
thisNode
- a node to test.thatNode
- the other node to test.
public boolean containsEdge(BaseCompoundEdge edge)
IBasicGraph
containsEdge
in interface IBasicGraph<BaseCompoundNode,BaseCompoundEdge>
edge
- the edge to test.
public boolean containsEdge(int edgeIdx)
IBasicGraph
containsEdge
in interface IBasicGraph<BaseCompoundNode,BaseCompoundEdge>
edgeIdx
- the index to test.
public boolean containsNode(int nodeIdx)
IBasicGraph
containsNode
in interface IBasicGraph<BaseCompoundNode,BaseCompoundEdge>
nodeIdx
- The index number of the node.
public boolean containsNode(BaseCompoundNode node)
IBasicGraph
containsNode
in interface IBasicGraph<BaseCompoundNode,BaseCompoundEdge>
node
- to be tested.
public BaseCompoundEdge getEdge(int edgeIdx)
IBasicGraph
getEdge
in interface IBasicGraph<BaseCompoundNode,BaseCompoundEdge>
getEdge
in interface ISubCompoundGraph<BaseCompoundNode,BaseCompoundEdge>
edgeIdx
- The index of the edge.
public java.util.Iterator<BaseCompoundEdge> edgeIterator()
IBasicGraph
edgeIterator
in interface IBasicGraph<BaseCompoundNode,BaseCompoundEdge>
public BaseCompoundNode getNode(int nodeIdx)
IBasicGraph
getNode
in interface IBasicGraph<BaseCompoundNode,BaseCompoundEdge>
getNode
in interface ISubCompoundGraph<BaseCompoundNode,BaseCompoundEdge>
nodeIdx
- the node index to lookup.
public java.util.Iterator<BaseCompoundNode> nodeIterator()
IBasicGraph
nodeIterator
in interface IBasicGraph<BaseCompoundNode,BaseCompoundEdge>
public int getNumEdges()
IBasicGraph
getNumEdges
in interface IBasicGraph<BaseCompoundNode,BaseCompoundEdge>
public int getNumNodes()
IBasicGraph
getNumNodes
in interface IBasicGraph<BaseCompoundNode,BaseCompoundEdge>
void addTopNode(BaseCompoundNode newNode)
void addEdge(BaseCompoundEdge newEdge)
void buildComplete()
public boolean containsDirectedEdge(BaseCompoundNode outNode, BaseCompoundNode inNode)
IDirectedGraph
outNode
to the inNode
.
containsDirectedEdge
in interface IDirectedGraph<BaseCompoundNode,BaseCompoundEdge>
outNode
- the node the edge comes out from, can be null.inNode
- the node the edge goes into, can be null.
public boolean isConsistentSnapShot()
isConsistentSnapShot
in interface IBasicSubgraph<BaseCompoundNode,BaseCompoundEdge>
public boolean containsDirectedEdge(IDirectedPair<? extends BaseCompoundNode,? extends BaseCompoundEdge> ends)
containsDirectedEdge
in interface IDirectedGraph<BaseCompoundNode,BaseCompoundEdge>
ends
- the pair of nodes to be tested, can be null.
public boolean containsConnection(IBasicPair<? extends BaseCompoundNode,? extends BaseCompoundEdge> ends)
ends
to be of type
IDirectedPair
and will return false if it is not.
containsConnection
in interface IBasicGraph<BaseCompoundNode,BaseCompoundEdge>
ends
- the pair of nodes that may define the edges of an edge.
public java.util.Iterator<BaseCompoundNode> topNodeIterator()
topNodeIterator
in interface ISubCompoundGraph<BaseCompoundNode,BaseCompoundEdge>
public int getNumTopNodes()
getNumTopNodes
in interface ISubCompoundGraph<BaseCompoundNode,BaseCompoundEdge>
public boolean containsRoot()
containsRoot
in interface ISubCompoundGraph<BaseCompoundNode,BaseCompoundEdge>
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |