Graph diffusion using nearest neighbors
For every node in a set of nodes the graph gets traversed along
the node's shortest paths to its neighbors. Nearest neighbors are added
until a maximum depth of
k is reached. For settings where there are more
k neighbors having the same distance, all neighbors are returned.
nearest.neighbors(nodes, graph, k = 1L, ...)
the depth of the nearest neighbor search, e.g. the depth of the graph traversal
returns the kNN nodes as list of integer vectors of node indexes
Simon Dirmeier, email@example.com
1 2 3 4 5 6 7 8
Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.