<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def _graph_successors(self, graph, node):
 """ Return the successors of a node in the graph. This method can be overriden in case there are special requirements with the graph and the successors. For example, when we are dealing with a control flow graph, we may not want to get the FakeRet successors. :param graph: The graph. :param node: The node of which we want to get the successors. :return: An iterator of successors. :rtype: iter """


        if self._graph_successors_func is not None:
            return self._graph_successors_func(graph, node)

        return graph.successors(node)