{
  "aliases": null,
  "backlinks": [
    {
      "field": "uses",
      "target": "09JP6G9FTA"
    },
    {
      "field": "uses",
      "target": "0MJ0JS72DZ"
    }
  ],
  "body": "\n## Definition\n\nA [[graph|0JD5C82QMB]] is acyclic if it has no [[cycle|07CT9RDY7Q]].\n\n## Remarks\n\nAn acyclic graph is also called a [[forest|09JP6G9FTA]]. A connected acyclic graph is a [[tree|0MJ0JS72DZ]].\nThe [[path graphs|075WR6W3Y3]] and the graphs with no edges are acyclic. The [[cycle graphs|0QQ0F12962]] are not.\nA finite acyclic graph with $n$ vertices and $c$ components has $n - c$ edges.\n\n## Explanations\n\n### L1 human\n\nA graph is acyclic when you cannot go around any loop in it.\nEach edge then splits its piece of the graph in two when you delete it.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "defines": "0SXHBTNM9T",
    "kind": "definition",
    "msc": [
      "05C05"
    ],
    "name": "Acyclic graph",
    "sources": [
      {
        "locator": "Forest",
        "url": "https://en.wikipedia.org/wiki/Tree_(graph_theory)"
      }
    ],
    "tag": "0XNN9Z8E5A",
    "uses": [
      "07CT9RDY7Q"
    ]
  },
  "kind": "definition",
  "link": "https://math2.tamnd.com/node/0XNN9Z8E5A/",
  "links": [
    {
      "field": "defines",
      "target": "0SXHBTNM9T"
    },
    {
      "field": "uses",
      "target": "07CT9RDY7Q"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/0XNN9Z8E5A.md",
  "msc": [
    "05C05"
  ],
  "name": "Acyclic graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0XN/0XNN9Z8E5A.md",
  "status": null,
  "tag": "0XNN9Z8E5A",
  "uri": "m2://0XNN9Z8E5A",
  "url": "https://math2.tamnd.com/wiki/acyclic-graph-definition/",
  "writing": {
    "tag": "0XNN9Z8E5A",
    "kind": "definition",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}