





def    __UpperCamelCase      (    a) ->list:
     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__":
      A_												=     list(range(1_0, 0, -1))
      print(f"""Original: {arr}. Sorted: {odd_even_transposition(arr)}""")








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





def    __UpperCamelCase      (    a,     a) ->Optional[int]:
					lowerCamelCase__       =       [[float("inf") for _ in range(a)] for _ in range(a)]

					for i in range(a):
										for j in range(a):
															lowerCamelCase__       =       graph[i][j]

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

					_print_dist(a,     a)
					return dist, v


if __name__ == "__main__":
						A_												=     int(input("Enter number of vertices: "))
						A_												=     int(input("Enter number of edges: "))

						A_												=     [[float("inf") for i in range(v)] for j in range(v)]

						for i in range(v):
												A_												=     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)
												A_												=     int(input("Enter source:"))
												A_												=     int(input("Enter destination:"))
												A_												=     float(input("Enter weight:"))
												A_												=     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

