{
  "checks_passed": 5119,
  "exhaustive_small_graphs": 729,
  "vertices": {
    "0": "A",
    "1": "B",
    "2": "C"
  },
  "available_edges": [
    [
      0,
      1,
      2
    ],
    [
      1,
      2,
      3
    ],
    [
      0,
      2,
      4
    ]
  ],
  "minimum_spanning_tree": {
    "edges": [
      [
        0,
        1,
        2
      ],
      [
        1,
        2,
        3
      ]
    ],
    "total_cost": 5,
    "distances_from_A": [
      0,
      2,
      5
    ]
  },
  "shortest_path_tree_from_A": {
    "edges": [
      [
        0,
        1,
        2
      ],
      [
        0,
        2,
        4
      ]
    ],
    "total_cost": 6,
    "distances_from_A": [
      0,
      2,
      4
    ]
  },
  "isolated_D_distances": [
    0,
    2,
    4,
    null
  ],
  "scope": "positive integer undirected simple graphs; construction cost differs from path cost"
}
