{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Definition\n\nA forest is an [[acyclic|0XNN9Z8E5A]] [[graph|0JD5C82QMB]].\n\n## Remarks\n\nThe connected components of a forest are [[trees|0MJ0JS72DZ]]. Thus a forest is a disjoint union of trees.\nEvery tree is a forest. The graph with no edges on $n$ vertices is a forest with $n$ components.\n\n## Explanations\n\n### L1 human\n\nA forest is a graph with no cycles, and it may be in several pieces.\nEach piece is a tree, as the name suggests.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "defines": "0GGXWDNKBR",
    "kind": "definition",
    "msc": [
      "05C05"
    ],
    "name": "Forest",
    "sources": [
      {
        "locator": "Forest",
        "url": "https://en.wikipedia.org/wiki/Tree_(graph_theory)"
      }
    ],
    "tag": "09JP6G9FTA",
    "uses": [
      "0XNN9Z8E5A",
      "0MJ0JS72DZ"
    ]
  },
  "kind": "definition",
  "link": "https://math2.tamnd.com/node/09JP6G9FTA/",
  "links": [
    {
      "field": "defines",
      "target": "0GGXWDNKBR"
    },
    {
      "field": "uses",
      "target": "0XNN9Z8E5A"
    },
    {
      "field": "uses",
      "target": "0MJ0JS72DZ"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/09JP6G9FTA.md",
  "msc": [
    "05C05"
  ],
  "name": "Forest",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/09J/09JP6G9FTA.md",
  "status": null,
  "tag": "09JP6G9FTA",
  "uri": "m2://09JP6G9FTA",
  "url": "https://math2.tamnd.com/wiki/forest-definition/",
  "writing": {
    "tag": "09JP6G9FTA",
    "kind": "definition",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}