|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Object | +--soot.toolkits.graph.HashMutableDirectedGraph
HashMap based implementation of a MutableBlockGraph.
| Constructor Summary | |
HashMutableDirectedGraph()
|
|
| Method Summary | |
void |
addEdge(java.lang.Object from,
java.lang.Object to)
Adds an edge to the graph between 2 nodes. |
void |
addNode(java.lang.Object node)
Adds a node to the graph. |
void |
clearAll()
Removes all nodes and edges. |
java.lang.Object |
clone()
|
boolean |
containsEdge(java.lang.Object from,
java.lang.Object to)
|
boolean |
containsNode(java.lang.Object node)
|
java.util.List |
getHeads()
Returns a list of entry points for this graph. |
java.util.List |
getNodes()
|
java.util.List |
getPredsOf(java.lang.Object s)
Returns a list of predecessors for the given node in the graph. |
java.util.List |
getSuccsOf(java.lang.Object s)
Returns a list of successors for the given node in the graph. |
java.util.List |
getTails()
Returns a list of exit points for this graph. |
java.util.Iterator |
iterator()
Returns an iterator for the nodes in this graph. |
void |
removeEdge(java.lang.Object from,
java.lang.Object to)
Removes an edge between 2 nodes in the graph. |
void |
removeNode(java.lang.Object node)
Removes a node from the graph. |
int |
size()
Returns the node count for this graph. |
| Methods inherited from class java.lang.Object |
equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
public HashMutableDirectedGraph()
| Method Detail |
public void clearAll()
public java.lang.Object clone()
clone in class java.lang.Objectpublic java.util.List getHeads()
DirectedGraphgetHeads in interface DirectedGraphpublic java.util.List getTails()
DirectedGraphgetTails in interface DirectedGraphpublic java.util.List getPredsOf(java.lang.Object s)
DirectedGraphgetPredsOf in interface DirectedGraphpublic java.util.List getSuccsOf(java.lang.Object s)
DirectedGraphgetSuccsOf in interface DirectedGraphpublic int size()
DirectedGraphsize in interface DirectedGraphpublic java.util.Iterator iterator()
DirectedGraphiterator in interface DirectedGraph
public void addEdge(java.lang.Object from,
java.lang.Object to)
MutableDirectedGraphaddEdge in interface MutableDirectedGraphsoot.toolkits.graph.MutableDirectedGraphfrom - out node for the edge.to - in node for the edge.
public void removeEdge(java.lang.Object from,
java.lang.Object to)
MutableDirectedGraphremoveEdge in interface MutableDirectedGraphsoot.toolkits.graph.MutableDirectedGraphfrom - out node for the edge to remove.to - in node for the edge to remove.
public boolean containsEdge(java.lang.Object from,
java.lang.Object to)
containsEdge in interface MutableDirectedGraphsoot.toolkits.graph.MutableDirectedGraphpublic boolean containsNode(java.lang.Object node)
containsNode in interface MutableDirectedGraphsoot.toolkits.graph.MutableDirectedGraphnode - node that we want to know if the graph constains.public java.util.List getNodes()
getNodes in interface MutableDirectedGraphsoot.toolkits.graph.MutableDirectedGraphpublic void addNode(java.lang.Object node)
MutableDirectedGraphaddNode in interface MutableDirectedGraphsoot.toolkits.graph.MutableDirectedGraphnode - a node to add to the graph.DirectedGraph.getHeads(),
DirectedGraph.getTails()public void removeNode(java.lang.Object node)
MutableDirectedGraphremoveNode in interface MutableDirectedGraphsoot.toolkits.graph.MutableDirectedGraphnode - the node to be removed.
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||