distances.from.leaves: Distances from leaves
In HEMDAG: Hierarchical Ensemble Methods for Directed Acyclic Graphs
Description
Usage
Arguments
Value
Examples
View source: R/graph.utility.R
Description
Compute the minimum distance of each node from one of the leaves of the graph.
Usage
1
Arguments
g
a graph of class graphNEL. It represents the hierarchy of the classes.
Value
A named vector. The names are the names of the nodes of the graph g, and their values represent the distance from the leaves.
A value equal to 0 is assigned to the leaves, 1 to nodes with distance 1 from a leaf and so on.
Examples
1
2
data(graph);
dist.leaves <- distances.from.leaves(g);
HEMDAG documentation built on Feb. 12, 2021, 5:13 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Value Examples
View source: R/graph.utility.R
Description
Compute the minimum distance of each node from one of the leaves of the graph.
Usage
1 |
Arguments
g |
a graph of class |
Value
A named vector. The names are the names of the nodes of the graph g, and their values represent the distance from the leaves.
A value equal to 0 is assigned to the leaves, 1 to nodes with distance 1 from a leaf and so on.
Examples
1 2 | data(graph);
dist.leaves <- distances.from.leaves(g);
|
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.