API Reference
Table of Contents
Adjacency graphs
Partitions
Markov chains
Proposals
Binary constraints
Updaters
Elections
Grids
To make it easier to play around with GerryChain, we have provided a Grid
class representing a partition of a grid graph. This is especially useful if you want to start experimenting
but do not yet have a clean set of data and geometries to build your graph from.
Spanning tree methods
The recom() proposal function operates on spanning trees of the
adjacency graph in order to generate new contiguous districting plans with balanced population.
The gerrychain.tree submodule exposes some helpful functions for partitioning graphs
using spanning trees methods. These may be used to implement proposal functions or to generate
initial plans for running Markov chains, as described in MGGG’s 2018 Virginia House of Delegates
report.