Javadoc
Return the set of terminal vertices (leaves) reachable. Only the nodes
which are involved in a relationships which is accepted in the global
configuration will be evaluated. Self-loop are not considered. Therefore
if p is an accepted predicate if a node i is only involved in a
relationship i p i, it will be considered has a leave.
It is important to stress that only nodes involved in the considered
relationships will be considered. Therefore if the RVF is set to
rdfs:subClassOf out all nodes which are not associated to an
rdfs:subClassOf relationship will not be processed (even if they are
associated to rdf:type relationships). This is important for instance if
you use such a method to find all the leaves which are subsumed by a
specific class. In this case if the DAF is not rooted you can have
isolated class (which does not have ancestors or descendants) which are
not considered in the results provided by this method.