R: Get nearest neighbors method on graph

get_nearest_neighbors {sccore} | R Documentation

## Get nearest neighbors method on graph

### Description

Get nearest neighbors method on graph

### Usage

    get_nearest_neighbors(
      adjacency_list,
      transition_probabilities,
      n_verts = 0L,
      n_cores = 1L,
      min_prob = 0.001,
      min_visited_verts = 1000L,
      min_prob_lower = 1e-05,
      max_hitting_nn_num = 0L,
      max_commute_nn_num = 0L,
      verbose = TRUE
    )

### Arguments

`adjacency_list` | igraph adjacency list
`transition_probabilities` | vector of transition probabilites
`n_verts` | numeric Number of vertices (default=0)
`n_cores` | numeric Number of cores to use (default=1)
`min_prob` | numeric Minimum probability for proximity when calculating hitting time per neighbors (default=1e-3)
`min_visited_verts` | numeric Minimum number of vertices visted when calculating hitting time per neighbors (default=1000)
`min_prob_lower` | numeric Probability threshold to continue iteration in depth first search hitting time, dfs_hitting_time() (default=1e-5)
`max_hitting_nn_num` | numeric Maximum adjacencies for calculating hitting time per neighbor, hitting_time_per_neighbors() (default=0)
`max_commute_nn_num` | numeric Maximum adjacencies for calculating commute time per neighbor, commute_time_per_node() (default=0)
`verbose` | boolean Whether to have verbose output (default=TRUE)

### Value

list of commute times based on adjacencies

[Package sccore version 1.0.1 Index]