{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "01VVP10MWJ"
    }
  ],
  "body": "\n## Summary\n\nA connected component of a graph is a maximal piece in which all vertices are reachable from each other. The components split each graph into connected parts. The node [[connected component|01VVP10MWJ]] gives the precise definition.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "kind": "concept",
    "msc": [
      "05C40"
    ],
    "name": "Connected component",
    "same_as": {
      "wikidata": "Q2997928",
      "wikipedia": "Component (graph theory)"
    },
    "sources": [
      {
        "locator": "Definitions and examples",
        "url": "https://en.wikipedia.org/wiki/Component_(graph_theory)"
      }
    ],
    "tag": "0JG9W3KA6B"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/0JG9W3KA6B/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/0JG9W3KA6B.md",
  "msc": [
    "05C40"
  ],
  "name": "Connected component",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0JG/0JG9W3KA6B.md",
  "status": null,
  "tag": "0JG9W3KA6B",
  "uri": "m2://0JG9W3KA6B",
  "url": "https://math2.tamnd.com/wiki/connected-component/",
  "writing": {
    "tag": "0JG9W3KA6B",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}
