prepare.edge.kk() validates an undirected weighted graph and
returns the lightweight prepared object used by
edge.kk() when only graph-edge targets are
needed. Unlike prepare.graph.geodesic.mds(), this helper
does not compute all-pairs shortest paths, path caches, or a dense graph
distance matrix.
Usage
prepare.edge.kk(
edges = NULL,
n = NULL,
adj_list = NULL,
weight_list = NULL,
edge_weights = NULL
)Arguments
- edges
Two-column integer matrix of edges (1-based vertex ids).
- n
Number of vertices. If omitted with
adj_list, defaults tolength(adj_list). If omitted withedges, defaults tomax(edges).- adj_list
Adjacency list (1-based) for an undirected graph.
- weight_list
Optional parallel list of positive edge weights.
- edge_weights
Optional positive edge-weight vector parallel to
edges.
Value
A lightweight prepared object of class
"grip_edge_kk_prepared" layered on the common
"grip_gmds_prepared" graph class. It contains canonical graph
edges and edge targets but no all-pairs geodesic cache.
Details
Use this helper when a starting layout is already available, for example from
weighted.grip(), and the next step is scalable edge-KK
local repair. Edge-only objects support edge-fidelity diagnostics through
score.gmds(); all-pairs GMDS path and chord
diagnostics are unavailable and are reported as NA.