A protoclust object has a prototype associated with each interior node. Every element being clustered occurs at least as a leaf but might also appear multiple times as a prototype. This function finds for each element the path from the root to the highest occurrence of that element. The path is specified by a series of 0s and 1s, where 0 means "go left" and 1 means "go right".
find_elements(hc)a protoclust object
a list of length n giving, for each element, the path from root to its highest occurrence. A 0 means go left, a 1 means go right.
a list of length n - 1 giving, for each interior node, the path from root to it. A 0 means go left, a 1 means go right.