% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/disco.R
\name{get_mst_edges}
\alias{get_mst_edges}
\title{Compute a minimum spanning tree via Prim's algorithm}
\usage{
get_mst_edges(dist_matrix)
}
\arguments{
\item{dist_matrix}{A symmetric \eqn{n \times n} numeric distance matrix.}
}
\value{
A \code{data.frame} with \eqn{n-1} rows and three columns:
  \describe{
    \item{i}{Integer index of the first endpoint (1-based).}
    \item{j}{Integer index of the second endpoint (1-based).}
    \item{dist}{Edge weight.}
  }
}
\description{
Implements Prim's algorithm exactly as in the reference Python code
(\code{dctree.py}, lines 401–438), operating on a precomputed distance
matrix.
}
\keyword{internal}
