edu.byu.ece.graph
Interface HierarchicalGraph

All Superinterfaces:
DirectedGraph, java.io.Serializable
All Known Implementing Classes:
EdifCellInstanceCollectionGraph

public interface HierarchicalGraph
extends DirectedGraph


Method Summary
 boolean containsInnerNode(java.lang.Object node)
           
 java.util.Collection<? extends Edge> getInnerEdges(Edge edge)
           
 DirectedGraph getInnerGraph()
           
 java.util.Collection getInnerNodes(java.lang.Object node)
           
 DirectedGraph getNodeGraph(java.lang.Object node)
           
 java.lang.Object getParentNode(java.lang.Object node)
           
 
Methods inherited from interface edu.byu.ece.graph.DirectedGraph
containsNode, getAncestors, getDescendents, getEdge, getEdges, getInputEdges, getNodes, getOutputEdges, getPredecessors, getSubGraph, getSuccessors, invert
 

Method Detail

containsInnerNode

boolean containsInnerNode(java.lang.Object node)
Parameters:
node - A node to look for in the inner graph
Returns:
true if the given node is found in the inner graph

getInnerGraph

DirectedGraph getInnerGraph()
Returns:
The inside graph that this graph is built upon

getInnerEdges

java.util.Collection<? extends Edge> getInnerEdges(Edge edge)
Parameters:
edge - An Edge object in the HierarchicalGraph
Returns:
A Collection of Edge objects corresponding to the given edge's inner edges (those that make up this edge)

getInnerNodes

java.util.Collection getInnerNodes(java.lang.Object node)
Parameters:
node - A node in this HierarchicalGraph
Returns:
A Collection of nodes from the inner graph that correspond to the given node in this graph

getNodeGraph

DirectedGraph getNodeGraph(java.lang.Object node)
Parameters:
node - A node in this HierarchicalGraph
Returns:
A DirectedGraph object which is the subgraph corresponding to the given node's inner nodes

getParentNode

java.lang.Object getParentNode(java.lang.Object node)
Parameters:
node - A node in the inner graph
Returns:
The node in this HierarchicalGraph that corresponds to the given inner node