3.3.3.9. networkx.DiGraph.successors¶

DiGraph.successors(n)[source]¶

Return an iterator over successor nodes of n.

neighbors() and successors() are the same.