soot.toolkits.graph

Class HashReversibleGraph<N>

java.lang.Object

soot.toolkits.graph.HashMutableDirectedGraph<N>

soot.toolkits.graph.HashReversibleGraph<N>

Type Parameters:

N -

All Implemented Interfaces:

Iterable<N>, DirectedGraph<N>, MutableDirectedGraph<N>, ReversibleGraph<N>

public class HashReversibleGraph<N>
extends HashMutableDirectedGraph<N>
implements ReversibleGraph<N>

A reversible version of HashMutableDirectedGraph

Author:

Navindra Umanee

Field Summary

Fields

Modifier and Type	Field and Description
protected boolean	reversed

Fields inherited from class soot.toolkits.graph.HashMutableDirectedGraph

heads, nodeToPreds, nodeToSuccs, tails

Constructor Summary

Constructors

Constructor and Description
HashReversibleGraph()
HashReversibleGraph(DirectedGraph<N> dg)

Method Summary

Modifier and Type	Method and Description
void	addEdge(N from, N to) Adds an edge to the graph between 2 nodes.
boolean	containsEdge(N from, N to)
List<N>	getHeads() Returns a list of entry points for this graph.
List<N>	getPredsOf(N s) Returns a list of predecessors for the given node in the graph.
List<N>	getSuccsOf(N s) Returns a list of successors for the given node in the graph.
List<N>	getTails() Returns a list of exit points for this graph.
boolean	isReversed() Returns true if the graph is now reversed from its original state at creation.
void	removeEdge(N from, N to) Removes an edge between 2 nodes in the graph.
ReversibleGraph<N>	reverse() Reverse the edges of the current graph and swap head and tail nodes.

Methods inherited from class soot.toolkits.graph.HashMutableDirectedGraph

addNode, clearAll, clone, containsNode, getNodes, getPredsOfAsSet, getSuccsOfAsSet, iterator, printGraph, removeNode, size

Methods inherited from class java.lang.Object

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

Methods inherited from interface soot.toolkits.graph.MutableDirectedGraph

addNode, containsNode, getNodes, removeNode

Methods inherited from interface soot.toolkits.graph.DirectedGraph

iterator, size

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Field Detail

reversed

protected boolean reversed

Constructor Detail

HashReversibleGraph

public HashReversibleGraph(DirectedGraph<N> dg)

HashReversibleGraph

public HashReversibleGraph()

Method Detail

isReversed

public boolean isReversed()

Description copied from interface: ReversibleGraph

Returns true if the graph is now reversed from its original state at creation.

Specified by:

isReversed in interface ReversibleGraph<N>

reverse

public ReversibleGraph<N> reverse()

Description copied from interface: ReversibleGraph

Reverse the edges of the current graph and swap head and tail nodes. Returns self.

Specified by:

reverse in interface ReversibleGraph<N>

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.

containsEdge

public boolean containsEdge(N from,
                            N to)

Specified by:

containsEdge in interface MutableDirectedGraph<N>

Overrides:

containsEdge in class HashMutableDirectedGraph<N>

Returns:

true if the graph contains an edge the 2 nodes false otherwise.

getHeads

public List<N> getHeads()

Description copied from interface: DirectedGraph

Returns a list of entry points for this graph.

Specified by:

getHeads in interface DirectedGraph<N>

Overrides:

getHeads in class HashMutableDirectedGraph<N>

getTails

public List<N> getTails()

Description copied from interface: DirectedGraph

Returns a list of exit points for this graph.

Specified by:

getTails in interface DirectedGraph<N>

Overrides:

getTails in class HashMutableDirectedGraph<N>

getPredsOf

public List<N> getPredsOf(N s)

Description copied from interface: DirectedGraph

Returns a list of predecessors for the given node in the graph.

Specified by:

getPredsOf in interface DirectedGraph<N>

Overrides:

getPredsOf in class HashMutableDirectedGraph<N>

getSuccsOf

public List<N> getSuccsOf(N s)

Description copied from interface: DirectedGraph

Returns a list of successors for the given node in the graph.

Specified by:

getSuccsOf in interface DirectedGraph<N>

Overrides:

getSuccsOf in class HashMutableDirectedGraph<N>