|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
public interface NumberedGraph<T>
A numbered graph is a Graph where each node has a unique persistent non-negative integer id.
| Method Summary |
|---|
| Methods inherited from interface com.ibm.wala.util.graph.Graph |
|---|
removeNodeAndEdges |
| Methods inherited from interface com.ibm.wala.util.graph.NodeManager |
|---|
addNode, containsNode, getNumberOfNodes, iterator, removeNode |
| Methods inherited from interface com.ibm.wala.util.graph.EdgeManager |
|---|
addEdge, getPredNodeCount, getPredNodes, getSuccNodeCount, getSuccNodes, hasEdge, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeOutgoingEdges |
| Methods inherited from interface com.ibm.wala.util.graph.NumberedNodeManager |
|---|
getMaxNumber, getNode, getNumber, iterateNodes |
| Methods inherited from interface com.ibm.wala.util.graph.NodeManager |
|---|
addNode, containsNode, getNumberOfNodes, iterator, removeNode |
| Methods inherited from interface com.ibm.wala.util.graph.NumberedEdgeManager |
|---|
getPredNodeNumbers, getSuccNodeNumbers |
| Methods inherited from interface com.ibm.wala.util.graph.EdgeManager |
|---|
addEdge, getPredNodeCount, getPredNodes, getSuccNodeCount, getSuccNodes, hasEdge, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeOutgoingEdges |
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||