com.ibm.wala.util.graph.impl

Class ExtensionGraph<T>

java.lang.Object

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

All Implemented Interfaces:

EdgeManager<T>, Graph<T>, NodeManager<T>, NumberedEdgeManager<T>, NumberedGraph<T>, NumberedNodeManager<T>, Iterable<T>

public class ExtensionGraph<T>
extends Object
implements NumberedGraph<T>

Constructor Summary

Constructors

Constructor and Description
ExtensionGraph(NumberedGraph<T> original)

Method Summary

Modifier and Type	Method and Description
void	addEdge(T src, T dst)
void	addNode(T n) add a node to this graph
boolean	containsNode(T n)
int	getMaxNumber()
T	getNode(int number)
int	getNumber(T N)
int	getNumberOfNodes()
int	getPredNodeCount(T n) Return the number of immediate predecessor nodes of n
IntSet	getPredNodeNumbers(T node)
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
IntSet	getSuccNodeNumbers(T node)
Iterator<T>	getSuccNodes(T n) Return an Iterator over the immediate successor nodes of n
boolean	hasEdge(T src, T dst)
Iterator<T>	iterateNodes(IntSet s)
Iterator<T>	iterator()
void	removeAllIncidentEdges(T node)
void	removeEdge(T src, T dst)
void	removeIncomingEdges(T node)
void	removeNode(T n) remove a node from this graph
void	removeNodeAndEdges(T n) remove a node and all its incident edges
void	removeOutgoingEdges(T node)
Stream<T>	stream()

Methods inherited from class java.lang.Object

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

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Constructor Detail

ExtensionGraph

public ExtensionGraph(NumberedGraph<T> original)

Method Detail

iterator

public Iterator<T> iterator()

Specified by:

iterator in interface NodeManager<T>

Specified by:

iterator in interface Iterable<T>

Returns:

an Iterator of the nodes in this graph

stream

public Stream<T> stream()

Specified by:

stream in interface NodeManager<T>

Returns:

a Stream of the nodes in this graph

getNumberOfNodes

public int getNumberOfNodes()

Specified by:

getNumberOfNodes in interface NodeManager<T>

Returns:

the number of nodes in this graph

addNode

public void addNode(T n)

Description copied from interface: NodeManager

add a node to this graph

Specified by:

addNode in interface NodeManager<T>

removeNode

public void removeNode(T n)
                throws UnsupportedOperationException

Description copied from interface: NodeManager

remove a node from this graph

Specified by:

removeNode in interface NodeManager<T>

Throws:

UnsupportedOperationException

containsNode

public boolean containsNode(T n)

Specified by:

containsNode in interface NodeManager<T>

Returns:

true iff the graph contains the specified node

getNumber

public int getNumber(T N)

Specified by:

getNumber in interface NumberedNodeManager<T>

getNode

public T getNode(int number)

Specified by:

getNode in interface NumberedNodeManager<T>

getMaxNumber

public int getMaxNumber()

Specified by:

getMaxNumber in interface NumberedNodeManager<T>

iterateNodes

public Iterator<T> iterateNodes(IntSet s)

Specified by:

iterateNodes in interface NumberedNodeManager<T>

Returns:

iterator of nodes with the numbers in set s

getPredNodes

public Iterator<T> getPredNodes(T n)

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.

getPredNodeCount

public int getPredNodeCount(T n)

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.

getPredNodeNumbers

public IntSet getPredNodeNumbers(T node)

Specified by:

getPredNodeNumbers in interface NumberedEdgeManager<T>

Returns:

the numbers identifying the immediate predecessors of node

getSuccNodes

public Iterator<T> getSuccNodes(T n)

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

getSuccNodeCount

public int getSuccNodeCount(T N)

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.

getSuccNodeNumbers

public IntSet getSuccNodeNumbers(T node)

Specified by:

getSuccNodeNumbers in interface NumberedEdgeManager<T>

Returns:

the numbers identifying the immediate successors of node

addEdge

public void addEdge(T src,
                    T dst)

Specified by:

addEdge in interface EdgeManager<T>

removeEdge

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

Specified by:

removeEdge in interface EdgeManager<T>

Throws:

UnsupportedOperationException

removeAllIncidentEdges

public void removeAllIncidentEdges(T node)
                            throws UnsupportedOperationException

Specified by:

removeAllIncidentEdges in interface EdgeManager<T>

Throws:

UnsupportedOperationException

removeIncomingEdges

public void removeIncomingEdges(T node)
                         throws UnsupportedOperationException

Specified by:

removeIncomingEdges in interface EdgeManager<T>

Throws:

UnsupportedOperationException

removeOutgoingEdges

public void removeOutgoingEdges(T node)
                         throws UnsupportedOperationException

Specified by:

removeOutgoingEdges in interface EdgeManager<T>

Throws:

UnsupportedOperationException

hasEdge

public boolean hasEdge(T src,
                       T dst)

Specified by:

hasEdge in interface EdgeManager<T>

removeNodeAndEdges

public void removeNodeAndEdges(T n)
                        throws UnsupportedOperationException

Description copied from interface: Graph

remove a node and all its incident edges

Specified by:

removeNodeAndEdges in interface Graph<T>

Throws:

UnsupportedOperationException - if the graph implementation does not allow removal