uk.ed.inf.graph.compound
Interface ICompoundNode<N extends ICompoundNode<N,? extends ICompoundEdge<N,?>> & ITreeNode<N>,E extends ICompoundEdge<N,E>>

All Superinterfaces:
java.lang.Comparable<N>, IBasicNode<N,E>, IDirectedNode<N,E>, ITreeNode<N>
All Known Implementing Classes:
ArchetypalCompoundNode, BaseCompoundNode, CompoundNode

public interface ICompoundNode<N extends ICompoundNode<N,? extends ICompoundEdge<N,?>> & ITreeNode<N>,E extends ICompoundEdge<N,E>>
extends IDirectedNode<N,E>, ITreeNode<N>


Method Summary
 IChildCompoundGraph<N,E> getChildCompoundGraph()
          Get subgraph of this compound node.
 boolean isAncestor(N testNode)
           
 boolean isDescendent(N testNode)
           
 
Methods inherited from interface uk.ed.inf.graph.directed.IDirectedNode
getInDegree, getInEdgeIterator, getInEdgesFrom, getInNodeIterator, getOutDegree, getOutEdgeIterator, getOutEdgesTo, getOutNodeIterator, hasInEdgeFrom, hasOutEdgeTo
 
Methods inherited from interface uk.ed.inf.graph.basic.IBasicNode
compareTo, connectedNodeIterator, edgeIterator, equals, getDegree, getEdgesWith, getGraph, getIndex, hasEdgeWith, hashCode, isRemoved
 
Methods inherited from interface uk.ed.inf.tree.ITreeNode
ancestorIterator, childIterator, getIndex, getParent, getRoot, isChild, isParent, levelOrderIterator
 

Method Detail

getChildCompoundGraph

IChildCompoundGraph<N,E> getChildCompoundGraph()
Get subgraph of this compound node. Note that this node is the root-node of the sub-Cigraph.

Returns:

isDescendent

boolean isDescendent(N testNode)

isAncestor

boolean isAncestor(N testNode)