{
  "aliases": null,
  "backlinks": [
    {
      "field": "uses",
      "target": "062MQGP8M5"
    },
    {
      "field": "uses",
      "target": "09VZBHB33V"
    },
    {
      "field": "uses",
      "target": "0J8XE7W68F"
    },
    {
      "field": "uses",
      "target": "0JDE56HWQ8"
    },
    {
      "field": "uses",
      "target": "0WPZ5YPAGR"
    }
  ],
  "body": "\n## Definition\n\nLet $G$ be a [[graph|0JD5C82QMB]], let $k$ be a natural number, and let $u, v$ be vertices of $G$.\nA walk of length $k$ from $u$ to $v$ is a sequence of vertices $(w_0, w_1, \\dots, w_k)$ with $w_0 = u$, $w_k = v$, and $w_{i-1} \\sim w_i$ for $1 \\le i \\le k$.\nIts edges are the edges $w_{i-1} w_i$.\n\n## Remarks\n\nA walk may repeat vertices and edges. A walk of length $0$ is a single vertex.\nA [[trail|062MQGP8M5]] has no repeated edge, and a [[path|0JDE56HWQ8]] has no repeated vertex.\nA walk is closed if $u = v$.\n\n## Explanations\n\n### L1 human\n\nA walk is a route through a graph that goes from vertex to vertex along edges.\nYou may visit the same vertex or use the same edge more than once.\n",
  "commit": "f591989ed15704e9d8755a7a5a6426d73de7a3ae",
  "front": {
    "defines": "085CH3CYMX",
    "kind": "definition",
    "msc": [
      "05C38"
    ],
    "name": "Walk",
    "sources": [
      {
        "locator": "Walk, trail, and path",
        "url": "https://en.wikipedia.org/wiki/Path_(graph_theory)"
      }
    ],
    "tag": "0VJZM0F9YM",
    "uses": [
      "0JD5C82QMB"
    ]
  },
  "kind": "definition",
  "link": "https://math2.tamnd.com/node/0VJZM0F9YM/",
  "links": [
    {
      "field": "defines",
      "target": "085CH3CYMX"
    },
    {
      "field": "uses",
      "target": "0JD5C82QMB"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/0VJZM0F9YM.md",
  "msc": [
    "05C38"
  ],
  "name": "Walk",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0VJ/0VJZM0F9YM.md",
  "status": null,
  "tag": "0VJZM0F9YM",
  "uri": "m2://0VJZM0F9YM",
  "url": "https://math2.tamnd.com/wiki/walk-definition/",
  "writing": {
    "tag": "0VJZM0F9YM",
    "kind": "definition",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}