

class 					lowercase		:



 '''simple docstring'''


 def __init__(self , __a=None				)				->      Tuple:






  """simple docstring"""





  UpperCAmelCase__           =       data
  UpperCAmelCase__           =       None




 def __repr__(self				)				->      List[Any]:






  """simple docstring"""





  UpperCAmelCase__           =       ''
  UpperCAmelCase__           =       self
  while temp:
   string_rep += F"<{temp.data}> ---> "
   UpperCAmelCase__           =       temp.next
  string_rep += "<END>"
  return string_rep







def 		UpperCamelCase_(    snake_case__:						Dict     ) ->				Union[str, Any]:

 # if elements_list is empty
 if not elements_list:
  raise Exception('The Elements List is empty'     )

 # Set first element as Head
 UpperCAmelCase__           =       Node(elements_list[0]     )
 UpperCAmelCase__           =       head
 # Loop through elements from position 1
 for data in elements_list[1:]:
  UpperCAmelCase__           =       Node(snake_case__     )
  UpperCAmelCase__           =       current.next
 return head


_UpperCamelCase     =    [1, 3, 5, 32, 44, 12, 43]
print(F"""List: {list_data}""")
print('''Creating Linked List from List.''')
_UpperCamelCase     =    make_linked_list(list_data)
print('''Linked List:''')







print(linked_list)






from __future__ import annotations



class 					lowercase		:



 '''simple docstring'''


 def __init__(self , __a				)				->      None:






  """simple docstring"""





  UpperCAmelCase__           =       vertices
  UpperCAmelCase__           =       [[0] * vertices for _ in range(__a				)]




 def 						UpperCamelCase__							(self , __a				)				->      None:






  """simple docstring"""





  print('Vertex \t Distance from Source'				)
  for vertex in range(self.vertices				):
   print(__a , '\t\t' , distances_from_source[vertex]				)




 def 						UpperCamelCase__							(self , __a , __a				)				->      int:






  """simple docstring"""





  UpperCAmelCase__           =       1E7
  UpperCAmelCase__           =       0

  # Search not nearest vertex not in the shortest path tree
  for vertex in range(self.vertices				):
   if distances_from_source[vertex] < minimum and visited[vertex] is False:
    UpperCAmelCase__           =       distances_from_source[vertex]
    UpperCAmelCase__           =       vertex
  return min_index




 def 						UpperCamelCase__							(self , __a				)				->      None:






  """simple docstring"""





  UpperCAmelCase__           =       [int(1E7				)] * self.vertices  # distances from the source
  UpperCAmelCase__           =       0
  UpperCAmelCase__           =       [False] * self.vertices

  for _ in range(self.vertices				):
   UpperCAmelCase__           =       self.minimum_distance(__a , __a				)
   UpperCAmelCase__           =       True

   # Update dist value of the adjacent vertices
   # of the picked vertex only if the current
   # distance is greater than new distance and
   # the vertex in not in the shortest path tree
   for v in range(self.vertices				):
    if (
        self.graph[u][v] > 0
        and visited[v] is False
        and distances[v] > distances[u] + self.graph[u][v]
    ):
     UpperCAmelCase__           =       distances[u] + self.graph[u][v]

  self.print_solution(__a				)


if __name__ == "__main__":
 _UpperCamelCase     =    Graph(9)
 _UpperCamelCase     =    [
     [0, 4, 0, 0, 0, 0, 0, 8, 0],
     [4, 0, 8, 0, 0, 0, 0, 11, 0],
     [0, 8, 0, 7, 0, 4, 0, 0, 2],
     [0, 0, 7, 0, 9, 14, 0, 0, 0],
     [0, 0, 0, 9, 0, 10, 0, 0, 0],
     [0, 0, 4, 14, 10, 0, 2, 0, 0],
     [0, 0, 0, 0, 0, 2, 0, 1, 6],
     [8, 11, 0, 0, 0, 0, 1, 0, 7],
     [0, 0, 2, 0, 0, 0, 6, 7, 0],
 ]
 graph.dijkstra(0)



