



def     __lowercase(	UpperCAmelCase__ ):


      """simple docstring"""



      lowerCamelCase								=		[0] * len(UpperCAmelCase__ )
      lowerCamelCase								=		[]
      lowerCamelCase								=		[1] * len(UpperCAmelCase__ )

      for values in graph.values():
            for i in values:
                  indegree[i] += 1

      for i in range(len(UpperCAmelCase__ ) ):
            if indegree[i] == 0:
                  queue.append(UpperCAmelCase__ )

      while queue:
            lowerCamelCase								=		queue.pop(0 )
            for x in graph[vertex]:
                  indegree[x] -= 1

                  if long_dist[vertex] + 1 > long_dist[x]:
                        lowerCamelCase								=		long_dist[vertex] + 1

                  if indegree[x] == 0:
                        queue.append(UpperCAmelCase__ )

      print(max(UpperCAmelCase__ ) )


# Adjacency list of Graph
a_						:     Optional[int]	     =		{0: [2, 3, 4], 1: [2, 7], 2: [5], 3: [5, 7], 4: [7], 5: [6], 6: [7], 7: []}






longest_distance(graph)




from math import pi

def     __lowercase(	UpperCAmelCase__   ,   UpperCAmelCase__ ):


      """simple docstring"""



      return 2 * pi * radius * (angle / 360)


if __name__ == "__main__":
     print(arc_length(9_0, 1_0))