


def 							A     (					_UpperCAmelCase    :       Optional[Any]   )    ->			List[Any]:







			'''simple docstring'''
			_UpperCAmelCase			=       [False] * len(_UpperCAmelCase   )
			_UpperCAmelCase			=       [-1] * len(_UpperCAmelCase   )

			def dfs(_UpperCAmelCase    :       Dict							,       _UpperCAmelCase    :       List[Any]   ):
						_UpperCAmelCase			=       True
						_UpperCAmelCase			=       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
UpperCAmelCase__       =	{0: [1, 3], 1: [0, 2], 2: [1, 3], 3: [0, 2], 4: []}

print(check_bipartite_dfs(graph))





from typing import TYPE_CHECKING

from ...utils import _LazyModule


UpperCAmelCase__       =	{"tokenization_bertweet": ["BertweetTokenizer"]}


if TYPE_CHECKING:
							from .tokenization_bertweet import BertweetTokenizer

else:
							import sys

							UpperCAmelCase__       =	_LazyModule(__name__, globals()["__file__"], _import_structure, module_spec=__spec__)
