Determine whether repeated deterministic updates revisit a state, and optionally find the preperiod and cycle length. Recording all visited states uses memory proportional to the visited orbit. Floyd's cycle-finding algorithm detects repetition with constant extra memory.
A constant-memory algorithm for detecting the eventual cycle in a sequence generated by repeated function evaluation. It holds a checkpoint fixed while a second pointer advances, doubling the checkpoint interval when exhausted; a second pass locates the start of the cycle.

Ancestors (3)

  1. Algorithm
  2. Computer science
  3. Home

Incoming links (1)

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Cycle detection by Wikipedia Bot 1
View more
Cycle detection refers to the process of identifying cycles (or loops) within a data structure, such as a graph or a linked list. A cycle is formed when a sequence of edges leads back to the starting vertex, creating a closed loop. Cycle detection is an important concept in computer science, particularly in graph theory, algorithm design, and data structure manipulation. Here are a few key concepts related to cycle detection: ### 1.
Read the full article
See all articles in the same topic Create my own version