



'''simple docstring'''





def       lowercase       (   SCREAMING_SNAKE_CASE__       :	float				,       SCREAMING_SNAKE_CASE__       :	float				)  ->     float:

 if density <= 0:
  raise ValueError("""Impossible fluid density"""				)
 if bulk_modulus <= 0:
  raise ValueError("""Impossible bulk modulus"""				)

 return (bulk_modulus / density) ** 0.5


if __name__ == "__main__":
  import doctest

  doctest.testmod()





# A Bipartite Graph is a graph whose vertices can be divided into two independent sets,
# U and V such that every edge (u, v) either connects a vertex from U to V or a vertex
# from V to U. In other words, for every edge (u, v), either u belongs to U and v to V,
# or u belongs to V and v to U. We can also say that there is no edge that connects
# vertices of same set.



def       lowercase       (   SCREAMING_SNAKE_CASE__       :	Dict				)  ->     Union[str, Any]:
 _snake_case    :  str					=					[False] * len(SCREAMING_SNAKE_CASE__				)
 _snake_case    :  Dict					=					[-1] * len(SCREAMING_SNAKE_CASE__				)

 def dfs(SCREAMING_SNAKE_CASE__       :	Optional[int]				,       SCREAMING_SNAKE_CASE__       :	Union[str, Any]				):
  _snake_case    :  Optional[Any]					=					True
  _snake_case    :  Tuple					=					c
  for u in graph[v]:
   if not visited[u]:
    dfs(SCREAMING_SNAKE_CASE__				,       1 - c				)

 for i in range(len(SCREAMING_SNAKE_CASE__				)				):
  if not visited[i]:
   dfs(SCREAMING_SNAKE_CASE__				,       0				)

 for i in range(len(SCREAMING_SNAKE_CASE__				)				):
  for j in graph[i]:
   if color[i] == color[j]:
    return False

 return True


# Adjacency list of graph
a__    =	{0: [1, 3], 1: [0, 2], 2: [1, 3], 3: [0, 2], 4: []}

print(check_bipartite_dfs(graph))
