





def       A__							(   SCREAMING_SNAKE_CASE__ , SCREAMING_SNAKE_CASE__)       ->   List[str]:
  print("""\nThe shortest path matrix using Floyd Warshall algorithm\n""")
  for i in range(SCREAMING_SNAKE_CASE__):
    for j in range(SCREAMING_SNAKE_CASE__):
      if dist[i][j] != float("""inf"""):
        print(int(dist[i][j]) , end="""\t""")
      else:
        print("""INF""" , end="""\t""")
    print()







def       A__							(   SCREAMING_SNAKE_CASE__ , SCREAMING_SNAKE_CASE__)       ->   Dict:
  __snake_case:						List[Any]			  =						[[float("""inf""") for _ in range(SCREAMING_SNAKE_CASE__)] for _ in range(SCREAMING_SNAKE_CASE__)]

  for i in range(SCREAMING_SNAKE_CASE__):
    for j in range(SCREAMING_SNAKE_CASE__):
      __snake_case:						str			  =						graph[i][j]

      # check vertex k against all other vertices (i, j)
  for k in range(SCREAMING_SNAKE_CASE__):
    # looping through rows of graph array
    for i in range(SCREAMING_SNAKE_CASE__):
      # looping through columns of graph array
      for j in range(SCREAMING_SNAKE_CASE__):
        if (
            dist[i][k] != float("""inf""")
            and dist[k][j] != float("""inf""")
            and dist[i][k] + dist[k][j] < dist[i][j]
        ):
          __snake_case:						Optional[int]			  =						dist[i][k] + dist[k][j]

  _print_dist(SCREAMING_SNAKE_CASE__ , SCREAMING_SNAKE_CASE__)
  return dist, v


if __name__ == "__main__":
      __UpperCAmelCase	:       int    	=							int(input("Enter number of vertices: "))
      __UpperCAmelCase	:       Optional[Any]    	=							int(input("Enter number of edges: "))

      __UpperCAmelCase	:       List[str]    	=							[[float("inf") for i in range(v)] for j in range(v)]

      for i in range(v):
            __UpperCAmelCase	:       Union[str, Any]    	=							0.0

            # src and dst are indices that must be within the array size graph[e][v]
            # failure to follow this will result in an error
      for i in range(e):
            print("\nEdge ", i + 1)
            __UpperCAmelCase	:       Optional[Any]    	=							int(input("Enter source:"))
            __UpperCAmelCase	:       Optional[int]    	=							int(input("Enter destination:"))
            __UpperCAmelCase	:       Union[str, Any]    	=							float(input("Enter weight:"))
            __UpperCAmelCase	:       str    	=							weight

      floyd_warshall(graph, v)

      # Example Input
      # Enter number of vertices: 3
      # Enter number of edges: 2

      # # generated graph from vertex and edge inputs
      # [[inf, inf, inf], [inf, inf, inf], [inf, inf, inf]]
      # [[0.0, inf, inf], [inf, 0.0, inf], [inf, inf, 0.0]]

      # specify source, destination and weight for edge #1
      # Edge  1
      # Enter source:1
      # Enter destination:2
      # Enter weight:2

      # specify source, destination and weight for edge #2
      # Edge  2
      # Enter source:2
      # Enter destination:1
      # Enter weight:1

      # # Expected Output from the vertice, edge and src, dst, weight inputs!!
      # 0		INF	INF
      # INF	0	2
      # INF	1	0













from __future__ import annotations

import numpy as np







def       A__							(   SCREAMING_SNAKE_CASE__)       ->   List[str]:
  return np.maximum(0 , SCREAMING_SNAKE_CASE__)


if __name__ == "__main__":
      print(np.array(relu([-1, 0, 5])))  # --> [0, 0, 5]






