
'''simple docstring'''
from graphs.minimum_spanning_tree_kruskal import kruskal






def      UpperCamelCase_				(      ):
	a_      				=						9
	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_      				=						kruskal(A__  ,      A__						)

	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],
	]

	assert sorted(A__						) == sorted(A__						)


'''simple docstring'''
from typing import Any







class   a_ :




			def __init__(       self					,   UpperCAmelCase	):
				a_      				=						data
				a_      				=						None







class   a_ :




			def __init__(       self	):
				a_      				=						None




			def 					lowerCAmelCase__					(       self	):
				a_      				=						self.head
				while temp is not None:
					print(temp.data					,   end=""" """	)
					a_      				=						temp.next
				print()




			def 					lowerCAmelCase__					(       self					,   UpperCAmelCase	):
				a_      				=						Node(UpperCAmelCase	)
				a_      				=						self.head
				a_      				=						new_node






			def 					lowerCAmelCase__					(       self					,   UpperCAmelCase					,   UpperCAmelCase	):
				if node_data_a == node_data_a:
					return
				else:
					a_      				=						self.head
					while node_a is not None and node_a.data != node_data_a:
						a_      				=						node_a.next

					a_      				=						self.head
					while node_a is not None and node_a.data != node_data_a:
						a_      				=						node_a.next

					if node_a is None or node_a is None:
						return

					a_				,  a_      				=						node_a.data, node_a.data


if __name__ == "__main__":
		lowercase__											=LinkedList()
		for i in range(5, 0, -1):
				ll.push(i)

		ll.print_list()

		ll.swap_nodes(1, 4)
		print('After swapping')
		ll.print_list()
