{
  "checks_passed": 47599,
  "exhaustive_multigraphs": 11895,
  "oracle_single_edge_deletions": 94309,
  "parallel_example": {
    "edges": [
      [
        0,
        1
      ],
      [
        0,
        1
      ],
      [
        1,
        2
      ]
    ],
    "bridge_ids": [
      2
    ],
    "tin": [
      0,
      1,
      2
    ],
    "low": [
      0,
      0,
      2
    ],
    "roots": [
      0
    ],
    "tree_checks": [
      {
        "edge_id": 2,
        "parent": 1,
        "child": 2,
        "tin_parent": 1,
        "low_child": 2,
        "bridge": true
      },
      {
        "edge_id": 0,
        "parent": 0,
        "child": 1,
        "tin_parent": 0,
        "low_child": 0,
        "bridge": false
      }
    ],
    "bad_parent_vertex_ids": [
      0,
      2
    ]
  },
  "disconnected_bridge_ids": [
    3
  ],
  "disconnected_roots": [
    0,
    3,
    5
  ],
  "maximum_path_vertices_checked": 128,
  "invalid_inputs_rejected": 12,
  "scope": "static undirected graph; delete one edge ID at a time; no dynamic maintenance"
}
