


"""simple docstring"""






from __future__ import annotations


def __lowercase     (      lowerCamelCase_  :      dict						,					lowerCamelCase_  :      str  ):
				SCREAMING_SNAKE_CASE__							,      SCREAMING_SNAKE_CASE__     							=				set(lowerCamelCase_  ), [start]

				while stack:
								SCREAMING_SNAKE_CASE__     							=				stack.pop()
								explored.add(lowerCamelCase_  )
								# Differences from BFS:
								# 1) pop last element instead of first one
								# 2) add adjacent elements to stack without exploring them
								for adj in reversed(graph[v]  ):
												if adj not in explored:
																stack.append(lowerCamelCase_  )
				return explored


_lowerCamelCase     =  {
    'A': ['B', 'C', 'D'],
    'B': ['A', 'D', 'E'],
    'C': ['A', 'F'],
    'D': ['B', 'D'],
    'E': ['B', 'F'],
    'F': ['C', 'E', 'G'],
    'G': ['F'],
}

if __name__ == "__main__":
	import doctest

	doctest.testmod()
	print(depth_first_search(G, 'A'))




"""simple docstring"""






def __lowercase     (      lowerCamelCase_  :      Tuple  ):
				SCREAMING_SNAKE_CASE__     							=				[]
				SCREAMING_SNAKE_CASE__     							=				[]
				SCREAMING_SNAKE_CASE__     							=				{
				    "^": 3,
				    "*": 2,
				    "/": 2,
				    "%": 2,
				    "+": 1,
				    "-": 1,
				}  # Priority of each operator
				SCREAMING_SNAKE_CASE__     							=				len(lowerCamelCase_  ) if (len(lowerCamelCase_  ) > 7) else 7

				# Print table header for output
				print(
				    "Symbol".center(8  )						,					"Stack".center(lowerCamelCase_  )						,					"Postfix".center(lowerCamelCase_  )						,					sep=" | "						,					)
				print("-" * (print_width * 3 + 7)  )

				for x in infix:
								if x.isalpha() or x.isdigit():
												post_fix.append(lowerCamelCase_  )  # if x is Alphabet / Digit, add it to Postfix
								elif x == "(":
												stack.append(lowerCamelCase_  )  # if x is "(" push to Stack
								elif x == ")":  # if x is ")" pop stack until "(" is encountered
												while stack[-1] != "(":
																post_fix.append(stack.pop()  )  # Pop stack & add the content to Postfix
												stack.pop()
								else:
												if len(lowerCamelCase_  ) == 0:
																stack.append(lowerCamelCase_  )  # If stack is empty, push x to stack
												else:  # while priority of x is not > priority of element in the stack
																while len(lowerCamelCase_  ) > 0 and priority[x] <= priority[stack[-1]]:
																				post_fix.append(stack.pop()  )  # pop stack & add to Postfix
																stack.append(lowerCamelCase_  )  # push x to stack

								print(
								    x.center(8  )						,					("".join(lowerCamelCase_  )).ljust(lowerCamelCase_  )						,					("".join(lowerCamelCase_  )).ljust(lowerCamelCase_  )						,					sep=" | "						,					)  # Output in tabular format

				while len(lowerCamelCase_  ) > 0:  # while stack is not empty
								post_fix.append(stack.pop()  )  # pop stack & add to Postfix
								print(
								    " ".center(8  )						,					("".join(lowerCamelCase_  )).ljust(lowerCamelCase_  )						,					("".join(lowerCamelCase_  )).ljust(lowerCamelCase_  )						,					sep=" | "						,					)  # Output in tabular format

				return "".join(lowerCamelCase_  )  # return Postfix as str


def __lowercase     (      lowerCamelCase_  :      str  ):
				SCREAMING_SNAKE_CASE__     							=				list(infix[::-1]  )  # reverse the infix equation

				for i in range(len(lowerCamelCase_  )  ):
								if infix[i] == "(":
												SCREAMING_SNAKE_CASE__     							=				")"  # change "(" to ")"
								elif infix[i] == ")":
												SCREAMING_SNAKE_CASE__     							=				"("  # change ")" to "("

				return (infix_2_postfix("".join(lowerCamelCase_  )  ))[
				    ::-1
				]  # call infix_2_postfix on Infix, return reverse of Postfix


if __name__ == "__main__":
	_lowerCamelCase     =  input('\nEnter an Infix Equation = ')  # Input an Infix equation
	_lowerCamelCase     =  ''.join(Infix.split())  # Remove spaces from the input
	print('\n\t', Infix, '(Infix) -> ', infix_2_prefix(Infix), '(Prefix)')
