{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "062MQGP8M5"
    }
  ],
  "body": "\n## Summary\n\nA trail is a walk in a graph that uses each edge at most once. Trails are the setting of Eulerian problems. The node [[trail|062MQGP8M5]] gives the precise definition.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "kind": "concept",
    "msc": [
      "05C38"
    ],
    "name": "Trail",
    "sources": [
      {
        "locator": "Walk, trail, and path",
        "url": "https://en.wikipedia.org/wiki/Path_(graph_theory)"
      }
    ],
    "tag": "0W50MT1C6X"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/0W50MT1C6X/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/0W50MT1C6X.md",
  "msc": [
    "05C38"
  ],
  "name": "Trail",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0W5/0W50MT1C6X.md",
  "status": null,
  "tag": "0W50MT1C6X",
  "uri": "m2://0W50MT1C6X",
  "url": "https://math2.tamnd.com/wiki/trail/",
  "writing": {
    "tag": "0W50MT1C6X",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}