

a		={
    """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		={value: key for key, value in MORSE_CODE_DICT.items()}






def    SCREAMING_SNAKE_CASE__       (  lowerCamelCase__			)  ->     str:
	return " ".join(MORSE_CODE_DICT[char] for char in message.upper()			)






def    SCREAMING_SNAKE_CASE__       (  lowerCamelCase__			)  ->     str:
	return "".join(REVERSE_DICT[char] for char in message.split()			)






def    SCREAMING_SNAKE_CASE__       (  )  ->     None:
	__lowerCamelCase				:				Dict					       = 'Morse code here!'
	print(__snake_case			)
	__lowerCamelCase				:				List[Any]					       = encrypt(__snake_case			)
	print(__snake_case			)
	__lowerCamelCase				:				Union[str, Any]					       = decrypt(__snake_case			)
	print(__snake_case			)


if __name__ == "__main__":
					main()








import heapq as hq
import math
from collections.abc import Iterator







class       lowerCamelCase__   :





     def __init__(self		,     UpperCAmelCase       )     ->   Any:
      _lowercase							      =str(id_       )
      _lowercase							      =None
      _lowercase							      =None
      _lowercase							      =[]
      _lowercase							      ={}  # {vertex:distance}





     def __lt__(self		,     UpperCAmelCase       )     ->   List[str]:
      return self.key < other.key





     def __repr__(self       )     ->   str:
      return self.id





     def      __A					(self		,     UpperCAmelCase       )     ->   Dict:
      self.neighbors.append(UpperCAmelCase       )





     def      __A					(self		,     UpperCAmelCase		,     UpperCAmelCase       )     ->   Optional[Any]:
      _lowercase							      =weight



def 				UpperCAmelCase_					(							__snake_case     ,						__snake_case     ,						__snake_case     ,						__snake_case						)     ->			List[str]:







 """simple docstring"""


 graph[a - 1].add_neighbor(graph[b - 1]						)
 graph[b - 1].add_neighbor(graph[a - 1]						)
 # add the edges:
 graph[a - 1].add_edge(graph[b - 1]     ,						__snake_case						)
 graph[b - 1].add_edge(graph[a - 1]     ,						__snake_case						)
def 				UpperCAmelCase_					(							__snake_case     ,						__snake_case						)     ->			list:







 """simple docstring"""


 _lowercase							      =[]
 for u in graph:
  _lowercase							      =math.inf
  _lowercase							      =None
 _lowercase							      =0
 _lowercase							      =graph[:]
 while q:
  _lowercase							      =min(__snake_case						)
  q.remove(__snake_case						)
  for v in u.neighbors:
   if (v in q) and (u.edges[v.id] < v.key):
    _lowercase							      =u
    _lowercase							      =u.edges[v.id]
 for i in range(1     ,						len(__snake_case						)						):
  a.append((int(graph[i].id						) + 1, int(graph[i].pi.id						) + 1)						)
 return a
def 				UpperCAmelCase_					(							__snake_case     ,						__snake_case						)     ->			Iterator[tuple]:







 """simple docstring"""


 for u in graph:
  _lowercase							      =math.inf
  _lowercase							      =None
 _lowercase							      =0

 _lowercase							      =list(__snake_case						)
 hq.heapify(__snake_case						)

 while h:
  _lowercase							      =hq.heappop(__snake_case						)
  for v in u.neighbors:
   if (v in h) and (u.edges[v.id] < v.key):
    _lowercase							      =u
    _lowercase							      =u.edges[v.id]
    hq.heapify(__snake_case						)

 for i in range(1     ,						len(__snake_case						)						):
  yield (int(graph[i].id						) + 1, int(graph[i].pi.id						) + 1)
def 				UpperCAmelCase_					(							)     ->			None:







 """simple docstring"""




if __name__ == "__main__":
  import doctest

  doctest.testmod()

