






from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_tokenizers_available


__UpperCAmelCase								=						{'tokenization_herbert': ['HerbertTokenizer']}

try:
		if not is_tokenizers_available():
				raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
		pass
else:
		__UpperCAmelCase								=						['HerbertTokenizerFast']


if TYPE_CHECKING:
		from .tokenization_herbert import HerbertTokenizer

		try:
				if not is_tokenizers_available():
						raise OptionalDependencyNotAvailable()
		except OptionalDependencyNotAvailable:
				pass
		else:
				from .tokenization_herbert_fast import HerbertTokenizerFast

else:
		import sys

		__UpperCAmelCase								=						_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.






def        UpperCamelCase_(							_snake_case   :  Tuple	):




			"""simple docstring"""






			__a        =[False] * len(_snake_case	)
			__a        =[-1] * len(_snake_case	)

			def dfs(_snake_case   :  Dict       ,     _snake_case   :  Any	):
						__a        =True
						__a        =c
						for u in graph[v]:
									if not visited[u]:
												dfs(_snake_case       ,     1 - c	)

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

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

			return True


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


print(check_bipartite_dfs(graph))






