Description Usage Arguments Details Value Examples
Function iterates over graph to identify for a given node all nodes that are exactly k steps apart.
1 | get_kneighbors(adj, start, k = 1L)
|
adj |
numeric matrix specifying the adjacency matrix. |
start |
integer specifying the row index of the start node in the adjacency matrix. |
k |
integer specifying the exact distance to the start node. |
k < 1
will be set to k = 1
.
A numeric vector containing node indices of nodes k
or fewer
steps away from start
.
1 2 3 4 5 6 7 8 | # generate watts strogatz graph
network = grow_ws(n = 100, k = 10, p = .5)
# get neighborhood of second node
get_kneighbors(network, 2)
# get 3-hop neighborhood of second node
get_kneighbors(network, 2, k = 3)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.