View source: R/branchmodel_numerical.R
Find a connected component of a directed graph.
1 | get_connected_component(neighbors, start_idx)
|
neighbors |
neighbors directly reachable from each vertex, so there is an edge from 'i' to 'neighbors[i, j]'. (This is built for knn graphs, hence the weird representation.) |
start_idx |
Algorithm starts here and searches outward. |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.