



'''simple docstring'''


# 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  UpperCAmelCase_       (		lowercase__       ):


					'''simple docstring'''







					a_       		=[False] * len(_UpperCAmelCase       )
					a_       		=[-1] * len(_UpperCAmelCase       )

					def dfs(lowercase__       ,	lowercase__       ):
										a_       		=True
										a_       		=c
										for u in graph[v]:
															if not visited[u]:
																				dfs(_UpperCAmelCase       ,	1 - c       )

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

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

					return True


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

print(check_bipartite_dfs(graph))







'''simple docstring'''


from typing import Any

import numpy as np






def  UpperCAmelCase_       (		lowercase__       ):


     '''simple docstring'''







     return np.array_equal(lowercase__       ,	matrix.conjugate().T       )






def  UpperCAmelCase_       (		lowercase__       ,	lowercase__       ):


     '''simple docstring'''







     a_       		=v.conjugate().T
     a_       		=v_star.dot(lowercase__       )
     assert isinstance(lowercase__       ,	np.ndarray       )
     return (v_star_dot.dot(lowercase__       )) / (v_star.dot(lowercase__       ))






def  UpperCAmelCase_       (		):


     '''simple docstring'''







     a_       		=np.array([[2, 2 + 1j, 4], [2 - 1j, 3, 1j], [4, -1j, 1]]       )
     a_       		=np.array([[1], [2], [3]]       )
     assert is_hermitian(lowercase__       ), F"""{a} is not hermitian."""
     print(rayleigh_quotient(lowercase__       ,	lowercase__       )       )

     a_       		=np.array([[1, 2, 4], [2, 3, -1], [4, -1, 1]]       )
     assert is_hermitian(lowercase__       ), F"""{a} is not hermitian."""
     assert rayleigh_quotient(lowercase__       ,	lowercase__       ) == float(3       )


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  tests()


