<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def predecessors(self, node, graph=None):
 """ Returns a list of all predecessors of the given node """

        if graph is None:
            graph = self.graph
        return [key for key in graph if node in graph[key]]