| Class | Description |
|---|---|
| AbstractLengauerTarjanDominatorsFinder |
Class that finds dominators of a given flow graph g(s)
|
| AlphaDominatorsFinder |
Class that finds dominators of a given flow graph g(s)
Uses the LT algorithm which runs in O(alpha.m)
|
| BitOperations |
Class containing some Bit operations useful to LCA queries
|
| LCAGraphManager |
Class enabling to compute LCA queries in constant time over the DFS tree of a given graph
use a O(n+m) time preprocessing
|
| SimpleDominatorsFinder |
Class that finds dominators of a given flow graph g(s)
Uses the simple LT algorithm which runs in O(m.log(n))
Fast in practice
|
Copyright © 2015. All rights reserved.