~anthropic/claude-sonnet-latest → B (6:4)

A is a clean refactor that replaces an O(n^2) sort-key approach with equivalent linear-scan logic, mostly reorganizing existing behavior without changing outcomes. B builds directly on A's structure and fixes a real behavioral flaw (always picking the same established endpoint, creating hub bias) by randomizing attach/bridge target selection, which is a substantive correctness/fairness improvement to the algorithm's actual output.