root.node: Root node
In gecko515/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);

gecko515/HEMDAG documentation built on Oct. 18, 2019, 6:34 a.m.

gecko515/HEMDAG index

README.md

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

Description