



'''simple docstring'''
from __future__ import annotations

from typing import Any






def A__    (     UpperCAmelCase_							):
						if not postfix_notation:
												return 0

						_UpperCamelCase					:		Optional[Any] 				=   {'+', '-', '*', '/'}
						_UpperCamelCase					:		list[Any] 				=   []

						for token in postfix_notation:
												if token in operations:
																		_UpperCamelCase				,			_UpperCamelCase					:		int 				=   stack.pop(), stack.pop()
																		if token == "+":
																								stack.append(a + b							)
																		elif token == "-":
																								stack.append(a - b							)
																		elif token == "*":
																								stack.append(a * b							)
																		else:
																								if a * b < 0 and a % b != 0:
																														stack.append(a // b + 1							)
																								else:
																														stack.append(a // b							)
												else:
																		stack.append(int(UpperCAmelCase_							)							)

						return stack.pop()


if __name__ == "__main__":
					import doctest

					doctest.testmod()




class  lowerCamelCase__							:




	'''simple docstring'''




	def __init__(					self		:int						)		-> Dict:
								__UpperCamelCase	:   Union[str, Any]			   =					{}







	def    _lowerCamelCase				(					self		:str						)		-> None:
								print(self.vertex						)
								for i in self.vertex:
															print(a     ,   " -> "     ,   " -> ".join([str(a						) for j in self.vertex[i]]						)						)







	def    _lowerCamelCase				(					self		:List[Any]     ,   a		:int     ,   a		:int						)		-> None:
								# check if vertex is already present,
								if from_vertex in self.vertex:
															self.vertex[from_vertex].append(a						)
								else:
															# else make a new vertex
															__UpperCamelCase	:   Optional[Any]			   =					[to_vertex]







	def    _lowerCamelCase				(					self		:Tuple						)		-> None:
								# visited array for storing already visited nodes
								__UpperCamelCase	:   Dict			   =					[False] * len(self.vertex						)

								# call the recursive helper function
								for i in range(len(self.vertex						)						):
															if not visited[i]:
																						self.dfs_recursive(a     ,   a						)







	def    _lowerCamelCase				(					self		:Any     ,   a		:int     ,   a		:list						)		-> None:
								# mark start vertex as visited
								__UpperCamelCase	:   int			   =					True

								print(a     ,   end=" "						)

								# Recur for all the vertices that are adjacent to this node
								for i in self.vertex:
															if not visited[i]:
																						self.dfs_recursive(a     ,   a						)


if __name__ == "__main__":
		lowercase  :					Dict													=       Graph()
		g.add_edge(0, 1)
		g.add_edge(0, 2)
		g.add_edge(1, 2)
		g.add_edge(2, 0)
		g.add_edge(2, 3)
		g.add_edge(3, 3)

		g.print_graph()
		print('DFS:')
		g.dfs()

		# OUTPUT:
		# 0  ->  1 -> 2
		# 1  ->  2
		# 2  ->  0 -> 3
		# 3  ->  3
		# DFS:
		#  0 1 2 3