
'''simple docstring'''







from queue import Queue
def    snake_case_						(							__SCREAMING_SNAKE_CASE   :					Optional[Any]				):



						"""simple docstring"""





						lowercase_      :	int						=			Queue()
						lowercase_      :	str						=			[False] * len(_A				)
						lowercase_      :	List[str]						=			[-1] * len(_A				)

						def bfs():
												while not queue.empty():
																		lowercase_      :	List[Any]						=			queue.get()
																		lowercase_      :	Any						=			True

																		for neighbour in graph[u]:
																								if neighbour == u:
																														return False

																								if color[neighbour] == -1:
																														lowercase_      :	Dict						=			1 - color[u]
																														queue.put(_A				)

																								elif color[neighbour] == color[u]:
																														return False

												return True

						for i in range(len(_A				)				):
												if not visited[i]:
																		queue.put(_A				)
																		lowercase_      :	Tuple						=			0
																		if bfs() is False:
																								return False

						return True


if __name__ == "__main__":
							# Adjacency List of graph
							print(check_bipartite({0: [1, 3], 1: [0, 2], 2: [1, 3], 3: [0, 2]}))







'''simple docstring'''




from collections import OrderedDict
from dataclasses import fields
from typing import Any, Tuple

import numpy as np

from .import_utils import is_torch_available

def       __UpperCamelCase     (     _A     :					List[str]					)     ->   Any:




	"""simple docstring"""





	if is_torch_available():
		import torch

		if isinstance(_A       , torch.Tensor					):
			return True

	return isinstance(_A       , np.ndarray					)






class 			lowerCAmelCase					(					a				):



	def 					lowercase  (       self     ):
		lowerCAmelCase       :     List[str]   				=			fields(self     )

		# Safety and consistency checks
		if not len(snake_case__     ):
			raise ValueError(f"{self.__class__.__name__} has no fields."     )

		lowerCAmelCase       :     List[str]   				=			getattr(self			,       class_fields[0].name     )
		lowerCAmelCase       :     List[Any]   				=			all(getattr(self			,       field.name     ) is None for field in class_fields[1:]     )

		if other_fields_are_none and isinstance(snake_case__			,       snake_case__     ):
			for key, value in first_field.items():
				lowerCAmelCase       :     Optional[int]   				=			value
		else:
			for field in class_fields:
				lowerCAmelCase       :     str   				=			getattr(self			,       field.name     )
				if v is not None:
					lowerCAmelCase       :     Optional[Any]   				=			v



	def __delitem__(       self			,       *snake_case__			,       **snake_case__     ):
		raise Exception(f"You cannot use ``__delitem__`` on a {self.__class__.__name__} instance."     )



	def 					lowercase  (       self			,       *snake_case__			,       **snake_case__     ):
		raise Exception(f"You cannot use ``setdefault`` on a {self.__class__.__name__} instance."     )



	def 					lowercase  (       self			,       *snake_case__			,       **snake_case__     ):
		raise Exception(f"You cannot use ``pop`` on a {self.__class__.__name__} instance."     )



	def 					lowercase  (       self			,       *snake_case__			,       **snake_case__     ):
		raise Exception(f"You cannot use ``update`` on a {self.__class__.__name__} instance."     )



	def __getitem__(       self			,       snake_case__     ):
		if isinstance(snake_case__			,       snake_case__     ):
			lowerCAmelCase       :     Dict   				=			dict(self.items()     )
			return inner_dict[k]
		else:
			return self.to_tuple()[k]



	def __setattr__(       self			,       snake_case__			,       snake_case__     ):
		if name in self.keys() and value is not None:
			# Don't call self.__setitem__ to avoid recursion errors
			super().__setitem__(snake_case__			,       snake_case__     )
		super().__setattr__(snake_case__			,       snake_case__     )



	def __setitem__(       self			,       snake_case__			,       snake_case__     ):
		# Will raise a KeyException if needed
		super().__setitem__(snake_case__			,       snake_case__     )
		# Don't call self.__setattr__ to avoid recursion errors
		super().__setattr__(snake_case__			,       snake_case__     )



	def 					lowercase  (       self     ):
		return tuple(self[k] for k in self.keys()     )
