Returns an iterator over successor nodes of n.
A successor of n is a node m such that there exists a directed edge from n to m.
A node in the graph
If n is not in the graph.
neighbors() and successors() are the same.