





_lowerCAmelCase 				=     """
# Transformers installation
! pip install transformers datasets
# To install from source instead of the last release, comment the command above and uncomment the following one.
# ! pip install git+https://github.com/huggingface/transformers.git
"""

_lowerCAmelCase 				=     [{"""type""": """code""", """content""": INSTALL_CONTENT}]
_lowerCAmelCase 				=     {
    """{processor_class}""": """FakeProcessorClass""",
    """{model_class}""": """FakeModelClass""",
    """{object_class}""": """FakeObjectClass""",
}













def     _lowerCAmelCase		(  _lowerCAmelCase     ):
   '''simple docstring'''


   A_     :				Union[str, Any]			      =	[0] * len(_lowerCAmelCase     )
   A_     :				Optional[int]			      =	[]
   A_     :				str			      =	[]
   A_     :				Dict			      =	0

   for values in graph.values():
      for i in values:
         indegree[i] += 1

   for i in range(len(_lowerCAmelCase     )     ):
      if indegree[i] == 0:
         queue.append(_lowerCAmelCase     )

   while queue:
      A_     :				List[str]			      =	queue.pop(0     )
      cnt += 1
      topo.append(_lowerCAmelCase     )
      for x in graph[vertex]:
         indegree[x] -= 1
         if indegree[x] == 0:
            queue.append(_lowerCAmelCase     )

   if cnt != len(_lowerCAmelCase     ):
      print("""Cycle exists"""     )
   else:
      print(_lowerCAmelCase     )


# Adjacency List of Graph
_lowerCAmelCase 				=     {0: [1, 2], 1: [3], 2: [3], 3: [4, 5], 4: [], 5: []}







topological_sort(graph)






