(self, node: CFGNode,
                       excluding_fakeret: bool = True,
                       jumpkind: Optional[str] = None
                       )
return successors
Get successors of a node in the control flow graph.

        :param CFGNode node:                The node.
        :param bool excluding_fakeret:      True if you want to exclude all successors that is connected to the node
                                            with a fakeret edge.
        :param str or None jumpkind:        Only return successors with the specified jumpkind. This argument will be
                                            ignored if set to None.
        :return:                            A list of successors
        :rtype:                             list
Get successors of a node in the control flow graph.
Get successors of a node in the control flow graph .
def get_successors(self, node: CFGNode,
                       excluding_fakeret: bool = True,
                       jumpkind: Optional[str] = None
                       ) -> List[CFGNode]:
        """
        Get successors of a node in the control flow graph.

        :param CFGNode node:                The node.
        :param bool excluding_fakeret:      True if you want to exclude all successors that is connected to the node
                                            with a fakeret edge.
        :param str or None jumpkind:        Only return successors with the specified jumpkind. This argument will be
                                            ignored if set to None.
        :return:                            A list of successors
        :rtype:                             list
        """

        if jumpkind is not None:
            if excluding_fakeret and jumpkind == 'Ijk_FakeRet':
                return [ ]

        if not excluding_fakeret and jumpkind is None:
            # fast path
            if node in self.graph:
                return list(self.graph.successors(node))
            return [ ]

        successors = []
        for _, suc, data in self.graph.out_edges([node], data=True):
            jk = data['jumpkind']
            if jumpkind is not None:
                if jumpkind == jk:
                    successors.append(suc)
            elif excluding_fakeret:
                if jk != 'Ijk_FakeRet':
                    successors.append(suc)
            else:
                successors.append(suc)
        return successors
def get_successors ( self , node : CFGNode , excluding_fakeret : bool = True , jumpkind : Optional [ str ] = None ) -> List [ CFGNode ] : if jumpkind is not None : if excluding_fakeret and jumpkind == 'Ijk_FakeRet' : return [ ] if not excluding_fakeret and jumpkind is None : # fast path if node in self . graph : return list ( self . graph . successors ( node ) ) return [ ] successors = [ ] for _ , suc , data in self . graph . out_edges ( [ node ] , data = True ) : jk = data [ 'jumpkind' ] if jumpkind is not None : if jumpkind == jk : successors . append ( suc ) elif excluding_fakeret : if jk != 'Ijk_FakeRet' : successors . append ( suc ) else : successors . append ( suc ) return successors