% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/disco.R
\name{compute_dc_distances}
\alias{compute_dc_distances}
\title{Compute density-connectivity (DC) distances}
\usage{
compute_dc_distances(X, min_points = 5)
}
\arguments{
\item{X}{A numeric matrix of shape \eqn{n \times p}, or a
\code{data.frame} that will be coerced to a matrix.}

\item{min_points}{A positive integer for the core-distance neighbourhood
size.  Default is \code{5}.}
}
\value{
A symmetric \eqn{n \times n} numeric matrix of DC distances.
}
\description{
The main entry point for constructing the DC-distance matrix used throughout
the DISCO metric.  The procedure is:
\enumerate{
  \item Compute mutual-reachability distances
    (\code{\link{calculate_reachability_distance}}).
  \item Build the minimum spanning tree of those distances
    (\code{\link{get_mst_edges}}).
  \item Extract pairwise DC distances as minimax-path weights in the MST
    (\code{\link{extract_dc_distances_from_mst}}).
}
}
\examples{
set.seed(1)
X <- matrix(rnorm(40), ncol = 2)
D <- compute_dc_distances(X, min_points = 5)
dim(D)   # 20 x 20
}
