Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:alternativeTo |
gptkb:Hierholzer's_algorithm
|
| gptkbp:appliesTo |
undirected graphs
|
| gptkbp:category |
combinatorial algorithm
|
| gptkbp:complexity |
O(E^2)
|
| https://www.w3.org/2000/01/rdf-schema#label |
Fleury's algorithm
|
| gptkbp:introducedIn |
1883
|
| gptkbp:namedAfter |
gptkb:M._Fleury
|
| gptkbp:relatedTo |
gptkb:Eulerian_circuit
gptkb:Eulerian_path |
| gptkbp:requires |
graph to be connected
all vertices have even degree or exactly two have odd degree |
| gptkbp:step |
start at a vertex with odd degree (if exists), else any vertex
at each step, choose an edge that is not a bridge unless no alternative remove the chosen edge from the graph repeat until all edges are used |
| gptkbp:usedFor |
finding Eulerian circuits
finding Eulerian paths |
| gptkbp:bfsParent |
gptkb:Eulerian_paths
gptkb:Eulerian_circuit gptkb:Eulerian_path gptkb:Eulerian_cycle |
| gptkbp:bfsLayer |
6
|