initialize_minpatch_data.Rd

% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/data_structures.R
\name{initialize_minpatch_data}
\alias{initialize_minpatch_data}
\title{Initialize MinPatch data structures}
\usage{
initialize_minpatch_data(
  solution,
  planning_units,
  targets,
  costs,
  min_patch_size,
  patch_radius,
  boundary_penalty,
  prioritizr_problem,
  prioritizr_solution,
  verbose = TRUE
)
}
\arguments{
\item{solution}{Binary solution vector}

\item{planning_units}{sf object with planning units}

\item{targets}{data.frame with targets}

\item{costs}{numeric vector of costs}

\item{min_patch_size}{minimum patch size}

\item{patch_radius}{patch radius}

\item{boundary_penalty}{Boundary penalty value}

\item{prioritizr_problem}{A prioritizr problem object}

\item{prioritizr_solution}{A solved prioritizr solution object}

\item{verbose}{Logical, whether to print progress}
}
\value{
List containing all necessary data structures
}
\description{
Creates the internal data structures needed for MinPatch processing.
This function extracts locked-in and locked-out constraints from the
prioritizr problem and applies them as status codes:
- Status 2 (conserved) for locked-in units
- Status 3 (excluded) for locked-out units
}
\keyword{internal}