|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
public interface MutableEdgeLabelledDirectedGraph
Defines a DirectedGraph which is modifiable and associates a label object with every edge. Provides an interface to add/delete nodes and edges.
| Method Summary | |
|---|---|
void |
addEdge(Object from,
Object to,
Object label)
Adds an edge to the graph between 2 nodes. |
void |
addNode(Object node)
Adds a node to the graph. |
boolean |
containsAnyEdge(Object label)
|
boolean |
containsAnyEdge(Object from,
Object to)
|
boolean |
containsEdge(Object from,
Object to,
Object label)
|
boolean |
containsNode(Object node)
|
MutableDirectedGraph |
getEdgesForLabel(Object label)
Returns a MutableDirectedGraph consisting of all edges with the given label and their nodes. |
List<Object> |
getLabelsForEdges(Object from,
Object to)
Returns a list of labels for which an edge exists between from and to |
List<Object> |
getNodes()
|
void |
removeAllEdges(Object label)
Removes all edges with the given label in the graph. |
void |
removeAllEdges(Object from,
Object to)
Removes all edges between 2 nodes in the graph. |
void |
removeEdge(Object from,
Object to,
Object label)
Removes an edge between 2 nodes in the graph. |
void |
removeNode(Object 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(Object from,
Object to,
Object label)
from - out node for the edge.to - in node for the edge.label - label for the edge.
List<Object> getLabelsForEdges(Object from,
Object to)
from - out node for the edges to remove.to - in node for the edges to remove.MutableDirectedGraph getEdgesForLabel(Object label)
label - label for the edge to remove.
void removeEdge(Object from,
Object to,
Object label)
from - out node for the edges to remove.to - in node for the edges to remove.label - label for the edge to remove.
void removeAllEdges(Object from,
Object to)
from - out node for the edges to remove.to - in node for the edges to remove.void removeAllEdges(Object label)
label - label for the edge to remove.
boolean containsEdge(Object from,
Object to,
Object label)
boolean containsAnyEdge(Object from,
Object to)
from - out node for the edges.to - in node for the edges.
boolean containsAnyEdge(Object label)
label - label for the edges.
List<Object> getNodes()
void addNode(Object node)
node - a node to add to the graph.DirectedGraph.getHeads(),
DirectedGraph.getTails()void removeNode(Object node)
node - the node to be removed.boolean containsNode(Object 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 | |||||||||