soot.toolkits.graph

Class MemoryEfficientGraph<N>

java.lang.Object

soot.toolkits.graph.HashMutableDirectedGraph<N>

soot.toolkits.graph.MemoryEfficientGraph<N>

All Implemented Interfaces:

java.lang.Iterable<N>, DirectedGraph<N>, MutableDirectedGraph<N>

public class MemoryEfficientGraph<N>
extends HashMutableDirectedGraph<N>

A memory efficient version of HashMutableDirectedGraph, in the sense that throw-away objects passed as arguments will not be kept in the process of adding edges.

Field Summary

Fields inherited from class soot.toolkits.graph.HashMutableDirectedGraph

heads, nodeToPreds, nodeToSuccs, tails

Constructor Summary

Constructors

Constructor and Description
MemoryEfficientGraph()

Method Summary

Methods

Modifier and Type	Method and Description
void	addEdge(N from, N to) Adds an edge to the graph between 2 nodes.
void	addNode(N o) Adds a node to the graph.
void	removeEdge(N from, N to) Removes an edge between 2 nodes in the graph.
void	removeNode(N o) Removes a node from the graph.

Methods inherited from class soot.toolkits.graph.HashMutableDirectedGraph

clearAll, clone, containsEdge, containsNode, getHeads, getNodes, getPredsOf, getPredsOfAsSet, getSuccsOf, getSuccsOfAsSet, getTails, iterator, printGraph, size

Methods inherited from class java.lang.Object

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

Constructor Detail

MemoryEfficientGraph

public MemoryEfficientGraph()

Method Detail

addNode

public void addNode(N o)

Description copied from interface: MutableDirectedGraph

Adds a node to the graph. Initially the added node has no successors or predecessors. ; as a consequence it is considered both a head and tail for the graph.

Specified by:

addNode in interface MutableDirectedGraph<N>

Overrides:

addNode in class HashMutableDirectedGraph<N>

Parameters:

o - a node to add to the graph.

See Also:

DirectedGraph.getHeads(), DirectedGraph.getTails()

removeNode

public void removeNode(N o)

Description copied from interface: MutableDirectedGraph

Removes a node from the graph. If the node is not found in the graph, no change is made.

Specified by:

removeNode in interface MutableDirectedGraph<N>

Overrides:

removeNode in class HashMutableDirectedGraph<N>

Parameters:

o - the node to be removed.

addEdge

public void addEdge(N from,
           N to)

Description copied from interface: MutableDirectedGraph

Adds an edge to the graph between 2 nodes. If the edge is already present no change is made.

Specified by:

addEdge in interface MutableDirectedGraph<N>

Overrides:

addEdge in class HashMutableDirectedGraph<N>

Parameters:

from - out node for the edge.

to - in node for the edge.

removeEdge

public void removeEdge(N from,
              N to)

Description copied from interface: MutableDirectedGraph

Removes an edge between 2 nodes in the graph. If the edge is not present no change is made.

Specified by:

removeEdge in interface MutableDirectedGraph<N>

Overrides:

removeEdge in class HashMutableDirectedGraph<N>

Parameters:

from - out node for the edge to remove.

to - in node for the edge to remove.