get.all.nodes.by.depth:
Getting nodes by their depth
Description
Grouping classes by level in a given hierarchy.
Usage
get.all.nodes.by.depth(g, root = "00")
Arguments
g
graph of the classes (object of class graphNEL, package graph).
root
name of the root node (def. 00)
Value
a list of the nodes, grouped w.r.t. the distance from the root.
The first element of the list corresponds to the nodes at distance 1,
the second to nodes at distance 2 and so on.
Details
The minimum paths between the “root” and all the other classes/nodes are computed. Levels are numbered from 1 in increasing order by their distance from the “root” class.