Uses of Interface
pascal.taie.util.graph.Graph

Packages that use Graph

Package	Description
pascal.taie.analysis.graph.callgraph	Provides the classes necessary to build and represent a call graph.
pascal.taie.analysis.graph.cfg
pascal.taie.analysis.graph.flowgraph
pascal.taie.analysis.graph.icfg	Provides the classes necessary to represent an inter-procedural control-flow graph (ICFG).
pascal.taie.analysis.pta.core.cs	Provide functionality related to context sensitivity.
pascal.taie.analysis.pta.core.solver	Provide data structures and algorithms of context-sensitive pointer analysis solver.
pascal.taie.analysis.pta.toolkit.util
pascal.taie.config	This package provides functionality for processing options and configurations.
pascal.taie.util.graph

Uses of Graph in pascal.taie.analysis.graph.callgraph

Subinterfaces of Graph in pascal.taie.analysis.graph.callgraph

Modifier and Type	Interface	Description
interface	CallGraph<CallSite,Method>	Representation of call graph.

Classes in pascal.taie.analysis.graph.callgraph that implement Graph

Modifier and Type	Class	Description
class	AbstractCallGraph<CallSite,Method>	Common functionality for CallGraph implementations.
class	DefaultCallGraph	Default implementation of call graph.

Uses of Graph in pascal.taie.analysis.graph.cfg

Subinterfaces of Graph in pascal.taie.analysis.graph.cfg

Modifier and Type	Interface	Description
interface	CFG<N>	Representation of a control-flow graph of a method.

Uses of Graph in pascal.taie.analysis.graph.flowgraph

Classes in pascal.taie.analysis.graph.flowgraph that implement Graph

Modifier and Type	Class	Description
class	ObjectFlowGraph

Methods in pascal.taie.analysis.graph.flowgraph with parameters of type Graph

Modifier and Type	Method	Description
static void	FlowGraphDumper.dump(Graph<Node> graph, File output)

Uses of Graph in pascal.taie.analysis.graph.icfg

Subinterfaces of Graph in pascal.taie.analysis.graph.icfg

Modifier and Type	Interface	Description
interface	ICFG<Method,Node>	Represents an inter-procedural control-flow graph.

Uses of Graph in pascal.taie.analysis.pta.core.cs

Classes in pascal.taie.analysis.pta.core.cs that implement Graph

Modifier and Type	Class	Description
class	CSCallGraph	Represents context-sensitive call graph.

Uses of Graph in pascal.taie.analysis.pta.core.solver

Classes in pascal.taie.analysis.pta.core.solver that implement Graph

Modifier and Type	Class	Description
class	PointerFlowGraph	Represents pointer flow graph in context-sensitive pointer analysis.

Uses of Graph in pascal.taie.analysis.pta.toolkit.util

Methods in pascal.taie.analysis.pta.toolkit.util that return Graph

Modifier and Type	Method	Description
static Graph<Obj>	OAGs.build(PointerAnalysisResultEx pta)	Builds object allocation graph.

Uses of Graph in pascal.taie.config

Methods in pascal.taie.config that return Graph

Modifier and Type	Method	Description
Graph<AnalysisConfig>	Plan.dependenceGraph()	Returns the value of the dependenceGraph record component.

Constructors in pascal.taie.config with parameters of type Graph

Modifier	Constructor	Description
	Plan(List<AnalysisConfig> analyses, Graph<AnalysisConfig> dependenceGraph, Set<String> keepResult)	Creates an instance of a Plan record class.

Uses of Graph in pascal.taie.util.graph

Classes in pascal.taie.util.graph that implement Graph

Modifier and Type	Class	Description
class	MergedSCCGraph<N>	Represents a merged graph of a directed graph G.
class	ReverseGraph<N>	A reverse view of given graph.
class	SimpleGraph<N>	A simple map-based implementation of Graph.

Methods in pascal.taie.util.graph with parameters of type Graph

Modifier and Type	Method	Description
void	DotDumper.dump(Graph<N> graph, File output)

Constructors in pascal.taie.util.graph with parameters of type Graph

Modifier	Constructor	Description
	DominatorFinder(Graph<N> graph)
	DominatorFinder(Graph<N> graph, boolean isSparse)
	DominatorFinder(Graph<N> graph, Indexer<N> indexer, boolean isSparse)	Constructs a dominator finder with a graph and given indexer.
	MergedSCCGraph(Graph<N> graph)
	Reachability(Graph<N> graph)
	ReverseGraph(Graph<N> graph)
	SCC(Graph<N> graph)
	SimpleGraph(Graph<N> graph)	Constructs a new graph containing the same node and edge sets as the specified graph.
	TopologicalSorter(Graph<N> graph)
	TopologicalSorter(Graph<N> graph, boolean reverse)
	TopologicalSorter(Graph<N> graph, List<N> preservedOrder)	Computes a topological soring of a graph, while the client code wishes to preserve some ordering in the sorting result.