memnet (version 0.1.0)

get_neighborhood: Get neighbors k or fewer steps away

Description

Function iterates over graph to identify for a given node all nodes that are no more than k steps apart.

Usage

get_neighborhood(adj, start, k = 1L)

Arguments

adj

numeric matrix specifying the adjacency matrix.

start

integer specifying the row of the start node in the adjacency matrix.

k

integer specifying the maximum distance to the start node.

Value

A numeric matrix of two columns containing nodes indices and the geodesic distance to the start nodes of all nodes k or fewer steps away from start.

Details

k < 1 will be set to k = 1.

Examples

# NOT RUN {
# generate watts strogatz graph
network = grow_ws(n = 100, k = 10, p = .5)

# get neighborhood of second node
get_neighborhood(network, 2)

# get 3-hop neighborhood of second node
get_neighborhood(network, 2, k = 3)

# }