Dynamic Modeling of Political Districting Problem
Our model is a dynamic network model to the Political Districting Problem. Firstly, we map counties in the state to points in the County-based Network. Using depth first search (DFS) algorithm and breadth-first search (BFS) algorithm, we guarantee the continuity and compactness of each district. Also we introduce and use grid-based method to divide counties. Finally, we illustrate this model by districting New York State and get such results: the total number of counties to be divided is 17. The average times dividing each county is 0.69. Statistical properties of the model are also studied.