% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/grip_quality.R
\name{prepare.graph.geodesic.mds}
\alias{prepare.graph.geodesic.mds}
\title{Prepare a graph-first geodesic-MDS path cache}
\usage{
prepare.graph.geodesic.mds(
  edges = NULL,
  n = NULL,
  adj_list = NULL,
  weight_list = NULL,
  edge_weights = NULL,
  tie_mode = c("single", "average")
)
}
\arguments{
\item{edges}{Two-column integer matrix of edges (1-based vertex ids).}

\item{n}{Number of vertices. If omitted with \code{adj_list}, defaults to
\code{length(adj_list)}. If omitted with \code{edges}, defaults to
\code{max(edges)}.}

\item{adj_list}{Adjacency list (1-based) for an undirected graph.}

\item{weight_list}{Optional parallel list of positive edge weights.}

\item{edge_weights}{Optional positive edge-weight vector parallel to
\code{edges}.}

\item{tie_mode}{Shortest-path aggregation mode. \code{"single"} uses one
deterministic chosen shortest path per pair. \code{"average"} replaces
each tied shortest-path family by the exact uniform average over all
shortest paths between the pair.}
}
\value{
A prepared object with class \code{"grip_gmds_prepared"} layered on
  top of the existing full geodesic path-cache structure.
}
\description{
\code{prepare.graph.geodesic.mds()} prepares the full all-pairs chosen
geodesic cache for an arbitrary connected weighted graph. This is the
graph-first entry point corresponding to the manuscript's definition of GMDS
on a connected weighted graph together with a chosen geodesic family
\eqn{(G, \Gamma)}.
}
\details{
The graph can be supplied either as an edge list plus parallel weights or as
an adjacency-list representation. The returned object stores the all-pairs
graph distances, the chosen shortest-path family, and the flattened edge-path
cache reused by the GMDS scorer and optimizer.
}
