Packages

o

overflowdb.algorithm

LowestCommonAncestors

object LowestCommonAncestors

Find the lowest common ancestor(s)

1) for each relevant node, find their recursive parents 2) create the intersection of all of those sets 3) the LCA are those nodes, that do not have any children in that set

based on https://www.baeldung.com/cs/lowest-common-ancestor-acyclic-graph

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LowestCommonAncestors
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Value Members

  1. def apply[A](nodes: Set[A])(parents: (A) => Set[A]): Set[A]