ancestor.find: Find ancestor nodes for a node in directed acyclic graph.
In hsm: A Path-Based BCD for Proximal Function of Latent Group Lasso
Description
Usage
Arguments
Value
Description
Recursively finds all ancestor nodes in DAG for node with the given index.
Usage
1
ancestor.find(index, map, n.nodes)
Arguments
index
Index of the node currently at.
map
Matrix of n.edges-by-2 dimension, where n.edges
is the number of directed edges in DAG. The first column has indices of
nodes that edges directing from, whereas the second column gives the indices
of nodes the corresponding edges directing towards.
n.nodes
Number of nodes in DAG.
Value
Returns a length-n.nodes vector of binary values for which
1 indicates the corresponding node is an ancestor node and 0 indicates it is not.
hsm documentation built on May 2, 2019, 7:24 a.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
Description
Recursively finds all ancestor nodes in DAG for node with the given index.
Usage
1 | ancestor.find(index, map, n.nodes)
|
Arguments
index |
Index of the node currently at. |
map |
Matrix of |
n.nodes |
Number of nodes in DAG. |
Value
Returns a length-n.nodes vector of binary values for which
1 indicates the corresponding node is an ancestor node and 0 indicates it is not.
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.