



'''simple docstring'''





def 		__snake_case(							_lowerCAmelCase						)						->					List[Any]:
      snake_case__    :       List[Any]       		= [0] * len(_lowerCAmelCase						)
      snake_case__    :       Any       		= []
      snake_case__    :       List[Any]       		= []
      snake_case__    :       Optional[Any]       		= 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:
            snake_case__    :       Optional[int]       		= 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
__a  			=						{0: [1, 2], 1: [3], 2: [3], 3: [4, 5], 4: [], 5: []}



topological_sort(graph)





'''simple docstring'''





# flake8: noqa
# Lint as: python3
__a  			=						[
    "VerificationMode",
    "Version",
    "disable_progress_bar",
    "enable_progress_bar",
    "is_progress_bar_enabled",
    "experimental",
]

from .info_utils import VerificationMode
from .logging import disable_progress_bar, enable_progress_bar, is_progress_bar_enabled
from .version import Version
from .experimental import experimental
