code: def post_order(self):
          
          def _visit(n, cnt):
              visited.add(n)
              for suc in self.all_sucs(n):
                  if suc not in visited:
                      for cnt, s in _visit(suc, cnt):
                          yield cnt, s
              n.po = cnt
              yield cnt + 1, n
  
          visited = set()
          for _, node in _visit(self.entry, 1):
              yield node
docs: Yields the :class`~androguard.decompiler.dad.node.Node`s of the graph in post-order i.e we visit all the
          children of a node before visiting the node itself.