longest-path.iterative — twotree.longest-path 0.1.2

longest-path-length clj

(longest-path-length tree)

Computes the length of the longest path in the 2-tree

max2DistinctFolios clj macro

(max2DistinctFolios a b k)

Computes 𝑚𝑎𝑥⁡{𝑎[𝑖]+𝑏[𝑗] | 𝑖≠𝑗} in O(k) time

max3DistinctFolios clj

(max3DistinctFolios as bs cs k)

Computes 𝑚𝑎𝑥⁡{𝑎[𝑖]+𝑏[𝑗]+𝑐[𝑡] | 𝑖≠𝑗≠𝑡≠𝑖} in O(k) time