and given the node 2 as a reference, there are 4 terminal nodes (6, 9, 11,12).
Is there a simple means of identifying these terminal nodes? I am using
the R-library and can code it directly within R-syntax (brute force but slow). I am wondering if there is a more elegant algorithm or hopefully based on igraph. Looking through the igraph manual, I did not see an obvious solution.
Jae
[Prev in Thread]
Current Thread
[Next in Thread]
[igraph] how to determine unique child nodes in a tree,
Lao Tse<=