"""Common capacity-constrained search for all O1 arms; no post-cut remapping. Dual offsets target equal transported mass on fixed seed-to-node graph distances. Indivisible nodes can prevent exact equality; ONLY outputs passing hard +/-5% volume bounds and connectivity are feasible. Failure is reported, never repaired by remapping edge costs after obtaining a partition. """ import argparse import hashlib import json from pathlib import Path import resource import time import numpy as np from scipy.optimize import minimize from scipy.sparse.csgraph import dijkstra if __package__: from .route_feasibility import graph_from_edges,partition_report,matched_acceptance from .review_partition_scale import histogram_control else: from route_feasibility import graph_from_edges,partition_report,matched_acceptance from review_partition_scale import histogram_control class FeasibleFound(Exception):pass def capacity_assignment(distances,mass,bound=.05,maxiter=300): k,n=distances.shape;target=mass.sum()/k;normalized_mass=mass/target if not np.isfinite(distances).all():raise ValueError('Unreachable node') scale=float(np.median(distances[distances>0]));cost=distances/scale evaluations=0;best=None;last=None def objective(free): nonlocal evaluations,best,last offsets=np.r_[0.,free];score=cost+offsets[:,None];labels=np.argmin(score,axis=0) volume=np.bincount(labels,weights=normalized_mass,minlength=k);violation=float(abs(volume-1).max()) value=float(offsets.sum()-np.dot(normalized_mass,score[labels,np.arange(n)])) evaluations+=1 candidate=dict(labels=labels.copy(),offsets=offsets.copy(),volume_ratios=volume.copy(),violation=violation,dual_objective=value) if best is None or violation