


def 					UpperCamelCase   (      __magic_name__	:				Optional[Any]	)  ->    Optional[int]:
		"""simple docstring"""




		lowercase__	     =						[0] * len(__magic_name__	)
		lowercase__	     =						[]
		lowercase__	     =						[1] * len(__magic_name__	)

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

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

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

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

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

		print(max(__magic_name__	)	)


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







longest_distance(graph)





import warnings

from diffusers import StableDiffusionInpaintPipeline as StableDiffusionInpaintPipeline  # noqa F401


warnings.warn(
    'The `inpainting.py` script is outdated. Please use directly `from diffusers import'
    ' StableDiffusionInpaintPipeline` instead.'
)

