{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "0VJZM0F9YM"
    }
  ],
  "body": "\n## Summary\n\nA walk in a graph is a sequence of vertices in which consecutive vertices are adjacent. Walks are the basic notion of movement in a graph, and trails, paths, circuits and cycles are special walks. The node [[walk|0VJZM0F9YM]] gives the precise definition.\n",
  "commit": "f591989ed15704e9d8755a7a5a6426d73de7a3ae",
  "front": {
    "kind": "concept",
    "msc": [
      "05C38"
    ],
    "name": "Walk",
    "sources": [
      {
        "locator": "Walk, trail, and path",
        "url": "https://en.wikipedia.org/wiki/Path_(graph_theory)"
      }
    ],
    "tag": "085CH3CYMX"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/085CH3CYMX/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/085CH3CYMX.md",
  "msc": [
    "05C38"
  ],
  "name": "Walk",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/085/085CH3CYMX.md",
  "status": null,
  "tag": "085CH3CYMX",
  "uri": "m2://085CH3CYMX",
  "url": "https://math2.tamnd.com/wiki/walk/",
  "writing": {
    "tag": "085CH3CYMX",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}