Breaking News: Grepper is joining You.com. Read the official announcement!

source code of Tortoise and hare algorithm in python

Troubled Termite answered on May 17, 2022 Popularity 5/10 Helpfulness 7/10

answer source code of Tortoise and hare algorithm in python

source code of Tortoise and hare algorithm in python

Comment

nodes = [(1,1,1,3,5,6), (1,2,3,2,4,5), (1,2,2,3,4,5),  (2,4,5,6)]

def next(parent):
  def find(nodes, parent):
    current = nodes[0]
    rest = nodes[1:]

    if current and current[0] == parent:
      return current[1]
    else:
      return find(rest, parent)
  return find(nodes, parent) 

def next_next(x):
  return next(next(x))

def meet(slow, fast, p1, p2, steps):
  p1 = slow(p1)
  p2 = fast(p2)
  steps = steps + 1

  if p1 == p2:
    return (p1, steps)
  else:
    return meet(slow, fast, p1, p2, steps)

def meet_result(slow, fast, p1, p2):
  result = meet(slow, fast, p1, p2, 0)
  return result[0]

def meet_count(slow, fast, p1, p2):
  result = meet(slow, fast, p1, p2, 0)
  return result[1]

def find_cycle(init):
  cycle_meet = meet_result(next, next_next, init, init)
  cycle_root = meet_result(next, next, cycle_meet, init)
  cycle_length = meet_count(lambda x: x, next, cycle_root, cycle_root)
  return (cycle_meet, cycle_root, cycle_length)

Popularity 5/10 Helpfulness 7/10 Language python

Source: kimsereylam.com

Tags: algorithm python

Link to this answer
Share Copy Link

Contributed on May 17 2022

Troubled Termite

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

source code of Tortoise and hare algorithm in python

Contents

More Related Answers

source code of Tortoise and hare algorithm in python

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.