Package  Description 

org.jgrapht.alg.lca 
Algorithms for computing lowest common ancestors in graphs.

Modifier and Type  Class and Description 

class 
BinaryLiftingLCAFinder<V,E>
Algorithm for computing lowest common ancestors in rooted trees and forests using the binary
lifting method.

class 
EulerTourRMQLCAFinder<V,E>
Algorithm for computing lowest common ancestors in rooted trees and forests based on Berkman,
Omer; Vishkin, Uzi (1993), "Recursive StarTree Parallel Data Structure", SIAM Journal on
Computing, 22 (2): 221–242, doi:10.1137/0222017.

class 
HeavyPathLCAFinder<V,E>
Algorithm for computing lowest common ancestors in rooted trees and forests based on
HeavyPathDecomposition . 
class 
NaiveLCAFinder<V,E>
Find the Lowest Common Ancestor of a directed graph.

class 
TarjanLCAFinder<V,E>
Tarjan's offline algorithm for computing lowest common ancestors in rooted trees and forests.

Copyright © 2019. All rights reserved.