|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object soot.toolkits.graph.HashMutableDirectedGraph soot.toolkits.graph.HashReversibleGraph
public class HashReversibleGraph
A reversible version of HashMutableDirectedGraph
Field Summary | |
---|---|
protected boolean |
reversed
|
Fields inherited from class soot.toolkits.graph.HashMutableDirectedGraph |
---|
heads, nodeToPreds, nodeToSuccs, tails |
Constructor Summary | |
---|---|
HashReversibleGraph()
|
|
HashReversibleGraph(DirectedGraph dg)
|
Method Summary | |
---|---|
void |
addEdge(Object from,
Object to)
Adds an edge to the graph between 2 nodes. |
boolean |
containsEdge(Object from,
Object to)
|
List |
getHeads()
Returns a list of entry points for this graph. |
List |
getPredsOf(Object s)
Returns a list of predecessors for the given node in the graph. |
List |
getSuccsOf(Object s)
Returns a list of successors for the given node in the graph. |
List |
getTails()
Returns a list of exit points for this graph. |
boolean |
isReversed()
Returns true if the graph is now reversed from its original state at creation. |
void |
removeEdge(Object from,
Object to)
Removes an edge between 2 nodes in the graph. |
ReversibleGraph |
reverse()
Reverse the edges of the current graph and swap head and tail nodes. |
Methods inherited from class soot.toolkits.graph.HashMutableDirectedGraph |
---|
addNode, clearAll, clone, containsNode, getNodes, getPredsOfAsSet, getSuccsOfAsSet, iterator, printGraph, removeNode, size |
Methods inherited from class java.lang.Object |
---|
equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Methods inherited from interface soot.toolkits.graph.MutableDirectedGraph |
---|
addNode, containsNode, getNodes, removeNode |
Methods inherited from interface soot.toolkits.graph.DirectedGraph |
---|
iterator, size |
Field Detail |
---|
protected boolean reversed
Constructor Detail |
---|
public HashReversibleGraph(DirectedGraph dg)
public HashReversibleGraph()
Method Detail |
---|
public boolean isReversed()
ReversibleGraph
isReversed
in interface ReversibleGraph
public ReversibleGraph reverse()
ReversibleGraph
reverse
in interface ReversibleGraph
public void addEdge(Object from, Object to)
MutableDirectedGraph
addEdge
in interface MutableDirectedGraph
addEdge
in class HashMutableDirectedGraph
from
- out node for the edge.to
- in node for the edge.public void removeEdge(Object from, Object to)
MutableDirectedGraph
removeEdge
in interface MutableDirectedGraph
removeEdge
in class HashMutableDirectedGraph
from
- out node for the edge to remove.to
- in node for the edge to remove.public boolean containsEdge(Object from, Object to)
containsEdge
in interface MutableDirectedGraph
containsEdge
in class HashMutableDirectedGraph
public List getHeads()
DirectedGraph
getHeads
in interface DirectedGraph
getHeads
in class HashMutableDirectedGraph
public List getTails()
DirectedGraph
getTails
in interface DirectedGraph
getTails
in class HashMutableDirectedGraph
public List getPredsOf(Object s)
DirectedGraph
getPredsOf
in interface DirectedGraph
getPredsOf
in class HashMutableDirectedGraph
public List getSuccsOf(Object s)
DirectedGraph
getSuccsOf
in interface DirectedGraph
getSuccsOf
in class HashMutableDirectedGraph
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |