ReversibleGraph (Soot - a J*va Optimization Framework 4.6.0 API)

Type Parameters:

N -

All Superinterfaces:

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

All Known Implementing Classes:

HashReversibleGraph
```
public interface ReversibleGraph<N>
extends MutableDirectedGraph<N>
```
DirectedGraph which can be reversed and re-reversed.

Author:

Navindra Umanee

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method	Description
`boolean`	`isReversed()`	Returns true if the graph is now reversed from its original state at creation.
`ReversibleGraph<N>`	`reverse()`	Reverse the edges of the current graph and swap head and tail nodes.

Methods inherited from interface soot.toolkits.graph.DirectedGraph
getHeads, getPredsOf, getSuccsOf, getTails, iterator, size

Methods inherited from interface java.lang.Iterable
forEach, spliterator

Methods inherited from interface soot.toolkits.graph.MutableDirectedGraph
addEdge, addNode, containsEdge, containsNode, getNodes, removeEdge, removeNode

- Method Detail
  - isReversed
```
boolean isReversed()
```
    Returns true if the graph is now reversed from its original state at creation.
  - reverse
```
ReversibleGraph<N> reverse()
```
    Reverse the edges of the current graph and swap head and tail nodes. Returns self.