

"""simple docstring"""






def   lowercase_	(    _lowercase       :		int	):




					'''simple docstring'''






					UpperCAmelCase			:   Optional[Any]      =				[0] * len(_lowerCamelCase	)
					UpperCAmelCase			:   Dict      =				[]
					UpperCAmelCase			:   int      =				[1] * len(_lowerCamelCase	)

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

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

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

															if long_dist[vertex] + 1 > long_dist[x]:
																				UpperCAmelCase			:   Optional[Any]      =				long_dist[vertex] + 1

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

					print(max(_lowerCamelCase	)	)


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




longest_distance(graph)





"""simple docstring"""






snake_case_   :   str        =       [
    """DownloadConfig""",
    """DownloadManager""",
    """DownloadMode""",
    """StreamingDownloadManager""",
]

from .download_config import DownloadConfig
from .download_manager import DownloadManager, DownloadMode
from .streaming_download_manager import StreamingDownloadManager


