2024-10-27 21:42:45 +00:00
|
|
|
# Copyright (C) 2024 Manuel Bustillo
|
|
|
|
|
|
2024-12-28 18:37:47 +01:00
|
|
|
# frozen_string_literal: true
|
|
|
|
|
|
2024-07-30 20:49:26 +02:00
|
|
|
module TreeNodeExtension
|
|
|
|
|
def distance_to_common_ancestor(another_node)
|
|
|
|
|
return 0 if self == another_node
|
|
|
|
|
|
|
|
|
|
my_path = path_as_array
|
|
|
|
|
another_path = another_node.path_as_array
|
|
|
|
|
|
|
|
|
|
common_elements = my_path.zip(another_path)
|
|
|
|
|
.take_while { |(p1, p2)| p1 == p2 }
|
|
|
|
|
.count
|
|
|
|
|
|
|
|
|
|
return nil if common_elements.zero?
|
|
|
|
|
|
|
|
|
|
[my_path.count, another_path.count].max - common_elements
|
|
|
|
|
end
|
|
|
|
|
end
|
|
|
|
|
|
|
|
|
|
Tree::TreeNode.include(TreeNodeExtension)
|
