 problem (MAUP). In essence, it consists of a heuristic to find the best set of combinations of contiguous spatial units into p regions, minimizing the within sum of squares as a criterion of homogeneity. The number of regions needs to be specified beforehand.</p>
    </div>

    <pre class="usage"><span class='fu'>azp_greedy</span><span class='op'>(</span>
  <span class='va'>p</span>,
  <span class='va'>w</span>,
  <span class='va'>df</span>,
  bound_variable <span class='op'>=</span> <span class='fu'><a h