


'''simple docstring'''






def 	_A				(lowerCAmelCase__  :Union[str, Any]		)   ->  List[str]:




     '''simple docstring'''



     return [
         {
             0: [1, 2],
             1: [0, 2],
             2: [0, 1, 3, 5],
             3: [2, 4],
             4: [3],
             5: [2, 6, 8],
             6: [5, 7],
             7: [6, 8],
             8: [5, 7],
         },
         {
             0: [6],
             1: [9],
             2: [4, 5],
             3: [4],
             4: [2, 3],
             5: [2],
             6: [0, 7],
             7: [6],
             8: [],
             9: [1],
         },
         {
             0: [4],
             1: [6],
             2: [],
             3: [5, 6, 7],
             4: [0, 6],
             5: [3, 8, 9],
             6: [1, 3, 4, 7],
             7: [3, 6, 8, 9],
             8: [5, 7],
             9: [5, 7],
         },
         {
             0: [1, 3],
             1: [0, 2, 4],
             2: [1, 3, 4],
             3: [0, 2, 4],
             4: [1, 2, 3],
         },
     ][index]






def 	_A				(lowerCAmelCase__  :dict[int, list[int]]		)   ->  list[tuple[int, int]]:




     '''simple docstring'''



     _a			      =							0
     _a			      =							len(lowerCAmelCase__		)  # No of vertices in graph
     _a			      =							[0] * n
     _a			      =							[False] * n

     def dfs(lowerCAmelCase__  :Dict				,						lowerCAmelCase__  :str				,						lowerCAmelCase__  :Dict				,						lowerCAmelCase__  :Union[str, Any]		):
          _a			      =							True
          _a			      =							id_
          id_ += 1
          for to in graph[at]:
               if to == parent:
                    pass
               elif not visited[to]:
                    dfs(lowerCAmelCase__				,						lowerCAmelCase__				,						lowerCAmelCase__				,						id_		)
                    _a			      =							min(low[at]				,						low[to]		)
                    if id_ <= low[to]:
                         bridges.append((at, to) if at < to else (to, at)		)
               else:
                    # This edge is a back edge and cannot be a bridge
                    _a			      =							min(low[at]				,						low[to]		)

     _a			      =							[]
     for i in range(lowerCAmelCase__		):
          if not visited[i]:
               dfs(lowerCAmelCase__				,						-1				,						lowerCAmelCase__				,						id_		)
     return bridges


if __name__ == "__main__":
 import doctest

 doctest.testmod()





'''simple docstring'''






class  a     :
 def __init__( self						)					->							List[Any]:
      _a			      =							''
      _a			      =							''
      _a			      =							[]
 def 							__UpperCAmelCase		( self      ,				__magic_name__      ,				__magic_name__						)					->							int:
      if m == -1:
           return n + 1
      elif n == -1:
           return m + 1
      elif self.dp[m][n] > -1:
           return self.dp[m][n]
      else:
           if self.worda[m] == self.worda[n]:
                _a			      =							self.__min_dist_top_down_dp(m - 1      ,				n - 1						)
           else:
                _a			      =							self.__min_dist_top_down_dp(__magic_name__      ,				n - 1						)
                _a			      =							self.__min_dist_top_down_dp(m - 1      ,				__magic_name__						)
                _a			      =							self.__min_dist_top_down_dp(m - 1      ,				n - 1						)
                _a			      =							1 + min(__magic_name__      ,				__magic_name__      ,				__magic_name__						)

           return self.dp[m][n]
 def 							__UpperCAmelCase		( self      ,				__magic_name__      ,				__magic_name__						)					->							int:
      _a			      =							worda
      _a			      =							worda
      _a			      =							[[-1 for _ in range(len(__magic_name__						)						)] for _ in range(len(__magic_name__						)						)]

      return self.__min_dist_top_down_dp(len(__magic_name__						) - 1      ,				len(__magic_name__						) - 1						)




 def 							__UpperCAmelCase		( self      ,				__magic_name__      ,				__magic_name__						)					->							int:
      _a			      =							worda
      _a			      =							worda
      _a			      =							len(__magic_name__						)
      _a			      =							len(__magic_name__						)
      _a			      =							[[0 for _ in range(n + 1						)] for _ in range(m + 1						)]

      for i in range(m + 1						):
           for j in range(n + 1						):
                if i == 0:  # first string is empty
                     _a			      =							j
                elif j == 0:  # second string is empty
                     _a			      =							i
                elif worda[i - 1] == worda[j - 1]:  # last characters are equal
                     _a			      =							self.dp[i - 1][j - 1]
                else:
                     _a			      =							self.dp[i][j - 1]
                     _a			      =							self.dp[i - 1][j]
                     _a			      =							self.dp[i - 1][j - 1]
                     _a			      =							1 + min(__magic_name__      ,				__magic_name__      ,				__magic_name__						)
      return self.dp[m][n]


if __name__ == "__main__":
 a_					:    Dict          =    EditDistance()

 print("****************** Testing Edit Distance DP Algorithm ******************")
 print()

 a_					:    Tuple          =    input("Enter the first string: ").strip()
 a_					:    Dict          =    input("Enter the second string: ").strip()

 print()
 print(f'''The minimum edit distance is: {solver.min_dist_top_down(Sa, Sa)}''')
 print(f'''The minimum edit distance is: {solver.min_dist_bottom_up(Sa, Sa)}''')
 print()
 print("*************** End of Testing Edit Distance DP Algorithm ***************")

