You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
A new constraint interface that is more flexible, user friendly, and consistent
across algorithms (see redist_constr() and ?constraints). For the first time,
user-defined custom constraints are supported and integrated within all three
algorithms.
New diagnostic-checking function, summary.redist_plans()
Summary statistics have been broken out into a new redistmetrics package
This will speed up compilation time and also provides a cleaner, more extensible
interface for the implementation of additional metrics.
Parallel computing support for the SMC algorithm, both within and across sampling runs
Reproducible across-run parallelism throughout the package, via doRNG
Much faster match_numbers() using the Hungarian method
min_move_parity() calculates how much population needs to be moved between
districts in order to completely balance a redistricting plan.
Support for partial SMC simulations, where fewer districts are drawn than the
total number. Allows advanced users to manually combine partial runs to
form complete maps.
Improved algorithm reporting, including new progress bars and cli errors and
warnings throughout the package
Update the SMC algorithm to include a missing correction factor for the number
of ways to sequentially label districts. This factor should not have an effect
on substantive conclusions and summary statistics.