public class DJGraph extends Object
| Modifier and Type | Method and Description |
|---|---|
int |
classOf(int node) |
int[] |
classRepresentatives(int node) |
int |
collapse(int[] nodes) |
MutableDirectedGraph |
getCfg() |
DominatorTree |
getDomTree() |
Graph |
getGraph() |
boolean |
isAncestorInSpanningTree(int anc,
int node) |
boolean |
isBackJoin(int i,
int j) |
boolean |
isCrossJoin(int i,
int j) |
boolean |
isDomEdge(int i,
int j) |
boolean |
isJoinEdge(int i,
int j) |
boolean |
isSpanningBack(int i,
int j) |
boolean |
isSpanningCross(int i,
int j) |
int[] |
level(int level) |
int |
levelCount() |
int |
levelOf(int node) |
int |
weightOf(int... nodes) |
int |
weightOf(int node) |
public DJGraph(Graph src, int[] weight)
public DominatorTree getDomTree()
public MutableDirectedGraph getCfg()
public Graph getGraph()
public boolean isAncestorInSpanningTree(int anc,
int node)
public boolean isDomEdge(int i,
int j)
public boolean isJoinEdge(int i,
int j)
public boolean isBackJoin(int i,
int j)
public boolean isCrossJoin(int i,
int j)
public boolean isSpanningBack(int i,
int j)
public boolean isSpanningCross(int i,
int j)
public int weightOf(int node)
public int weightOf(int... nodes)
public int levelOf(int node)
public int[] level(int level)
public int levelCount()
public int[] classRepresentatives(int node)
public int classOf(int node)
public int collapse(int[] nodes)
Copyright © 2015. All rights reserved.