
'''simple docstring'''
def 							A_  (    __SCREAMING_SNAKE_CASE    :	str			)					->							int:





  """simple docstring"""

  __A		:  Optional[Any]       				=		5381
  for x in s:
    __A		:  List[str]       				=		((hash_value << 5) + hash_value) + ord(__SCREAMING_SNAKE_CASE			)
  return hash_value & 0xff_ff_ff_ff





'''simple docstring'''
import heapq







def 							A_  (    __SCREAMING_SNAKE_CASE    :	List[str]      ,  __SCREAMING_SNAKE_CASE    :	List[Any]      ,  __SCREAMING_SNAKE_CASE    :	str			)					->							Any:





  """simple docstring"""

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


A__ :		Any					={
    '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]],
}
A__ :		List[str]					={
    'B': [['C', 1]],
    'C': [['D', 1]],
    'D': [['F', 1]],
    'E': [['B', 1], ['F', 3]],
    'F': [],
}
A__ :		List[Any]					={
    'B': [['C', 1]],
    'C': [['D', 1]],
    'D': [['F', 1]],
    'E': [['B', 1], ['G', 2]],
    'F': [],
    'G': [['F', 1]],
}

A__ :		List[str]					=dijkstra(G, 'E', 'C')
print(short_distance)  # E -- 3 --> F -- 3 --> C == 6

A__ :		Optional[Any]					=dijkstra(Ga, 'E', 'F')
print(short_distance)  # E -- 3 --> F == 3

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

if __name__ == "__main__":
     import doctest

     doctest.testmod()



