Floyd's algorithm (chapter 16.4)

[checktor]

Why does the presented method to detect cycles in successor graphs (Floyd's algorithm) work?

In my point of view, your explanation concerning the correctness of this algorithm is a bit too short and does not clarify the reason why this algorithm actually works.

But overall, well done! I really enjoyed reading your handbook :)