Uses of Interface com.ensoftcorp.open.commons.algorithms.UniqueEntryExitGraph

Packages that use UniqueEntryExitGraph
Package Description

com.ensoftcorp.open.commons.algorithms

com.ensoftcorp.open.commons.algorithms.dominance

Uses of UniqueEntryExitGraph in com.ensoftcorp.open.commons.algorithms

Classes in com.ensoftcorp.open.commons.algorithms that implement UniqueEntryExitGraph
Modifier and Type	Class	Description
`class`	`UniqueEntryExitControlFlowGraph`
`class`	`UniqueEntryExitCustomGraph`
`class`	`UniqueEntryExitInterproceduralControlFlowGraph`

Methods in com.ensoftcorp.open.commons.algorithms with parameters of type UniqueEntryExitGraph
Modifier and Type	Method	Description
`static com.ensoftcorp.atlas.core.db.graph.Graph`	DominanceAnalysis.`computeDominance(UniqueEntryExitGraph ucfg)`	Returns a graph of all dominance relationship edges
`static com.ensoftcorp.atlas.core.db.graph.Graph`	DominanceAnalysis.`computeDominanceFrontier(UniqueEntryExitGraph ucfg)`	Returns the dominance frontier
`static com.ensoftcorp.atlas.core.db.graph.Graph`	DominanceAnalysis.`computeDominanceTree(UniqueEntryExitGraph ucfg)`	Returns the immediate dominance tree
`static com.ensoftcorp.atlas.core.db.graph.Graph`	DominanceAnalysis.`computePostDominanceFrontier(UniqueEntryExitGraph ucfg)`	Returns the post-dominance frontier
`static com.ensoftcorp.atlas.core.db.graph.Graph`	DominanceAnalysis.`computePostDominanceTree(UniqueEntryExitGraph ucfg)`	Returns the post dominance graph
`static SandboxGraph`	DominanceAnalysis.`computeSandboxedDominance(Sandbox sandbox, UniqueEntryExitGraph ucfg)`	Returns a graph of all dominance relationship edges
`static SandboxGraph`	DominanceAnalysis.`computeSandboxedDominanceFrontier(Sandbox sandbox, UniqueEntryExitGraph ucfg)`	Returns the dominance frontier (each edge represents a frontier node for a given from node)
`static SandboxGraph`	DominanceAnalysis.`computeSandboxedDominatorTree(Sandbox sandbox, UniqueEntryExitGraph ucfg)`	Returns the immediate dominator tree
`static SandboxGraph`	DominanceAnalysis.`computeSandboxedPostDominanceFrontier(Sandbox sandbox, UniqueEntryExitGraph ucfg)`	Returns the post-dominance frontier (each edge represents a frontier node for a given from node)
`static SandboxGraph`	DominanceAnalysis.`computeSandboxedPostDominatorTree(Sandbox sandbox, UniqueEntryExitGraph ucfg)`	Returns the post dominator tree

Uses of UniqueEntryExitGraph in com.ensoftcorp.open.commons.algorithms.dominance

Constructors in com.ensoftcorp.open.commons.algorithms.dominance with parameters of type UniqueEntryExitGraph
Constructor	Description
`DepthFirstPreorderIterator(UniqueEntryExitGraph graph, com.ensoftcorp.atlas.core.db.graph.Node root)`
`DepthFirstPreorderIterator(UniqueEntryExitGraph graph, com.ensoftcorp.atlas.core.db.set.AtlasSet<com.ensoftcorp.atlas.core.db.graph.Node> roots)`
`DominatorTree(UniqueEntryExitGraph graph)`	Construct a DominatorTree from a root.
`DominatorTree(UniqueEntryExitGraph graph, com.ensoftcorp.atlas.core.db.set.AtlasSet<com.ensoftcorp.atlas.core.db.graph.Node> explicitRoots)`	Construct a DominatorTree from a collection of "roots."
`InvertedDepthFirstPreorderIterator(UniqueEntryExitGraph graph, com.ensoftcorp.atlas.core.db.graph.Node root)`
`InvertedDepthFirstPreorderIterator(UniqueEntryExitGraph graph, com.ensoftcorp.atlas.core.db.set.AtlasSet<com.ensoftcorp.atlas.core.db.graph.Node> roots)`
`PostDominatorTree(UniqueEntryExitGraph graph)`	Construct a DominatorTree from a root.