Class RandomGraph.IntegerRandomGraph

java.lang.Object

com.ibm.wala.util.graph.AbstractGraph<Integer>

com.ibm.wala.util.graph.AbstractNumberedGraph<Integer>

com.ibm.wala.util.graph.impl.SlowSparseNumberedGraph<Integer>

com.ibm.wala.util.graph.impl.RandomGraph<Integer>

com.ibm.wala.util.graph.impl.RandomGraph.IntegerRandomGraph

All Implemented Interfaces:

EdgeManager<Integer>, Graph<Integer>, NodeManager<Integer>, NumberedEdgeManager<Integer>, NumberedGraph<Integer>, NumberedNodeManager<Integer>, Serializable, Iterable<Integer>

Enclosing class:

RandomGraph<T>

public static class RandomGraph.IntegerRandomGraph
extends RandomGraph<Integer>

See Also:

• Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from class RandomGraph

RandomGraph.IntegerRandomGraph

Modifier and Type	Class	Description
static class	RandomGraph.IntegerRandomGraph

Constructor Summary

Constructors

Constructor	Description
IntegerRandomGraph(int nodes, int edges)

Method Summary

Modifier and Type	Method	Description
protected Integer	makeNode(int i)

Methods inherited from class SlowSparseNumberedGraph

copyInto, duplicate, getEdgeManager, getNodeManager, make

Modifier and Type	Method	Description
static <T> void	copyInto(Graph<T> g, Graph<T> into)
static <T> SlowSparseNumberedGraph<T>	duplicate(Graph<T> g)
NumberedEdgeManager<Integer>	getEdgeManager()
NumberedNodeManager<Integer>	getNodeManager()
static <T> SlowSparseNumberedGraph<T>	make()

Methods inherited from class AbstractNumberedGraph

getMaxNumber, getNode, getNumber, getPredNodeNumbers, getSuccNodeNumbers, iterateNodes

Modifier and Type	Method	Description
int	getMaxNumber()
Integer	getNode(int number)
int	getNumber(Integer N)
IntSet	getPredNodeNumbers(Integer node)
IntSet	getSuccNodeNumbers(Integer node)
Iterator<Integer>	iterateNodes(IntSet s)

Methods inherited from class AbstractGraph

addEdge, addNode, containsNode, edgeString, getNumberOfNodes, getPredNodeCount, getPredNodes, getSuccNodeCount, getSuccNodes, hasEdge, iterator, nodeString, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeNode, removeNodeAndEdges, removeOutgoingEdges, stream, toString

Modifier and Type	Method	Description
void	addEdge(Integer src, Integer dst)
void	addNode(Integer n)	add a node to this graph
boolean	containsNode(Integer n)
protected String	edgeString(Integer from, Integer to)
int	getNumberOfNodes()
int	getPredNodeCount(Integer n)	Return the number of immediate predecessor nodes of n
Iterator<Integer>	getPredNodes(Integer n)	Return an Iterator over the immediate predecessor nodes of n
int	getSuccNodeCount(Integer n)	Return the number of immediate successor nodes of this Node in the Graph
Iterator<Integer>	getSuccNodes(Integer n)	Return an Iterator over the immediate successor nodes of n
boolean	hasEdge(Integer src, Integer dst)
Iterator<Integer>	iterator()
protected String	nodeString(Integer n, boolean forEdge)
void	removeAllIncidentEdges(Integer node)
void	removeEdge(Integer src, Integer dst)
void	removeIncomingEdges(Integer node)
void	removeNode(Integer n)	remove a node from this graph
void	removeNodeAndEdges(Integer N)	remove a node and all its incident edges
void	removeOutgoingEdges(Integer node)
Stream<Integer>	stream()
String	toString()

Methods inherited from class Object

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

Methods inherited from interface Iterable

forEach, spliterator

Constructor Details

IntegerRandomGraph

public IntegerRandomGraph(int nodes,
 int edges)

Method Details

makeNode

protected Integer makeNode(int i)

Specified by:

makeNode in class RandomGraph<Integer>