{
  "aliases": null,
  "backlinks": [
    {
      "field": "uses",
      "target": "07CT9RDY7Q"
    }
  ],
  "body": "\n## Definition\n\nLet $G$ be a [[graph|0JD5C82QMB]].\nA circuit in $G$ is a closed [[trail|062MQGP8M5]] of positive length.\nThat is a walk $(w_0, w_1, \\dots, w_k)$ with $k \\ge 1$, $w_k = w_0$, and pairwise distinct edges.\n\n## Remarks\n\nA circuit may visit a vertex more than once. A [[cycle|07CT9RDY7Q]] is a circuit with no repeated vertex other than the start.\nIn a simple graph each circuit has length at least $3$.\nSome authors use the word circuit for a cycle. Others use the word tour.\n\n## Explanations\n\n### L1 human\n\nA circuit is a trail that ends where it starts.\nIt is a round trip that never uses the same edge twice.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "defines": "09F2QPVQY7",
    "kind": "definition",
    "msc": [
      "05C38"
    ],
    "name": "Circuit",
    "sources": [
      {
        "locator": "Circuit and cycle",
        "url": "https://en.wikipedia.org/wiki/Cycle_(graph_theory)"
      }
    ],
    "tag": "0PD57PSHNR",
    "uses": [
      "062MQGP8M5"
    ]
  },
  "kind": "definition",
  "link": "https://math2.tamnd.com/node/0PD57PSHNR/",
  "links": [
    {
      "field": "defines",
      "target": "09F2QPVQY7"
    },
    {
      "field": "uses",
      "target": "062MQGP8M5"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/0PD57PSHNR.md",
  "msc": [
    "05C38"
  ],
  "name": "Circuit",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0PD/0PD57PSHNR.md",
  "status": null,
  "tag": "0PD57PSHNR",
  "uri": "m2://0PD57PSHNR",
  "url": "https://math2.tamnd.com/wiki/circuit-definition/",
  "writing": {
    "tag": "0PD57PSHNR",
    "kind": "definition",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}