Module org.jgrapht.core

Package org.jgrapht.alg.lca

Algorithms for computing lowest common ancestors in graphs.
  • Class Summary 
    Class Description
    BinaryLiftingLCAFinder<V,​E>
    Algorithm for computing lowest common ancestors in rooted trees and forests using the binary lifting method.
    EulerTourRMQLCAFinder<V,​E>
    Algorithm for computing lowest common ancestors in rooted trees and forests based on Berkman, Omer; Vishkin, Uzi (1993), "Recursive Star-Tree Parallel Data Structure", SIAM Journal on Computing, 22 (2): 221–242, doi:10.1137/0222017.
    HeavyPathLCAFinder<V,​E>
    Algorithm for computing lowest common ancestors in rooted trees and forests based on HeavyPathDecomposition.
    NaiveLCAFinder<V,​E>
    Find the Lowest Common Ancestor of a directed graph.
    TarjanLCAFinder<V,​E>
    Tarjan's offline algorithm for computing lowest common ancestors in rooted trees and forests.