Algorithms for computing lowest common ancestors in graphs.
-
class
Algorithm for computing lowest common ancestors in rooted trees and forests using the binary
lifting method.
class
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.
class
class
Find the Lowest Common Ancestor of a directed graph.
class
Tarjan's offline algorithm for computing lowest common ancestors in rooted trees and forests.