Package org.teavm.common
Class GraphUtils
java.lang.Object
org.teavm.common.GraphUtils
-
Method Summary
Modifier and TypeMethodDescriptionstatic Graph
buildDominatorGraph(DominatorTree domTree, int sz)
static DominatorTree
buildDominatorTree(Graph graph)
static DominatorTree
buildDominatorTree(Graph graph, int start)
static int[]
static int[]
findBackEdges(Graph graph)
static int[][]
findDominanceFrontiers(Graph cfg, DominatorTree domTree)
static int[][]
findStronglyConnectedComponents(Graph graph)
static boolean
isIrreducible(Graph graph)
static String
printToDot(Graph graph)
static Graph
removeLoops(Graph graph)
static void
splitIrreducibleGraph(Graph graph, int[] weights, GraphSplittingBackend backend)
static Graph
subgraph(Graph graph, IntPredicate filter)
-
Method Details
-
findBackEdges
-
removeLoops
-
isIrreducible
-
subgraph
-
findStronglyConnectedComponents
-
buildDominatorTree
-
buildDominatorTree
-
buildDominatorGraph
-
dfs
-
splitIrreducibleGraph
public static void splitIrreducibleGraph(Graph graph, int[] weights, GraphSplittingBackend backend) -
findDominanceFrontiers
-
printToDot
-