{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "0J8XE7W68F"
    }
  ],
  "body": "\n## Summary\n\nReachability says which vertices of a graph can be joined by a walk. It is an equivalence relation, and its classes are the connected components. The node [[reachability|0J8XE7W68F]] gives the precise definition.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "kind": "concept",
    "msc": [
      "05C40"
    ],
    "name": "Reachability",
    "same_as": {
      "wikidata": "Q1361526",
      "wikipedia": "Reachability"
    },
    "sources": [
      {
        "locator": "Definition",
        "url": "https://en.wikipedia.org/wiki/Reachability"
      }
    ],
    "tag": "0FDKRX9M9Y"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/0FDKRX9M9Y/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/0FDKRX9M9Y.md",
  "msc": [
    "05C40"
  ],
  "name": "Reachability",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0FD/0FDKRX9M9Y.md",
  "status": null,
  "tag": "0FDKRX9M9Y",
  "uri": "m2://0FDKRX9M9Y",
  "url": "https://math2.tamnd.com/wiki/reachability/",
  "writing": {
    "tag": "0FDKRX9M9Y",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}