"Eulerian path" meaning in English

See Eulerian path in All languages combined, or Wiktionary

Noun

Forms: Eulerian paths [plural]
Head templates: {{en-noun}} Eulerian path (plural Eulerian paths)
  1. (graph theory) A walk that uses every edge of a graph exactly once. Categories (topical): Graph theory
{
  "forms": [
    {
      "form": "Eulerian paths",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Eulerian path (plural Eulerian paths)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A walk that uses every edge of a graph exactly once."
      ],
      "id": "en-Eulerian_path-en-noun-jVst2IrZ",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "walk",
          "walk"
        ],
        [
          "edge",
          "edge"
        ],
        [
          "graph",
          "graph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A walk that uses every edge of a graph exactly once."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Eulerian path"
}
{
  "forms": [
    {
      "form": "Eulerian paths",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Eulerian path (plural Eulerian paths)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with non-redundant non-automated sortkeys",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Graph theory"
      ],
      "glosses": [
        "A walk that uses every edge of a graph exactly once."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "walk",
          "walk"
        ],
        [
          "edge",
          "edge"
        ],
        [
          "graph",
          "graph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A walk that uses every edge of a graph exactly once."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Eulerian path"
}

Download raw JSONL data for Eulerian path meaning in English (0.9kB)


This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-03-01 from the enwiktionary dump dated 2025-02-21 using wiktextract (7c21d10 and f2e72e5). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.