Floyd’s cycle-finding algorithm
E1119494
UNEXPLORED
Floyd’s cycle-finding algorithm is a classic pointer-based technique in computer science for detecting cycles in sequences or linked structures using two iterators moving at different speeds.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Floyd’s cycle-finding algorithm canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T14773380 — 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: Floyd’s cycle-finding algorithm Context triple: [Robert W. Floyd, notableWork, Floyd’s cycle-finding algorithm]
-
A.
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.
-
B.
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.
-
C.
Berlekamp–Massey algorithm
The Berlekamp–Massey algorithm is a key algorithm in coding theory and cryptography used to efficiently determine the shortest linear feedback shift register that generates a given binary sequence.
-
D.
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.
-
E.
Pollard script
Pollard script is an alphabetic writing system originally devised in the early 20th century for transcribing various Miao (Hmongic) languages of China.
- 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: Floyd’s cycle-finding algorithm Target entity description: Floyd’s cycle-finding algorithm is a classic pointer-based technique in computer science for detecting cycles in sequences or linked structures using two iterators moving at different speeds.
-
A.
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.
-
B.
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.
-
C.
Berlekamp–Massey algorithm
The Berlekamp–Massey algorithm is a key algorithm in coding theory and cryptography used to efficiently determine the shortest linear feedback shift register that generates a given binary sequence.
-
D.
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.
-
E.
Pollard script
Pollard script is an alphabetic writing system originally devised in the early 20th century for transcribing various Miao (Hmongic) languages of China.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
Robert W. Floyd