Package com.ibm.wala.util.graph

Interface NumberedGraph<T>

All Superinterfaces:
EdgeManager<T>, Graph<T>, 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 a Graph where each node has a unique persistent non-negative integer id.