v0.3.1 Release

This release is a small patch that improves the performance of our region-aware method and adds Python 3.12 support

What's Changed

• All spanning trees are now drawn with a minimum spanning tree instead of a maximum spanning tree (if you run old code with the same random seed, this means that you are likely to get different results since the trees will be different)
• Region-aware recom now looks for and deterministically selects for cut edges that bridge regions first before randomly selecting a cut edge.
• Python 3.12 is now officially supported by GerryChain.

Breaking Changes

• The API has changed the usage of weight_dict to region_surcharge across any instance where region-aware is called

Resolved Issues

• #407 Now, bipartition_tree has different behaviour when region-aware recom is used. This method also allows for pair reselection whereas the biparition_tree_random does not have any modifications for region-aware or pair reselection.

Full Changelog: v0.3.0...v0.3.1