Code accompanying paper "Complexity-and-Geometry-of-Sampling-Connected-Graph-Partitions"

Code written by Elle Najt and Daryl DeFord.

Required libraries: gerrychain

Key:

Figure in paper : Code that generated it

Figures 4.2 , 4.3 : grid_chain_sec11.py

Figure 4.4 : KansasDualGraph.py

Figure 4.6 : Frankenstein_chain.py

Figures 4.7, 4.8 : TreeComparison_TopologySensitivity.py