Package com.ibm.wala.util.graph
Interface Graph<T>
-
- Type Parameters:
T
- the type of nodes in this graph.
- All Superinterfaces:
EdgeManager<T>
,java.lang.Iterable<T>
,NodeManager<T>
- All Known Subinterfaces:
LabeledGraph<T,U>
,NumberedGraph<T>
,NumberedLabeledGraph<T,I>
,OrderedMultiGraph<T>
- All Known Implementing Classes:
AbstractGraph
,AbstractLabeledGraph
,AbstractNumberedGraph
,AbstractNumberedLabeledGraph
,BasicOrderedMultiGraph
,DelegatingGraph
,DelegatingNumberedGraph
,EdgeFilteredNumberedGraph
,ExtensionGraph
,InvertedGraph
,InvertedNumberedGraph
,SelfLoopAddedGraph
,SlowSparseNumberedGraph
,SlowSparseNumberedLabeledGraph
,SparseNumberedGraph
public interface Graph<T> extends NodeManager<T>, EdgeManager<T>
Basic interface for a directed graph. We choose to define aGraph
as a composition of aNodeManager
and anEdgeManager
, which track nodes and edges, respectively. This way, in many cases we can compose separateNodeManager
andEdgeManager
implementations to createGraph
implementations, using delegation.
-
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description void
removeNodeAndEdges(T n)
remove a node and all its incident edges-
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.NodeManager
addNode, containsNode, getNumberOfNodes, iterator, removeNode
-
-
-
-
Method Detail
-
removeNodeAndEdges
void removeNodeAndEdges(T n) throws java.lang.UnsupportedOperationException
remove a node and all its incident edges- Throws:
java.lang.UnsupportedOperationException
- if the graph implementation does not allow removal
-
-