Open alecramsay opened 11 months ago
When we color one map, we find the district-district adjacencies in that map and color accordingly. If we want to color a bunch of maps consistently, then we simply need to find the union of all the adjacencies in the collection, and then color based on that set of adjacencies.
Given a set of canonicalized maps, figure out colors for districts so each of the maps is legible.
(Initially, we'll just color each map separately -- #49 -- so while each map will be legible, the color assignments for districts might differ map to map in the set.)