"""simple docstring"""
from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_torch_available


lowercase__   			=      {'configuration_dinat': ['DINAT_PRETRAINED_CONFIG_ARCHIVE_MAP', 'DinatConfig']}


try:
 if not is_torch_available():
  raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
 pass
else:
 lowercase__   			=      [
     'DINAT_PRETRAINED_MODEL_ARCHIVE_LIST',
     'DinatForImageClassification',
     'DinatModel',
     'DinatPreTrainedModel',
     'DinatBackbone',
 ]

if TYPE_CHECKING:
 from .configuration_dinat import DINAT_PRETRAINED_CONFIG_ARCHIVE_MAP, DinatConfig

 try:
  if not is_torch_available():
   raise OptionalDependencyNotAvailable()
 except OptionalDependencyNotAvailable:
  pass
 else:
  from .modeling_dinat import (
      DINAT_PRETRAINED_MODEL_ARCHIVE_LIST,
      DinatBackbone,
      DinatForImageClassification,
      DinatModel,
      DinatPreTrainedModel,
  )

else:
 import sys

 lowercase__   			=      _LazyModule(__name__, globals()['__file__'], _import_structure, module_spec=__spec__)







# 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.
from queue import Queue


def 						_UpperCAmelCase							( snake_case     ):





					"""simple docstring"""

					_lowerCAmelCase         =       Queue()
					_lowerCAmelCase         =       [False] * len(snake_case     )
					_lowerCAmelCase         =       [-1] * len(snake_case     )

					def bfs():
										while not queue.empty():
															_lowerCAmelCase         =       queue.get()
															_lowerCAmelCase         =       True

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

																				if color[neighbour] == -1:
																									_lowerCAmelCase         =       1 - color[u]
																									queue.put(snake_case     )

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

										return True

					for i in range(len(snake_case     )     ):
										if not visited[i]:
															queue.put(snake_case     )
															_lowerCAmelCase         =       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]}))



