com.ibm.wala.util.graph.impl

Class InvertingEdgeManager<T>

java.lang.Object

com.ibm.wala.util.graph.impl.InvertingEdgeManager<T>

All Implemented Interfaces:

EdgeManager<T>

public class InvertingEdgeManager<T>
extends Object
implements EdgeManager<T>

An edge manager that reverses the edges in a graph

Constructor Summary

Constructors

Constructor and Description
InvertingEdgeManager(EdgeManager<T> original)

Method Summary

Modifier and Type	Method and Description
void	addEdge(T src, T dst)
int	getPredNodeCount(T N) Return the number of immediate predecessor nodes of n
Iterator<T>	getPredNodes(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(T N) Return an Iterator over the immediate successor nodes of n
boolean	hasEdge(T src, T dst)
void	removeAllIncidentEdges(T node)
void	removeEdge(T src, T dst)
void	removeIncomingEdges(T node)
void	removeOutgoingEdges(T node)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

InvertingEdgeManager

public InvertingEdgeManager(EdgeManager<T> original)

Method Detail

getPredNodes

public Iterator<T> getPredNodes(T N)
                         throws IllegalArgumentException

Description copied from interface: EdgeManager

Return an Iterator over the immediate predecessor nodes of n

This method never returns null.

Specified by:

getPredNodes in interface EdgeManager<T>

Returns:

an Iterator over the immediate predecessor nodes of this Node.

Throws:

IllegalArgumentException

getPredNodeCount

public int getPredNodeCount(T N)
                     throws IllegalArgumentException

Description copied from interface: EdgeManager

Return the number of immediate predecessor nodes of n

Specified by:

getPredNodeCount in interface EdgeManager<T>

Returns:

the number of immediate predecessors of n.

Throws:

IllegalArgumentException

getSuccNodes

public Iterator<T> getSuccNodes(T N)
                         throws IllegalArgumentException

Description copied from interface: EdgeManager

Return an Iterator over the immediate successor nodes of n

This method never returns null.

Specified by:

getSuccNodes in interface EdgeManager<T>

Returns:

an Iterator over the immediate successor nodes of n

Throws:

IllegalArgumentException

getSuccNodeCount

public int getSuccNodeCount(T N)
                     throws IllegalArgumentException

Description copied from interface: EdgeManager

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

Specified by:

getSuccNodeCount in interface EdgeManager<T>

Returns:

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

Throws:

IllegalArgumentException

addEdge

public void addEdge(T src,
                    T dst)
             throws IllegalArgumentException

Specified by:

addEdge in interface EdgeManager<T>

Throws:

IllegalArgumentException

removeEdge

public void removeEdge(T src,
                       T dst)
                throws IllegalArgumentException

Specified by:

removeEdge in interface EdgeManager<T>

Throws:

IllegalArgumentException

hasEdge

public boolean hasEdge(T src,
                       T dst)

Specified by:

hasEdge in interface EdgeManager<T>

removeAllIncidentEdges

public void removeAllIncidentEdges(T node)
                            throws IllegalArgumentException

Specified by:

removeAllIncidentEdges in interface EdgeManager<T>

Throws:

IllegalArgumentException

removeIncomingEdges

public void removeIncomingEdges(T node)
                         throws IllegalArgumentException

Specified by:

removeIncomingEdges in interface EdgeManager<T>

Throws:

IllegalArgumentException

removeOutgoingEdges

public void removeOutgoingEdges(T node)
                         throws IllegalArgumentException

Specified by:

removeOutgoingEdges in interface EdgeManager<T>

Throws:

IllegalArgumentException