
'''simple docstring'''

def     snake_case__						(   UpperCamelCase						)			->   Union[str, Any]:
		_UpperCamelCase							:			str     =   [0] * len(UpperCamelCase_						)
		_UpperCamelCase							:			List[Any]     =   []
		_UpperCamelCase							:			Optional[Any]     =   [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:
				_UpperCamelCase							:			Dict     =   queue.pop(0						)
				for x in graph[vertex]:
						indegree[x] -= 1

						if long_dist[vertex] + 1 > long_dist[x]:
								_UpperCamelCase							:			Tuple     =   long_dist[vertex] + 1

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

		print(max(UpperCamelCase_						)						)


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


longest_distance(graph)






_SCREAMING_SNAKE_CASE 		=      9.8_06_65





def 			lowercase(	UpperCamelCase_							,					UpperCamelCase_							,					UpperCamelCase_ = g       )		->	float:







 '''simple docstring'''

 if fluid_density <= 0:
  raise ValueError("""Impossible fluid density"""       )
 if volume < 0:
  raise ValueError("""Impossible Object volume"""       )
 if gravity <= 0:
  raise ValueError("""Impossible Gravity"""       )

 return fluid_density * gravity * volume


if __name__ == "__main__":
     import doctest

     # run doctest
     doctest.testmod()
