Modifier and Type | Field and Description |
---|---|
protected DirectedGraph |
AlgoAllDiffAC.digraph |
Modifier and Type | Field and Description |
---|---|
protected DirectedGraph |
PropCircuit_ArboFiltering.connectedGraph |
Modifier and Type | Method and Description |
---|---|
static int[] |
GraphTools.performDFS(int root,
DirectedGraph graph)
perform a dfs in graph.
|
Constructor and Description |
---|
StrongConnectivityFinder(DirectedGraph graph) |
Modifier and Type | Field and Description |
---|---|
protected DirectedGraph |
AbstractLengauerTarjanDominatorsFinder.g |
protected DirectedGraph |
AbstractLengauerTarjanDominatorsFinder.T |
Modifier and Type | Method and Description |
---|---|
DirectedGraph |
AbstractLengauerTarjanDominatorsFinder.getDominatorTree()
Get the dominator tree formed with arcs (x,y)
such that x is the immediate dominator of y
|
Modifier and Type | Method and Description |
---|---|
void |
LCAGraphManager.preprocess(int r,
DirectedGraph g) |
Constructor and Description |
---|
AbstractLengauerTarjanDominatorsFinder(int s,
DirectedGraph g)
Object that finds dominators of the given flow graph g(s)
|
AlphaDominatorsFinder(int s,
DirectedGraph g)
Object that finds dominators of the given flow graph g(s)
It uses the LT algorithm which runs in O(alpha.m)
|
SimpleDominatorsFinder(int s,
DirectedGraph g)
Object that finds dominators of the given flow graph g(s)
It uses the simple LT algorithm which runs in O(m.log(n))
|
Copyright © 2015. All rights reserved.