摘要: This isFloyd's algorithm for cycle detection. You are asking about the second phase of the algorithm -- once you've found a node that's part of a cycle, how does one find thestartof the cycle?In the first part of Floyd's algorithm, the hare moves two steps for every step of the torto 阅读全文
posted @ 2013-08-29 07:30 pgu2 阅读(233) 评论(0) 推荐(0)