Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
directed graphs
undirected graphs |
| gptkbp:category |
graph algorithms
|
| gptkbp:complexity |
O(E)
|
| gptkbp:field |
graph theory
|
| gptkbp:firstPublished |
1873
|
| https://www.w3.org/2000/01/rdf-schema#label |
Hierholzer's algorithm
|
| gptkbp:input |
gptkb:Eulerian_graph
|
| gptkbp:namedAfter |
gptkb:Carl_Hierholzer
|
| gptkbp:output |
gptkb:Eulerian_circuit
|
| gptkbp:relatedTo |
gptkb:Fleury's_algorithm
|
| gptkbp:solvedBy |
gptkb:Eulerian_circuit_problem
|
| gptkbp:step |
combine cycles into Eulerian circuit
follow edges until returning to starting vertex repeat for unused edges start at any vertex with nonzero degree |
| gptkbp:usedIn |
finding Eulerian path
|
| gptkbp:bfsParent |
gptkb:Eulerian_paths
gptkb:Eulerian_circuit gptkb:Eulerian_path gptkb:Eulerian_cycle |
| gptkbp:bfsLayer |
6
|