


"""simple docstring"""






from collections import defaultdict

from graphs.minimum_spanning_tree_prims import prisms_algorithm as mst
def       A_   (   ):






     """simple docstring"""

     _a	,      _a    	=				9, 14  # noqa: F841
     _a    	=				[
         [0, 1, 4],
         [0, 7, 8],
         [1, 2, 8],
         [7, 8, 7],
         [7, 6, 1],
         [2, 8, 2],
         [8, 6, 6],
         [2, 3, 7],
         [2, 5, 4],
         [6, 5, 2],
         [3, 5, 14],
         [3, 4, 9],
         [5, 4, 10],
         [1, 7, 11],
     ]

     _a    	=				defaultdict(_lowerCAmelCase       )
     for nodea, nodea, cost in edges:
          adjancency[nodea].append([nodea, cost]       )
          adjancency[nodea].append([nodea, cost]       )

     _a    	=				mst(_lowerCAmelCase       )

     _a    	=				[
         [7, 6, 1],
         [2, 8, 2],
         [6, 5, 2],
         [0, 1, 4],
         [2, 5, 4],
         [2, 3, 7],
         [0, 7, 8],
         [3, 4, 9],
     ]

     for answer in expected:
          _a    	=				tuple(answer[:2]       )
          _a    	=				tuple(edge[::-1]       )
          assert edge in result or reverse in result



"""simple docstring"""






def       A_   (   _lowerCAmelCase     :					list,     _lowerCAmelCase     :					list,     _lowerCAmelCase     :					int       ):






     """simple docstring"""

     _a    	=				len(_lowerCAmelCase       )
     _a    	=				[[0] * n for i in range(_lowerCAmelCase       )]
     for i in range(_lowerCAmelCase       ):
          _a    	=				y_points[i]

     for i in range(2,     _lowerCAmelCase       ):
          for j in range(_lowerCAmelCase,     _lowerCAmelCase       ):
               _a    	=				(
                   (xa - x_points[j - i + 1]) * q[j][i - 1]
                   - (xa - x_points[j]) * q[j - 1][i - 1]
               ) / (x_points[j] - x_points[j - i + 1])

     return [q[n - 1][n - 1], q]


if __name__ == "__main__":
   import doctest

   doctest.testmod()