





import math




class  __UpperCamelCase						:





     def __init__(    self							,       _UpperCamelCase							,       _UpperCamelCase							,       _UpperCamelCase				):
        _UpperCAmelCase											=      x
        _UpperCAmelCase											=      y
        _UpperCAmelCase											=      z





     def __repr__(    self				):
        return f'''Point({self.x}, {self.y}, {self.z})'''




def     A__					(						SCREAMING_SNAKE_CASE_      :			Point							,  SCREAMING_SNAKE_CASE_      :			Point	)     ->     float:






   """simple docstring"""







   return math.sqrt(abs((b.x - a.x) ** 2 + (b.y - a.y) ** 2 + (b.z - a.z) ** 2	)	)


if __name__ == "__main__":
   import doctest

   doctest.testmod()






def     A__					(						SCREAMING_SNAKE_CASE_      :			Optional[int]							,  SCREAMING_SNAKE_CASE_      :			str	)     ->     List[str]:






   """simple docstring"""







   print('''\nVertex Distance'''	)
   for i in range(SCREAMING_SNAKE_CASE_	):
      if dist[i] != float('''inf'''	):
         print(SCREAMING_SNAKE_CASE_							,  '''\t'''							,  int(dist[i]	)							,  end='''\t'''	)
      else:
         print(SCREAMING_SNAKE_CASE_							,  '''\t'''							,  '''INF'''							,  end='''\t'''	)
      print()
def     A__					(						SCREAMING_SNAKE_CASE_      :			Any							,  SCREAMING_SNAKE_CASE_      :			Optional[Any]							,  SCREAMING_SNAKE_CASE_      :			str	)     ->     Any:






   """simple docstring"""







   _UpperCAmelCase											=      float('''inf'''	)
   _UpperCAmelCase											=      -1
   for i in range(SCREAMING_SNAKE_CASE_	):
      if (not vset[i]) and mdist[i] < min_val:
         _UpperCAmelCase											=      i
         _UpperCAmelCase											=      mdist[i]
   return min_ind
def     A__					(						SCREAMING_SNAKE_CASE_      :			str							,  SCREAMING_SNAKE_CASE_      :			Dict							,  SCREAMING_SNAKE_CASE_      :			int	)     ->     Any:






   """simple docstring"""







   _UpperCAmelCase											=      [float('''inf'''	) for _ in range(SCREAMING_SNAKE_CASE_	)]
   _UpperCAmelCase											=      [False for _ in range(SCREAMING_SNAKE_CASE_	)]
   _UpperCAmelCase											=      0.0

   for _ in range(v - 1	):
      _UpperCAmelCase											=      min_dist(SCREAMING_SNAKE_CASE_							,  SCREAMING_SNAKE_CASE_							,  SCREAMING_SNAKE_CASE_	)
      _UpperCAmelCase											=      True

      for i in range(SCREAMING_SNAKE_CASE_	):
         if (
             (not vset[i])
             and graph[u][i] != float('''inf'''	)
             and mdist[u] + graph[u][i] < mdist[i]
         ):
            _UpperCAmelCase											=      mdist[u] + graph[u][i]

   print_dist(SCREAMING_SNAKE_CASE_							,  SCREAMING_SNAKE_CASE_	)


if __name__ == "__main__":
   UpperCAmelCase_											=  int(input("Enter number of vertices: ").strip())
   UpperCAmelCase_											=  int(input("Enter number of edges: ").strip())

   UpperCAmelCase_											=  [[float("inf") for i in range(V)] for j in range(V)]

   for i in range(V):
      UpperCAmelCase_											=  0.0

   for i in range(E):
      print("\nEdge ", i + 1)
      UpperCAmelCase_											=  int(input("Enter source:").strip())
      UpperCAmelCase_											=  int(input("Enter destination:").strip())
      UpperCAmelCase_											=  float(input("Enter weight:").strip())
      UpperCAmelCase_											=  weight

   UpperCAmelCase_											=  int(input("\nEnter shortest path source:").strip())
   dijkstra(graph, V, gsrc)