


from __future__ import annotations



def 							UpperCamelCase_( lowerCamelCase_				,					lowerCamelCase_					)       ->		Any:
    print(F'''Vertex\tShortest Distance from vertex {src}'''					)
    for i, d in enumerate(lowerCamelCase_					):
        print(F'''{i}\t\t{d}'''					)



def 							UpperCamelCase_( lowerCamelCase_				,					lowerCamelCase_				,					lowerCamelCase_					)       ->		List[Any]:
    for j in range(lowerCamelCase_					):
        _lowercase						,							_lowercase						,							_lowercase			:				Dict 						=						(graph[j][k] for k in ['src', 'dst', 'weight'])
        if distance[u] != float('inf'					) and distance[u] + w < distance[v]:
            return True
    return False



def 							UpperCamelCase_( lowerCamelCase_				,					lowerCamelCase_				,					lowerCamelCase_				,					lowerCamelCase_					)       ->		list[float]:
    _lowercase			:				Optional[int] 						=						[float('inf'					)] * vertex_count
    _lowercase			:				str 						=						0.0

    for _ in range(vertex_count - 1					):
        for j in range(lowerCamelCase_					):
            _lowercase						,							_lowercase						,							_lowercase			:				Any 						=						(graph[j][k] for k in ['src', 'dst', 'weight'])

            if distance[u] != float('inf'					) and distance[u] + w < distance[v]:
                _lowercase			:				int 						=						distance[u] + w

    _lowercase			:				Dict 						=						check_negative_cycle(lowerCamelCase_				,					lowerCamelCase_				,					lowerCamelCase_					)
    if negative_cycle_exists:
        raise Exception('Negative cycle found'					)

    return distance


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 SCREAMING_SNAKE_CASE			: List[str]				   =					int(input("Enter number of vertices: ").strip())
 SCREAMING_SNAKE_CASE			: Union[str, Any]				   =					int(input("Enter number of edges: ").strip())

 SCREAMING_SNAKE_CASE			: list[dict[str, int]]				   =					[{} for _ in range(E)]

 for i in range(E):
  print("Edge ", i + 1)
  SCREAMING_SNAKE_CASE   , SCREAMING_SNAKE_CASE   , SCREAMING_SNAKE_CASE			: int				   =					(
      int(x)
      for x in input("Enter source, destination, weight: ").strip().split(" ")
  )
  SCREAMING_SNAKE_CASE			: List[Any]				   =					{"src": src, "dst": dest, "weight": weight}

 SCREAMING_SNAKE_CASE			: Any				   =					int(input("\nEnter shortest path source:").strip())
 SCREAMING_SNAKE_CASE			: Optional[Any]				   =					bellman_ford(graph, V, E, source)
 print_distance(shortest_distance, 0)






from __future__ import annotations

from math import pi

# Define the Reduced Planck Constant ℏ (H bar), speed of light C, value of
# Pi and the function
SCREAMING_SNAKE_CASE			: Union[str, Any]				   =					1.0_5457_1817E-34  # unit of ℏ : J * s

SCREAMING_SNAKE_CASE			: int				   =					3E8  # unit of c : m * s^-1



def 							UpperCamelCase_( lowerCamelCase_				,					lowerCamelCase_				,					lowerCamelCase_					)       ->		dict[str, float]:

    if (force, area, distance).count(0					) != 1:
        raise ValueError('One and only one argument must be 0'					)
    if force < 0:
        raise ValueError('Magnitude of force can not be negative'					)
    if distance < 0:
        raise ValueError('Distance can not be negative'					)
    if area < 0:
        raise ValueError('Area can not be negative'					)
    if force == 0:
        _lowercase			:				int 						=						(REDUCED_PLANCK_CONSTANT * SPEED_OF_LIGHT * pi**2 * area) / (
            240 * (distance) ** 4
        )
        return {"force": force}
    elif area == 0:
        _lowercase			:				List[Any] 						=						(240 * force * (distance) ** 4) / (
            REDUCED_PLANCK_CONSTANT * SPEED_OF_LIGHT * pi**2
        )
        return {"area": area}
    elif distance == 0:
        _lowercase			:				List[Any] 						=						(
            (REDUCED_PLANCK_CONSTANT * SPEED_OF_LIGHT * pi**2 * area) / (240 * force)
        ) ** (1 / 4)
        return {"distance": distance}
    raise ValueError('One and only one argument must be 0'					)


# Run doctest
if __name__ == "__main__":
 import doctest

 doctest.testmod()


