Package com.ibm.wala.util.graph
Interface EdgeManager<T>
- Type Parameters:
T- the type of node in the graph
- All Known Subinterfaces:
Graph<T>,LabeledEdgeManager<T,,U> LabeledGraph<T,,U> NumberedEdgeManager<T>,NumberedGraph<T>,NumberedLabeledEdgeManager<T,,U> NumberedLabeledGraph<T,,I> OrderedMultiGraph<T>
- All Known Implementing Classes:
AbstractGraph,AbstractLabeledGraph,AbstractNumberedGraph,AbstractNumberedLabeledGraph,BasicOrderedMultiGraph,DelegatingGraph,DelegatingNumberedEdgeManager,DelegatingNumberedGraph,EdgeFilteredNumberedGraph,ExtensionGraph,InvertedGraph,InvertedNumberedGraph,InvertingEdgeManager,InvertingNumberedEdgeManager,SelfLoopAddedEdgeManager,SelfLoopAddedGraph,SlowSparseNumberedGraph,SlowSparseNumberedLabeledGraph,SparseNumberedEdgeManager,SparseNumberedGraph,SparseNumberedLabeledEdgeManager
public interface EdgeManager<T>
An object which manages edges in a directed graph.
-
Method Summary
Modifier and TypeMethodDescriptionvoidintReturn the number ofimmediate predecessornodes of ngetPredNodes(T n) Return anIteratorover the immediate predecessor nodes of n This method never returnsnull.intReturn the number ofimmediate successornodes of this Node in the GraphgetSuccNodes(T n) Return an Iterator over the immediate successor nodes of nbooleanvoidremoveAllIncidentEdges(T node) voidremoveEdge(T src, T dst) voidremoveIncomingEdges(T node) voidremoveOutgoingEdges(T node)
-
Method Details
-
getPredNodes
Return anIteratorover the immediate predecessor nodes of n This method never returnsnull.- Returns:
- an
Iteratorover the immediate predecessor nodes of this Node.
-
getPredNodeCount
Return the number ofimmediate predecessornodes of n- Returns:
- the number of immediate predecessors of n.
-
getSuccNodes
Return an Iterator over the immediate successor nodes of nThis method never returns
null.- Returns:
- an Iterator over the immediate successor nodes of n
-
getSuccNodeCount
Return the number ofimmediate successornodes of this Node in the Graph- Returns:
- the number of immediate successor Nodes of this Node in the Graph.
-
addEdge
-
removeEdge
- Throws:
UnsupportedOperationException
-
removeAllIncidentEdges
- Throws:
UnsupportedOperationException
-
removeIncomingEdges
- Throws:
UnsupportedOperationException
-
removeOutgoingEdges
- Throws:
UnsupportedOperationException
-
hasEdge
-