





def _A       (   __magic_name__	):
   lowercase__			       =  [0] * len(__magic_name__	)
   lowercase__			       =  []
   lowercase__			       =  []
   lowercase__			       =  0

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

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

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

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


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







topological_sort(graph)













def _A       (   __magic_name__	):
   lowercase__			       =  ""
   for ch in key:
      if ch == " " or ch not in key_no_dups and ch.isalpha():
         key_no_dups += ch
   return key_no_dups


def _A       (   __magic_name__	):
   lowercase__			       =  [chr(i + 65	) for i in range(26	)]
   # Remove duplicate characters from key
   lowercase__			       =  remove_duplicates(key.upper()	)
   lowercase__			       =  len(__magic_name__	)
   # First fill cipher with key characters
   lowercase__			       =  {alphabet[i]: char for i, char in enumerate(__magic_name__	)}
   # Then map remaining characters in alphabet to
   # the alphabet from the beginning
   for i in range(len(__magic_name__	)  , 26	):
      lowercase__			       =  alphabet[i - offset]
      # Ensure we are not mapping letters to letters previously mapped
      while char in key:
         offset -= 1
         lowercase__			       =  alphabet[i - offset]
      lowercase__			       =  char
   return cipher_alphabet


def _A       (   __magic_name__  , __magic_name__	):
   return "".join(cipher_map.get(__magic_name__  , __magic_name__	) for ch in message.upper()	)


def _A       (   __magic_name__  , __magic_name__	):
   lowercase__			       =  {v: k for k, v in cipher_map.items()}
   return "".join(rev_cipher_map.get(__magic_name__  , __magic_name__	) for ch in message.upper()	)


def _A       (   ):
   lowercase__			       =  input("Enter message to encode or decode: "	).strip()
   lowercase__			       =  input("Enter keyword: "	).strip()
   lowercase__			       =  input("Encipher or decipher? E/D:"	).strip()[0].lower()
   try:
      lowercase__			       =  {"e": encipher, "d": decipher}[option]
   except KeyError:
      raise KeyError("invalid input option"	)
   lowercase__			       =  create_cipher_map(__magic_name__	)
   print(func(__magic_name__  , __magic_name__	)	)


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  main()






