






"""simple docstring"""






from __future__ import annotations

from typing import Any



def 			__lowerCamelCase       (       lowerCAmelCase__					):
				create_state_space_tree(lowercase_							,[]							,0					)



def 			__lowerCamelCase       (       lowerCAmelCase__							,lowerCAmelCase__							,lowerCAmelCase__					):

				if index == len(lowercase_					):
								print(lowercase_					)
								return

				create_state_space_tree(lowercase_							,lowercase_							,index + 1					)
				current_subsequence.append(sequence[index]					)
				create_state_space_tree(lowercase_							,lowercase_							,index + 1					)
				current_subsequence.pop()


if __name__ == "__main__":
					SCREAMING_SNAKE_CASE    :    list[Any]        =							[3, 1, 2, 4]
					generate_all_subsequences(seq)

					seq.clear()
					seq.extend(['''A''', '''B''', '''C'''])
					generate_all_subsequences(seq)





import argparse
import copy

def 		UpperCamelCase   (lowercase_:					Any   )	-> Union[str, Any]:
	A__				:       int	  =						{}

	with open(lowercase_   ) as f:
		for line in f:
			if line.split()[0] not in dict_of_neighbours:
				A__				:       int	  =						[]
				_list.append([line.split()[1], line.split()[2]]   )
				A__				:       Any	  =						_list
			else:
				dict_of_neighbours[line.split()[0]].append(
				    [line.split()[1], line.split()[2]]   )
			if line.split()[1] not in dict_of_neighbours:
				A__				:       Optional[int]	  =						[]
				_list.append([line.split()[0], line.split()[2]]   )
				A__				:       Any	  =						_list
			else:
				dict_of_neighbours[line.split()[1]].append(
				    [line.split()[0], line.split()[2]]   )

	return dict_of_neighbours

def 		UpperCamelCase   (lowercase_:					Tuple       , lowercase_:					List[str]   )	-> Tuple:

	with open(lowercase_   ) as f:
		A__				:       List[Any]	  =						f.read(1   )
	A__				:       Union[str, Any]	  =						start_node

	A__				:       List[Any]	  =						[]

	A__				:       str	  =						start_node

	A__				:       List[str]	  =						0
	while visiting not in first_solution:
		A__				:       Dict	  =						10000
		for k in dict_of_neighbours[visiting]:
			if int(k[1]   ) < int(lowercase_   ) and k[0] not in first_solution:
				A__				:       Tuple	  =						k[1]
				A__				:       Optional[Any]	  =						k[0]

		first_solution.append(lowercase_   )
		A__				:       Optional[int]	  =						distance_of_first_solution + int(lowercase_   )
		A__				:       str	  =						best_node

	first_solution.append(lowercase_   )

	A__				:       Any	  =						0
	for k in dict_of_neighbours[first_solution[-2]]:
		if k[0] == start_node:
			break
		position += 1

	A__				:       int	  =						(
	    distance_of_first_solution
	    + int(dict_of_neighbours[first_solution[-2]][position][1]   )
	    - 10000
	)
	return first_solution, distance_of_first_solution

def 		UpperCamelCase   (lowercase_:					Any       , lowercase_:					str   )	-> Any:
	A__				:       int	  =						[]

	for n in solution[1:-1]:
		A__				:       Union[str, Any]	  =						solution.index(lowercase_   )
		for kn in solution[1:-1]:
			A__				:       List[Any]	  =						solution.index(lowercase_   )
			if n == kn:
				continue

			A__				:       Union[str, Any]	  =						copy.deepcopy(lowercase_   )
			A__				:       int	  =						kn
			A__				:       Optional[int]	  =						n

			A__				:       Dict	  =						0

			for k in _tmp[:-1]:
				A__				:       Dict	  =						_tmp[_tmp.index(lowercase_   ) + 1]
				for i in dict_of_neighbours[k]:
					if i[0] == next_node:
						A__				:       List[Any]	  =						distance + int(i[1]   )
			_tmp.append(lowercase_   )

			if _tmp not in neighborhood_of_solution:
				neighborhood_of_solution.append(_tmp   )

	A__				:       Optional[Any]	  =						len(neighborhood_of_solution[0]   ) - 1

	neighborhood_of_solution.sort(key=lambda lowercase_   : x[index_of_last_item_in_the_list]   )
	return neighborhood_of_solution

def 		UpperCamelCase   (lowercase_:					List[str]       , lowercase_:					Tuple       , lowercase_:					Dict       , lowercase_:					Dict       , lowercase_:					Tuple   )	-> Union[str, Any]:
	A__				:       Union[str, Any]	  =						1
	A__				:       List[str]	  =						first_solution
	A__				:       Dict	  =						[]
	A__				:       Union[str, Any]	  =						distance_of_first_solution
	A__				:       Any	  =						solution

	while count <= iters:
		A__				:       Optional[int]	  =						find_neighborhood(lowercase_       , lowercase_   )
		A__				:       Union[str, Any]	  =						0
		A__				:       str	  =						neighborhood[index_of_best_solution]
		A__				:       int	  =						len(lowercase_   ) - 1

		A__				:       List[str]	  =						False
		while not found:
			A__				:       Dict	  =						0
			while i < len(lowercase_   ):
				if best_solution[i] != solution[i]:
					A__				:       Any	  =						best_solution[i]
					A__				:       Optional[int]	  =						solution[i]
					break
				A__				:       Any	  =						i + 1

			if [first_exchange_node, second_exchange_node] not in tabu_list and [
			    second_exchange_node,
			    first_exchange_node,
			] not in tabu_list:
				tabu_list.append([first_exchange_node, second_exchange_node]   )
				A__				:       List[str]	  =						True
				A__				:       List[Any]	  =						best_solution[:-1]
				A__				:       Optional[Any]	  =						neighborhood[index_of_best_solution][best_cost_index]
				if cost < best_cost:
					A__				:       Tuple	  =						cost
					A__				:       int	  =						solution
			else:
				A__				:       List[Any]	  =						index_of_best_solution + 1
				A__				:       Tuple	  =						neighborhood[index_of_best_solution]

		if len(lowercase_   ) >= size:
			tabu_list.pop(0   )

		A__				:       Any	  =						count + 1

	return best_solution_ever, best_cost

def 		UpperCamelCase   (lowercase_:					Union[str, Any]=None   )	-> List[str]:
	A__				:       Union[str, Any]	  =						generate_neighbours(args.File   )

	A__  ,  A__				:       int	  =						generate_first_solution(
	    args.File       , lowercase_   )

	A__  ,  A__				:       str	  =						tabu_search(
	    lowercase_       , lowercase_       , lowercase_       , args.Iterations       , args.Size       , )

	print(f"""Best solution: {best_sol}, with total distance: {best_cost}."""   )


if __name__ == "__main__":
	A_			:					str    			=     argparse.ArgumentParser(description='Tabu Search')
	parser.add_argument(
	    '-f',
	    '--File',
	    type=str,
	    help='Path to the file containing the data',
	    required=True,
	)
	parser.add_argument(
	    '-i',
	    '--Iterations',
	    type=int,
	    help='How many iterations the algorithm should perform',
	    required=True,
	)
	parser.add_argument(
	    '-s', '--Size', type=int, help='Size of the tabu list', required=True
	)

	# Pass the arguments to main method
	main(parser.parse_args())



