Select Graph Endpoints by Core-Eccentricity Geometry
Source:R/geodesic_endpoints.R
geodesic.core.endpoints.RdSelect Graph Endpoints by Core-Eccentricity Geometry
Usage
geodesic.core.endpoints(
adj.list,
length.list,
core.quantile = 0.1,
endpoint.quantile = 0.9,
use.approx.eccentricity = TRUE,
n.landmarks = 64L,
max.endpoints = NULL,
seed = 1L,
verbose = FALSE
)Arguments
- adj.list
Graph adjacency list using 1-based vertex indices.
- length.list
Edge-length list aligned with
adj.list.- core.quantile
Numeric in
(0, 1)defining the low-eccentricity core.- endpoint.quantile
Numeric in
[0, 1]for endpoint candidate scores.- use.approx.eccentricity
Use landmark-based eccentricity approximation.
- n.landmarks
Number of landmarks when approximation is used.
- max.endpoints
Optional positive cap on returned endpoints.
- seed
Integer seed for landmark initialization.
- verbose
Print backend progress.
Examples
graph <- create.graph("chain", n = 8)
endpoints <- geodesic.core.endpoints(graph.adjacency(graph), graph.lengths(graph),
use.approx.eccentricity = FALSE)
endpoints$endpoints
#> [1] 1 8