

"""simple docstring"""


from __future__ import annotations

from typing import Any



def   _A					(	_a	:						list				):



      """simple docstring"""






      if not postfix_notation:
            return 0

      A				  =		{"""+""", """-""", """*""", """/"""}
      A				  =		[]

      for token in postfix_notation:
            if token in operations:
                  A  ,			A				  =		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(_a				)				)

      return stack.pop()


if __name__ == "__main__":
  import doctest

  doctest.testmod()







"""simple docstring"""


class lowerCamelCase__   :



    '''simple docstring'''




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




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




    def UpperCamelCase__		( self ,lowerCamelCase_ ,lowerCamelCase_    )    ->      None:
          # check if vertex is already present,
          if from_vertex in self.vertex:
                self.vertex[from_vertex].append(lowerCamelCase_    )
          else:
                # else make a new vertex
                A				  =		[to_vertex]




    def UpperCamelCase__		( self    )    ->      None:
          # visited array for storing already visited nodes
          A				  =		[False] * len(self.vertex    )

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




    def UpperCamelCase__		( self ,lowerCamelCase_ ,lowerCamelCase_    )    ->      None:
          # mark start vertex as visited
          A				  =		True

          print(lowerCamelCase_ ,end=""" """    )

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


if __name__ == "__main__":
  UpperCAmelCase													=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




