Graph

import random

ts = [

      [0,1,1,0],

      [1,0,0,0],

      [1,0,0,1],

      [0,0,1,1]

]

def gr_depth(ts,n):

  places=[0]

  route=[0]

  n = len(ts)

  while places:

    print (places)

    v=0    

    for i in range(n):

      if ts[places[-1]][i]==1 and i not in route:

        places.append(i)

        route.append(i)

        v=1

        break

    if v!=1:

      places.pop()

  return(route)

route=gr_depth(ts,n)

print(ts)

print(route)