|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
public interface MutableDirectedGraph<N>
Defines a DirectedGraph which is modifiable. Provides an interface to add/delete nodes and edges.
| Method Summary | |
|---|---|
void |
addEdge(N from,
N to)
Adds an edge to the graph between 2 nodes. |
void |
addNode(N node)
Adds a node to the graph. |
boolean |
containsEdge(N from,
N to)
|
boolean |
containsNode(N node)
|
List<N> |
getNodes()
|
void |
removeEdge(N from,
N to)
Removes an edge between 2 nodes in the graph. |
void |
removeNode(N node)
Removes a node from the graph. |
| Methods inherited from interface soot.toolkits.graph.DirectedGraph |
|---|
getHeads, getPredsOf, getSuccsOf, getTails, iterator, size |
| Method Detail |
|---|
void addEdge(N from,
N to)
from - out node for the edge.to - in node for the edge.
void removeEdge(N from,
N to)
from - out node for the edge to remove.to - in node for the edge to remove.
boolean containsEdge(N from,
N to)
List<N> getNodes()
void addNode(N node)
node - a node to add to the graph.DirectedGraph.getHeads(),
DirectedGraph.getTails()void removeNode(N node)
node - the node to be removed.boolean containsNode(N node)
node - node that we want to know if the graph constains.
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||