root.node: Root node
In HEMDAG: Hierarchical Ensemble Methods for Directed Acyclic Graphs

Find the root node of a directed graph.

1	root.node(g)

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

Name of the root node.

1 2	data(graph); root <- root.node(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