Warning
This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
number_of_selfloops¶
- DiGraph.number_of_selfloops()¶
Return the number of selfloop edges.
A selfloop edge has the same node at both ends.
Returns : nloops : int
The number of selfloops.
See also
Examples
>>> G=nx.Graph() # or DiGraph, MultiGraph, MultiDiGraph, etc >>> G.add_edge(1,1) >>> G.add_edge(1,2) >>> G.number_of_selfloops() 1