|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Object | +--uk.ac.bbk.dcs.automed.graph.DirectedGraph
Class that abstracts a directed unlabelled graph.
| Constructor Summary | |
DirectedGraph()
|
|
| Method Summary | |
void |
addGraphNode(DirectedGraphNode n)
Adds a node in the graph. |
protected void |
addSubGraph(DirectedGraph graph)
Adds a subGraph in the set of subGraphs. |
protected java.util.LinkedList |
getGraph()
|
protected DirectedGraphNode |
getNode(int i)
|
DirectedGraphNode |
getNode(java.lang.String name)
|
protected java.util.HashSet |
getSubGraphs()
|
protected void |
identifySubGraphs()
Discovers the subGraphs in the graph |
protected void |
printGraph(DirectedGraph n)
|
int |
size()
|
java.util.HashSet |
toForest(Forest f)
This method first divides a given graph into subGraphs. |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
public DirectedGraph()
| Method Detail |
public void addGraphNode(DirectedGraphNode n)
n - the node to addprotected java.util.LinkedList getGraph()
public int size()
protected DirectedGraphNode getNode(int i)
public DirectedGraphNode getNode(java.lang.String name)
throws NotFoundException
NotFoundExceptionpublic java.util.HashSet toForest(Forest f)
protected java.util.HashSet getSubGraphs()
protected void addSubGraph(DirectedGraph graph)
graph - the subGraph to addprotected void identifySubGraphs()
protected void printGraph(DirectedGraph n)
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||