Fleury's algorithm
E1358784
UNEXPLORED
Fleury's algorithm is a classical graph-theoretic procedure for systematically finding an Eulerian trail by repeatedly choosing edges that are not bridges unless necessary.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Fleury's algorithm canonical | 1 |
| Fleury’s algorithm adapted to directed graphs | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T19108812 — 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: Fleury's algorithm Context triple: [Eulerian trail, algorithmicConstruction, Fleury's algorithm]
-
A.
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.
-
B.
Bellman–Ford algorithm
The Bellman–Ford algorithm is a graph shortest-path algorithm that can handle negative edge weights and detect negative cycles, often used in routing and network optimization.
-
C.
Floyd–Warshall algorithm
The Floyd–Warshall algorithm is a classic dynamic programming method in computer science for efficiently computing shortest paths between all pairs of vertices in a weighted graph, even when negative edge weights are present.
-
D.
Dijkstra's shortest path algorithm
Dijkstra's shortest path algorithm is a classic graph algorithm that efficiently computes the minimum-cost paths from a single source vertex to all other vertices in a weighted graph with non-negative edge weights.
-
E.
Cristian's algorithm
Cristian's algorithm is a clock synchronization method in distributed systems that estimates accurate time on client machines by querying a time server and adjusting for message delays.
- 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: Fleury's algorithm Target entity description: Fleury's algorithm is a classical graph-theoretic procedure for systematically finding an Eulerian trail by repeatedly choosing edges that are not bridges unless necessary.
-
A.
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.
-
B.
Bellman–Ford algorithm
The Bellman–Ford algorithm is a graph shortest-path algorithm that can handle negative edge weights and detect negative cycles, often used in routing and network optimization.
-
C.
Floyd–Warshall algorithm
The Floyd–Warshall algorithm is a classic dynamic programming method in computer science for efficiently computing shortest paths between all pairs of vertices in a weighted graph, even when negative edge weights are present.
-
D.
Dijkstra's shortest path algorithm
Dijkstra's shortest path algorithm is a classic graph algorithm that efficiently computes the minimum-cost paths from a single source vertex to all other vertices in a weighted graph with non-negative edge weights.
-
E.
Cristian's algorithm
Cristian's algorithm is a clock synchronization method in distributed systems that estimates accurate time on client machines by querying a time server and adjusting for message delays.
- F. None of above. chosen
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Fleury's algorithm