Package pascal.taie.util.graph

Class MergedSCCGraph<N>

java.lang.Object

pascal.taie.util.graph.MergedSCCGraph<N>

All Implemented Interfaces:

Serializable, Iterable<MergedNode<N>>, Graph<MergedNode<N>>

public class MergedSCCGraph<N>
extends Object
implements Graph<MergedNode<N>>

Represents a merged graph of a directed graph G. Each SCC of G is represented by a merged node of this graph.

See Also:

• MergedNode
• Serialized Form

Constructor Summary

Constructors

Constructor	Description
MergedSCCGraph(Graph<N> graph)

Method Summary

Modifier and Type	Method	Description
Set<MergedNode<N>>	getNodes()
Set<MergedNode<N>>	getPredsOf(MergedNode<N> node)
Set<MergedNode<N>>	getSuccsOf(MergedNode<N> node)

Methods inherited from class java.lang.Object

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

Methods inherited from interface pascal.taie.util.graph.Graph

getInDegreeOf, getInEdgesOf, getNumberOfNodes, getOutDegreeOf, getOutEdgesOf, hasEdge, hasEdge, hasNode, iterator

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Constructor Details

MergedSCCGraph

public MergedSCCGraph(Graph<N> graph)

Method Details

getPredsOf

public Set<MergedNode<N>> getPredsOf(MergedNode<N> node)

Specified by:

getPredsOf in interface Graph<N>

Returns:

the predecessors of given node in this graph.

getSuccsOf

public Set<MergedNode<N>> getSuccsOf(MergedNode<N> node)

Specified by:

getSuccsOf in interface Graph<N>

Returns:

the successors of given node in this graph.

getNodes

public Set<MergedNode<N>> getNodes()

Specified by:

getNodes in interface Graph<N>

Returns:

all nodes of this graph.