




class 		lowercase_       :




					def __init__(   self:		Optional[Any]):


									'''simple docstring'''


									__lowerCAmelCase					=  []
									__lowerCAmelCase					=  0
									__lowerCAmelCase					=  0




					def __str__(   self:		List[str]):


									'''simple docstring'''


									__lowerCAmelCase					=  """<""" + str(self.entries)[1:-1] + """>"""
									return printed




					def     _lowercase						(   self:		List[Any],     _lowercase:		Any):


									'''simple docstring'''


									self.entries.append(_lowercase)
									__lowerCAmelCase					=  self.length + 1




					def     _lowercase						(   self:		Optional[Any]):


									'''simple docstring'''


									__lowerCAmelCase					=  self.length - 1
									__lowerCAmelCase					=  self.entries[self.front]
									# self.front-=1
									# self.entries = self.entries[self.front:]
									__lowerCAmelCase					=  self.entries[1:]
									return dequeued




					def     _lowercase						(   self:		Union[str, Any],     _lowercase:		str):


									'''simple docstring'''


									for _ in range(_lowercase):
													self.put(self.get())




					def     _lowercase						(   self:		Optional[Any]):


									'''simple docstring'''


									return self.entries[0]




					def     _lowercase						(   self:		Dict):


									'''simple docstring'''


									return self.length










import heapq







def  _snake_case			(							__snake_case       ,	__snake_case       ,	__snake_case     )  ->  str:






      '''simple docstring'''







      UpperCAmelCase_	:						List[str]					   =		[(0, start)]  # cost from start node,end node
      UpperCAmelCase_	:						List[Any]					   =		set()
      while heap:
            ((UpperCAmelCase_)   ,   (UpperCAmelCase_))	:						str					   =		heapq.heappop(__snake_case     )
            if u in visited:
                  continue
            visited.add(__snake_case     )
            if u == end:
                  return cost
            for v, c in graph[u]:
                  if v in visited:
                        continue
                  UpperCAmelCase_	:						Tuple					   =		cost + c
                  heapq.heappush(__snake_case       ,	(next_item, v)     )
      return -1


__lowerCamelCase								=      {
    '''A''': [['''B''', 2], ['''C''', 5]],
    '''B''': [['''A''', 2], ['''D''', 3], ['''E''', 1], ['''F''', 1]],
    '''C''': [['''A''', 5], ['''F''', 3]],
    '''D''': [['''B''', 3]],
    '''E''': [['''B''', 4], ['''F''', 3]],
    '''F''': [['''C''', 3], ['''E''', 3]],
}
__lowerCamelCase								=      {
    '''B''': [['''C''', 1]],
    '''C''': [['''D''', 1]],
    '''D''': [['''F''', 1]],
    '''E''': [['''B''', 1], ['''F''', 3]],
    '''F''': [],
}
__lowerCamelCase								=      {
    '''B''': [['''C''', 1]],
    '''C''': [['''D''', 1]],
    '''D''': [['''F''', 1]],
    '''E''': [['''B''', 1], ['''G''', 2]],
    '''F''': [],
    '''G''': [['''F''', 1]],
}

__lowerCamelCase								=      dijkstra(G, '''E''', '''C''')
print(short_distance)  # E -- 3 --> F -- 3 --> C == 6

__lowerCamelCase								=      dijkstra(Ga, '''E''', '''F''')
print(short_distance)  # E -- 3 --> F == 3

__lowerCamelCase								=      dijkstra(Ga, '''E''', '''F''')
print(short_distance)  # E -- 2 --> G -- 1 --> F == 3

if __name__ == "__main__":
   import doctest

   doctest.testmod()
