Package com.ibm.wala.util.graph

Interface EdgeManager<T>

Type Parameters:

T - the type of node in the graph

All Known Subinterfaces:

CallGraph, ControlFlowGraph<I,T>, Graph<T>, HeapGraph<T>, IFlowGraph, ISDG, ISupergraph<T,P>, LabeledEdgeManager<T,U>, LabeledGraph<T,U>, MinimalCFG<T>, NumberedEdgeManager<T>, NumberedGraph<T>, NumberedLabeledEdgeManager<T,U>, NumberedLabeledGraph<T,I>, OrderedMultiGraph<T>, SerializableGraph<T>

All Known Implementing Classes:

AbstractCFG, AbstractDemandFlowGraph, AbstractFlowGraph, AbstractGraph, AbstractInterproceduralCFG, AbstractLabeledGraph, AbstractNumberedGraph, AbstractNumberedLabeledGraph, AstCallGraph, AstInducedCFG, AstTranslator.AstCFG, AstTranslator.IncipientCFG, BackwardsSupergraph, BasicCallGraph, BasicEdgeManager, BasicGraph, BasicHeapGraph, BasicOrderedMultiGraph, CHACallGraph, CISDG, ControlDependenceGraph, CrossLanguageCallGraph, DelegatingCFG, DelegatingExplicitCallGraph, DelegatingGraph, DelegatingNumberedEdgeManager, DelegatingNumberedGraph, DemandPointerFlowGraph, DemandValueFlowGraph, DexCFG, EdgeFilteredNumberedGraph, ExplicitCallGraph, ExplicitCallGraph.ExplicitEdgeManager, ExplicitPredecessorsEdgeManager, ExplodedControlFlowGraph, ExplodedInterproceduralCFG, ExtensionGraph, HeapGraphImpl, ICFGSupergraph, InducedCFG, InterproceduralCFG, InvertedGraph, InvertedNumberedGraph, InvertingEdgeManager, InvertingNumberedEdgeManager, JSCallGraph, JSInducedCFG, MutableCFG, PartialCallGraph, PDG, PrefixTransferGraph, PrunedCallGraph, PrunedCFG, RandomGraph, RandomGraph.IntegerRandomGraph, SDG, SelfLoopAddedEdgeManager, SelfLoopAddedGraph, ShrikeCFG, SimpleDemandPointerFlowGraph, SlowSparseNumberedGraph, SlowSparseNumberedLabeledGraph, SparseNumberedEdgeManager, SparseNumberedGraph, SparseNumberedLabeledEdgeManager, SSACFG, UriPrefixTransferGraph

public interface EdgeManager<T>

An object which manages edges in a directed graph.

Method Summary

Modifier and Type	Method	Description
void	addEdge(T src, T dst)
int	getPredNodeCount(T n)	Return the number of immediate predecessor nodes of n
Iterator<T>	getPredNodes(@Nullable T n)	Return an Iterator over the immediate predecessor nodes of n
int	getSuccNodeCount(T N)	Return the number of immediate successor nodes of this Node in the Graph
Iterator<T>	getSuccNodes(@Nullable T n)	Return an Iterator over the immediate successor nodes of n
boolean	hasEdge(@Nullable T src, @Nullable T dst)
void	removeAllIncidentEdges(T node)
void	removeEdge(T src, T dst)
void	removeIncomingEdges(T node)
void	removeOutgoingEdges(T node)

Method Details

getPredNodes

Iterator<T> getPredNodes(@Nullable T n)

Return an Iterator over the immediate predecessor nodes of n

This method never returns null.

Returns:

an Iterator over the immediate predecessor nodes of this Node.

getPredNodeCount

int getPredNodeCount(T n)

Return the number of immediate predecessor nodes of n

Returns:

the number of immediate predecessors of n.

getSuccNodes

Iterator<T> getSuccNodes(@Nullable T n)

Return an Iterator over the immediate successor nodes of n

This method never returns null.

Returns:

an Iterator over the immediate successor nodes of n

getSuccNodeCount

int getSuccNodeCount(T N)

Return the number of immediate successor nodes of this Node in the Graph

Returns:

the number of immediate successor Nodes of this Node in the Graph.

addEdge

void addEdge(T src,
 T dst)

removeEdge

void removeEdge(T src,
 T dst)
         throws UnsupportedOperationException

Throws:

UnsupportedOperationException

removeAllIncidentEdges

void removeAllIncidentEdges(T node)
                     throws UnsupportedOperationException

Throws:

UnsupportedOperationException

removeIncomingEdges

void removeIncomingEdges(T node)
                  throws UnsupportedOperationException

Throws:

UnsupportedOperationException

removeOutgoingEdges

void removeOutgoingEdges(T node)
                  throws UnsupportedOperationException

Throws:

UnsupportedOperationException

hasEdge

boolean hasEdge(@Nullable T src,
 @Nullable T dst)