(self, node, excluding_fakeret=True)
return successors
Get a list of tuples where the first element is the successor of the CFG node and the second element is the
        jumpkind of the successor.

        :param CFGNode node:            The node.
        :param bool excluding_fakeret:  True if you want to exclude all successors that are fall-through successors.
        :return:                        A list of successors and their corresponding jumpkinds.
        :rtype:                         list
Get a list of tuples where the first element is the successor of the CFG node and the second element is the
        jumpkind of the successor.
Get a list of tuples where the first element is the successor of the CFG node and the second element is the jumpkind of the successor .
def get_successors_and_jumpkinds(self, node, excluding_fakeret=True):
        """
        Get a list of tuples where the first element is the successor of the CFG node and the second element is the
        jumpkind of the successor.

        :param CFGNode node:            The node.
        :param bool excluding_fakeret:  True if you want to exclude all successors that are fall-through successors.
        :return:                        A list of successors and their corresponding jumpkinds.
        :rtype:                         list
        """

        successors = []
        for _, suc, data in self.graph.out_edges([node], data=True):
            if not excluding_fakeret or data['jumpkind'] != 'Ijk_FakeRet':
                successors.append((suc, data['jumpkind']))
        return successors
def get_successors_and_jumpkinds ( self , node , excluding_fakeret = True ) : successors = [ ] for _ , suc , data in self . graph . out_edges ( [ node ] , data = True ) : if not excluding_fakeret or data [ 'jumpkind' ] != 'Ijk_FakeRet' : successors . append ( ( suc , data [ 'jumpkind' ] ) ) return successors