public recursive subroutine tem_findPath(Path, eligible_child, ElemList, pathlist, nElems, otherLevel)
Recursive routine to find all actual (eligible) leave nodes in the
local partition for a given treeID.
HK: when doing this for the complete domain it would probably better
just compute the ID on the finest level along with the information
on the level of each leaf, in order to speed up things a little.
This way comparison would be just a simple integer comparison.
Nodes of different colours represent the following:
Solid arrows point from a procedure to one which it calls. Dashed
arrows point from an interface to procedures which implement that interface.
This could include the module procedures in a generic interface or the
implementation in a submodule of an interface in a parent module.