Package org.teavm.common

Class GraphUtils

java.lang.Object

org.teavm.common.GraphUtils

public final class GraphUtils
extends java.lang.Object

Method Summary

Modifier and Type	Method	Description
static Graph	buildDominatorGraph(DominatorTree domTree, int sz)
static DominatorTree	buildDominatorTree(Graph graph)
static DominatorTree	buildDominatorTree(Graph graph, int start)
static int[]	dfs(Graph graph)
static int[]	findBackEdges(Graph graph)
static int[][]	findDominanceFrontiers(Graph cfg, DominatorTree domTree)
static int[][]	findStronglyConnectedComponents(Graph graph)
static boolean	isIrreducible(Graph graph)
static java.lang.String	printToDot(Graph graph)
static Graph	removeLoops(Graph graph)
static void	splitIrreducibleGraph(Graph graph, int[] weights, GraphSplittingBackend backend)
static Graph	subgraph(Graph graph, java.util.function.IntPredicate filter)

Methods inherited from class java.lang.Object

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

Method Detail

findBackEdges

public static int[] findBackEdges(Graph graph)

removeLoops

public static Graph removeLoops(Graph graph)

isIrreducible

public static boolean isIrreducible(Graph graph)

subgraph

public static Graph subgraph(Graph graph,
                             java.util.function.IntPredicate filter)

findStronglyConnectedComponents

public static int[][] findStronglyConnectedComponents(Graph graph)

buildDominatorTree

public static DominatorTree buildDominatorTree(Graph graph)

buildDominatorTree

public static DominatorTree buildDominatorTree(Graph graph,
                                               int start)

buildDominatorGraph

public static Graph buildDominatorGraph(DominatorTree domTree,
                                        int sz)

dfs

public static int[] dfs(Graph graph)

splitIrreducibleGraph

public static void splitIrreducibleGraph(Graph graph,
                                         int[] weights,
                                         GraphSplittingBackend backend)

findDominanceFrontiers

public static int[][] findDominanceFrontiers(Graph cfg,
                                             DominatorTree domTree)

printToDot

public static java.lang.String printToDot(Graph graph)