



'''simple docstring'''





from __future__ import annotations




def lowerCAmelCase  (__A  ,	__A  ,	__A  ,	):



     """simple docstring"""



     if (stress, tangential_force, area).count(0) != 1:
          raise ValueError('''You cannot supply more or less than 2 values''')
     elif stress < 0:
          raise ValueError('''Stress cannot be negative''')
     elif tangential_force < 0:
          raise ValueError('''Tangential Force cannot be negative''')
     elif area < 0:
          raise ValueError('''Area cannot be negative''')
     elif stress == 0:
          return (
              "stress",
              tangential_force / area,
          )
     elif tangential_force == 0:
          return (
              "tangential_force",
              stress * area,
          )
     else:
          return (
              "area",
              tangential_force / stress,
          )


if __name__ == "__main__":
  import doctest

  doctest.testmod()








'''simple docstring'''





import math






class __A			:



 '''simple docstring'''







 def __init__(self ,   A=0       )    ->     Dict:  # a graph with Node 0,1,...,N-1


      """simple docstring"""



      _a      =  n
      _a      =  [
          [math.inf for j in range(0 ,   A       )] for i in range(0 ,   A       )
      ]  # adjacency matrix for weight
      _a      =  [
          [math.inf for j in range(0 ,   A       )] for i in range(0 ,   A       )
      ]  # dp[i][j] stores minimum distance from i to j



 def 					a__  (self ,   A ,   A ,   A       )    ->     Tuple:


      """simple docstring"""



      _a      =  w



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


      """simple docstring"""



      for k in range(0 ,   self.n       ):
           for i in range(0 ,   self.n       ):
                for j in range(0 ,   self.n       ):
                     _a      =  min(self.dp[i][j] ,   self.dp[i][k] + self.dp[k][j]       )



 def 					a__  (self ,   A ,   A       )    ->     str:


      """simple docstring"""



      return self.dp[u][v]


if __name__ == "__main__":
  lowercase_		       =  Graph(5)
  graph.add_edge(0, 2, 9)
  graph.add_edge(0, 4, 10)
  graph.add_edge(1, 3, 5)
  graph.add_edge(2, 3, 7)
  graph.add_edge(3, 0, 10)
  graph.add_edge(3, 1, 2)
  graph.add_edge(3, 2, 1)
  graph.add_edge(3, 4, 6)
  graph.add_edge(4, 1, 3)
  graph.add_edge(4, 2, 4)
  graph.add_edge(4, 3, 9)
  graph.floyd_warshall()
  graph.show_min(1, 4)
  graph.show_min(0, 3)



