{
  "aliases": null,
  "backlinks": [
    {
      "field": "specializes",
      "target": "0GYQK9NDJF"
    },
    {
      "field": "specializes",
      "target": "HV2QBDHTDD"
    },
    {
      "field": "specializes",
      "target": "RE9YFFS3TS"
    },
    {
      "field": "defines",
      "target": "0R5HTV7REV"
    },
    {
      "field": "uses",
      "target": "3S42WRMG9V"
    },
    {
      "field": "uses",
      "target": "FN6P3CTPTS"
    },
    {
      "field": "uses",
      "target": "G2XY7J2Z5Q"
    },
    {
      "field": "uses",
      "target": "JV24HVZPJ0"
    },
    {
      "field": "uses",
      "target": "X1PQ8J2R10"
    },
    {
      "field": "uses",
      "target": "ZEZPYJC06B"
    },
    {
      "field": "uses",
      "target": "ZVTMF9YSGZ"
    },
    {
      "field": "about",
      "target": "JV24HVZPJ0"
    }
  ],
  "body": "\n## Summary\n\nA directed graph is a set of vertices with arrows between some ordered pairs of vertices. Directed graphs model one-way relations such as links, flows and dependencies. The node [[directed graph|0R5HTV7REV]] gives the precise definition.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "inventory": [
      "9B5F4MJKB0"
    ],
    "kind": "concept",
    "msc": [
      "05C20"
    ],
    "name": "Directed graph",
    "same_as": {
      "wikidata": "Q1137726",
      "wikipedia": "Directed graph"
    },
    "sources": [
      {
        "locator": "Definition",
        "url": "https://en.wikipedia.org/wiki/Directed_graph"
      }
    ],
    "tag": "0KFYGSHHF5"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/0KFYGSHHF5/",
  "links": null,
  "markdown": "https://tamnd.github.io/math2/node/0KFYGSHHF5.md",
  "msc": [
    "05C20"
  ],
  "name": "Directed graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0KF/0KFYGSHHF5.md",
  "status": null,
  "tag": "0KFYGSHHF5",
  "uri": "m2://0KFYGSHHF5",
  "url": "https://tamnd.github.io/math2/wiki/directed-graph/",
  "writing": {
    "tag": "0KFYGSHHF5",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      }
    ]
  }
}