pub fn min_cost_assignment<C: AssignmentCost>(
costs: &CostMatrix<C>,
policy: AssignmentPolicy<C>,
) -> Result<Assignment<C>, GraphError>Expand description
Finds a minimum-cost assignment under insertion, deletion, doubling, and voice-crossing rules.
Ties are stable: the unrestricted solver uses canonical source/target edge order, while the no-crossing solver prefers a shorter match span, then deletion, then insertion at each equal-cost suffix.