get_mst_edges: Compute a minimum spanning tree via Prim's algorithm
In discoCVI: Implementation of the DISCO Metric for Internal Clustering Evaluation
get_mst_edges R Documentation
Compute a minimum spanning tree via Prim's algorithm
Description
Implements Prim's algorithm exactly as in the reference Python code
(dctree.py, lines 401–438), operating on a precomputed distance
matrix.
Usage
get_mst_edges(dist_matrix)
Arguments
dist_matrix
A symmetric n \times n numeric distance matrix.
Value
A data.frame with n-1 rows and three columns:
- i
Integer index of the first endpoint (1-based).
- j
Integer index of the second endpoint (1-based).
- dist
Edge weight.
discoCVI documentation built on Oct. 28, 2026, 1:07 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
| get_mst_edges | R Documentation |
Compute a minimum spanning tree via Prim's algorithm
Description
Implements Prim's algorithm exactly as in the reference Python code
(dctree.py, lines 401–438), operating on a precomputed distance
matrix.
Usage
get_mst_edges(dist_matrix)
Arguments
dist_matrix |
A symmetric |
Value
A data.frame with n-1 rows and three columns:
- i
Integer index of the first endpoint (1-based).
- j
Integer index of the second endpoint (1-based).
- dist
Edge weight.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.