LowestCommonAncestors
flatgraph.algorithm.LowestCommonAncestors
object LowestCommonAncestors
Find the lowest common ancestor(s)
- 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
Attributes
- Graph
-
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
Members list
In this article