{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "09JP6G9FTA"
    }
  ],
  "body": "\n## Summary\n\nA forest is a graph without cycles, that is, a disjoint union of trees. The spanning forests of a graph generalize spanning trees to graphs that are not connected. The node [[forest|09JP6G9FTA]] gives the precise definition.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "kind": "concept",
    "msc": [
      "05C05"
    ],
    "name": "Forest",
    "sources": [
      {
        "locator": "Forest",
        "url": "https://en.wikipedia.org/wiki/Tree_(graph_theory)"
      }
    ],
    "tag": "0GGXWDNKBR"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/0GGXWDNKBR/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/0GGXWDNKBR.md",
  "msc": [
    "05C05"
  ],
  "name": "Forest",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0GG/0GGXWDNKBR.md",
  "status": null,
  "tag": "0GGXWDNKBR",
  "uri": "m2://0GGXWDNKBR",
  "url": "https://math2.tamnd.com/wiki/forest/",
  "writing": {
    "tag": "0GGXWDNKBR",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}