find.leaves: Leaves
In HEMDAG: Hierarchical Ensemble Methods for Directed Acyclic Graphs

Find leaves of a directed graph.

1	find.leaves(g)

`g`	a graph of class `graphNEL`. It represents the hierarchy of the classes.

A vector with the names of the leaves of g.

1 2	data(graph); leaves <- find.leaves(g);

HEMDAG documentation built on Feb. 12, 2021, 5:13 p.m.

HEMDAG index

Package overview

Note that we can't provide technical support on individual packages. You should contact the package authors for that.

Description