Package com.ibm.wala.util.graph
Interface NumberedGraph<T>
-
- All Superinterfaces:
EdgeManager<T>
,Graph<T>
,java.lang.Iterable<T>
,NodeManager<T>
,NumberedEdgeManager<T>
,NumberedNodeManager<T>
- All Known Subinterfaces:
NumberedLabeledGraph<T,I>
- All Known Implementing Classes:
AbstractNumberedGraph
,AbstractNumberedLabeledGraph
,DelegatingNumberedGraph
,EdgeFilteredNumberedGraph
,ExtensionGraph
,InvertedNumberedGraph
,SlowSparseNumberedGraph
,SlowSparseNumberedLabeledGraph
,SparseNumberedGraph
public interface NumberedGraph<T> extends Graph<T>, NumberedNodeManager<T>, NumberedEdgeManager<T>
A numbered graph is aGraph
where each node has a unique persistent non-negative integer id.
-
-
Method Summary
-
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.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.NumberedEdgeManager
getPredNodeNumbers, getSuccNodeNumbers
-
Methods inherited from interface com.ibm.wala.util.graph.NumberedNodeManager
getMaxNumber, getNode, getNumber, iterateNodes
-
-