Returns an iterator over predecessor nodes of n.
A predecessor of n is a node m such that there exists a directed edge from m to n.
A node in the graph
If n is not in the graph.
successors