Hierholzer's algorithm
E1358783
UNEXPLORED
Hierholzer's algorithm is a classical graph algorithm that efficiently constructs an Eulerian trail or circuit by iteratively building and merging cycles in a graph where such a trail exists.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Hierholzer's algorithm canonical | 1 |
| Hierholzer’s algorithm to find an Eulerian circuit | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T19108811 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hierholzer's algorithm Context triple: [Eulerian trail, algorithmicConstruction, Hierholzer's algorithm]
-
A.
Kosaraju's algorithm
Kosaraju's algorithm is a graph traversal method used to efficiently find all strongly connected components in a directed graph.
-
B.
Eulerian trail
An Eulerian trail is a path in a graph that traverses every edge exactly once, possibly revisiting vertices.
-
C.
Tarjan's strongly connected components algorithm
Tarjan's strongly connected components algorithm is a classic linear-time graph algorithm that efficiently identifies all strongly connected components in a directed graph using depth-first search and low-link values.
-
D.
Dijkstra
Dijkstra is a renowned Dutch computer scientist best known for his pioneering work in algorithms, including Dijkstra's shortest path algorithm, and for his influential contributions to programming methodology and software engineering.
-
E.
Hamiltonian path
A Hamiltonian path is a route through a graph that visits each vertex exactly once without necessarily returning to the starting point.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Hierholzer's algorithm Target entity description: Hierholzer's algorithm is a classical graph algorithm that efficiently constructs an Eulerian trail or circuit by iteratively building and merging cycles in a graph where such a trail exists.
-
A.
Kosaraju's algorithm
Kosaraju's algorithm is a graph traversal method used to efficiently find all strongly connected components in a directed graph.
-
B.
Eulerian trail
An Eulerian trail is a path in a graph that traverses every edge exactly once, possibly revisiting vertices.
-
C.
Tarjan's strongly connected components algorithm
Tarjan's strongly connected components algorithm is a classic linear-time graph algorithm that efficiently identifies all strongly connected components in a directed graph using depth-first search and low-link values.
-
D.
Dijkstra
Dijkstra is a renowned Dutch computer scientist best known for his pioneering work in algorithms, including Dijkstra's shortest path algorithm, and for his influential contributions to programming methodology and software engineering.
-
E.
Hamiltonian path
A Hamiltonian path is a route through a graph that visits each vertex exactly once without necessarily returning to the starting point.
- F. None of above. chosen
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Hierholzer's algorithm