'''simple docstring'''

__a:			Dict	       =       {
    """A""": """.-""", """B""": """-...""", """C""": """-.-.""", """D""": """-..""", """E""": """.""", """F""": """..-.""", """G""": """--.""",
    """H""": """....""", """I""": """..""", """J""": """.---""", """K""": """-.-""", """L""": """.-..""", """M""": """--""", """N""": """-.""",
    """O""": """---""", """P""": """.--.""", """Q""": """--.-""", """R""": """.-.""", """S""": """...""", """T""": """-""", """U""": """..-""",
    """V""": """...-""", """W""": """.--""", """X""": """-..-""", """Y""": """-.--""", """Z""": """--..""", """1""": """.----""",
    """2""": """..---""", """3""": """...--""", """4""": """....-""", """5""": """.....""", """6""": """-....""", """7""": """--...""",
    """8""": """---..""", """9""": """----.""", """0""": """-----""", """&""": """.-...""", """@""": """.--.-.""",
    """:""": """---...""", """,""": """--..--""", """.""": """.-.-.-""", """'""": """.----.""", """\"""": """.-..-.""",
    """?""": """..--..""", """/""": """-..-.""", """=""": """-...-""", """+""": """.-.-.""", """-""": """-....-""",
    """(""": """-.--.""", """)""": """-.--.-""", """!""": """-.-.--""", """ """: """/"""
}  # Exclamation mark is not in ITU-R recommendation
# fmt: on
__a:			str	       =       {value: key for key, value in MORSE_CODE_DICT.items()}
def       __UpperCamelCase	(       UpperCAmelCase					):
 return " ".join(MORSE_CODE_DICT[char] for char in message.upper()					)
def       __UpperCamelCase	(       UpperCAmelCase					):
 return "".join(REVERSE_DICT[char] for char in message.split()					)
def       __UpperCamelCase	(       ):
 lowercase__    :   Tuple						= '''Morse code here!'''
 print(UpperCAmelCase					)
 lowercase__    :   int						= encrypt(UpperCAmelCase					)
 print(UpperCAmelCase					)
 lowercase__    :   Any						= decrypt(UpperCAmelCase					)
 print(UpperCAmelCase					)


if __name__ == "__main__":
  main()


'''simple docstring'''

class       UpperCAmelCase  :





       '''simple docstring'''



       def __init__(						self			)  ->  List[str]:
        lowercase__    :   Dict						= {}

       def _lowerCAmelCase(						self			)  ->  None:
        print(self.vertex			)
        for i in self.vertex:
         print(__lowerCAmelCase     ,       ''' -> '''     ,       ''' -> '''.join([str(__lowerCAmelCase			) for j in self.vertex[i]]			)			)

       def _lowerCAmelCase(						self     ,       __lowerCAmelCase     ,       __lowerCAmelCase			)  ->  None:
        # check if vertex is already present,
        if from_vertex in self.vertex:
         self.vertex[from_vertex].append(__lowerCAmelCase			)
        else:
         # else make a new vertex
         lowercase__    :   Union[str, Any]						= [to_vertex]

       def _lowerCAmelCase(						self			)  ->  None:
        # visited array for storing already visited nodes
        lowercase__    :   str						= [False] * len(self.vertex			)

        # call the recursive helper function
        for i in range(len(self.vertex			)			):
         if not visited[i]:
          self.dfs_recursive(__lowerCAmelCase     ,       __lowerCAmelCase			)


       def _lowerCAmelCase(						self     ,       __lowerCAmelCase     ,       __lowerCAmelCase			)  ->  None:
        # mark start vertex as visited
        lowercase__    :   List[str]						= True

        print(__lowerCAmelCase     ,       end=''' '''			)

        # Recur for all the vertices that are adjacent to this node
        for i in self.vertex:
         if not visited[i]:
          self.dfs_recursive(__lowerCAmelCase     ,       __lowerCAmelCase			)


if __name__ == "__main__":
  __a:			Optional[Any]	       =       Graph()
  g.add_edge(0, 1)
  g.add_edge(0, 2)
  g.add_edge(1, 2)
  g.add_edge(2, 0)
  g.add_edge(2, 3)
  g.add_edge(3, 3)

  g.print_graph()
  print("""DFS:""")
  g.dfs()

  # OUTPUT:
  # 0  ->  1 -> 2
  # 1  ->  2
  # 2  ->  0 -> 3
  # 3  ->  3
  # DFS:
  #  0 1 2 3

