'''simple docstring'''




from collections import defaultdict

from graphs.minimum_spanning_tree_prims import prisms_algorithm as mst

def 	UpperCamelCase_							(					)    ->    Tuple:


       """simple docstring"""







       _UpperCAmelCase      ,  _UpperCAmelCase     :  int							      =    9, 14  # noqa: F841
       _UpperCAmelCase     :  int							      =    [
           [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],
       ]

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

       _UpperCAmelCase     :  Tuple							      =    mst(_UpperCAmelCase    )

       _UpperCAmelCase     :  str							      =    [
           [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:
              _UpperCAmelCase     :  Union[str, Any]							      =    tuple(answer[:2]    )
              _UpperCAmelCase     :  Optional[Any]							      =    tuple(edge[::-1]    )
              assert edge in result or reverse in result







def 					lowerCamelCase__       (						A__       :					list	):





       '''simple docstring'''



       __lowerCamelCase   =						len(A__	)
       for _ in range(A__	):
              for i in range(_ % 2  ,			arr_size - 1  ,			2	):
                     if arr[i + 1] < arr[i]:
                            __lowerCamelCase,   __lowerCamelCase   =						arr[i + 1], arr[i]

       return arr


if __name__ == "__main__":
       UpperCAmelCase_									=	list(range(10, 0, -1))
       print(f"""Original: {arr}. Sorted: {odd_even_transposition(arr)}""")

