{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "0WPZ5YPAGR"
    }
  ],
  "body": "\n## Summary\n\nThe distance between two vertices of a graph is the length of a shortest walk between them. It makes a connected graph into a metric space. The node [[distance in a graph|0WPZ5YPAGR]] gives the precise definition.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "kind": "concept",
    "msc": [
      "05C12"
    ],
    "name": "Distance in a graph",
    "same_as": {
      "wikidata": "Q2742711",
      "wikipedia": "Distance (graph theory)"
    },
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/Distance_(graph_theory)"
      }
    ],
    "tag": "0QV9VNNB4Z"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/0QV9VNNB4Z/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/0QV9VNNB4Z.md",
  "msc": [
    "05C12"
  ],
  "name": "Distance in a graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0QV/0QV9VNNB4Z.md",
  "status": null,
  "tag": "0QV9VNNB4Z",
  "uri": "m2://0QV9VNNB4Z",
  "url": "https://math2.tamnd.com/wiki/distance-in-a-graph/",
  "writing": {
    "tag": "0QV9VNNB4Z",
    "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
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}