|
|||||||||
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. |
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(Directed s)
Returns a list of predecessors for the given node in the graph. |
java.util.List |
getSuccsOf(Directed 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 |
clone,
equals,
finalize,
getClass,
hashCode,
notify,
notifyAll,
toString,
wait,
wait,
wait |
Constructor Detail |
public HashMutableDirectedGraph()
Method Detail |
public java.util.List getHeads()
public java.util.List getTails()
public java.util.List getPredsOf(Directed s)
Directed
public java.util.List getSuccsOf(Directed s)
Directed
public int size()
Directed
public java.util.Iterator iterator()
public void addEdge(java.lang.Object from, java.lang.Object to)
from
- out node for the edge.to
- in node for the edge.public void removeEdge(java.lang.Object from, java.lang.Object to)
from
- 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)
public boolean containsNode(java.lang.Object node)
node
- node that we want to know if the graph constains.public java.util.List getNodes()
public void addNode(java.lang.Object node)
node
- a node to add to the graph.DirectedGraph.getHeads()
,
DirectedGraph.getTails()
public void removeNode(java.lang.Object node)
node
- the node to be removed.
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |