get_sdist: Estimate all shortest distance between nodes using weights

In OscarGOGO/Makurhini: Makurhini: Analyzing landscape connectivity

Estimate all shortest distance between nodes using weights

Description

Estimate all shortest distance between nodes using weights

Usage

get_sdist(
  dist_nodes = NULL,
  graph_nodes = NULL,
  attr_nodes = NULL,
  metric = NULL,
  probability = NULL,
  distance_threshold = NULL,
  igraph_Dijkstra = FALSE,
  parallel = NULL,
  loop = TRUE,
  G1 = 1000,
  min_nodes = 2000,
  return_graph = FALSE,
  intern = TRUE
)

Arguments

dist_nodes	matrix distance or pairwise data.frame distance
attr_nodes	numeric. Nodes attribute
metric	character. 'PC' or 'IIC'
probability	numeric
distance_threshold	numeric
igraph_Dijkstra	logical. Use or not igraph to implement the Dijkstra Algorithm
parallel	numeric
loop	logical
G1	numeric
min_nodes	numeric
intern	logical

OscarGOGO/Makurhini documentation built on Jan. 9, 2025, 1:20 p.m.