fnss.topologies.topology.DirectedTopology.nodes_with_selfloops¶
-
DirectedTopology.
nodes_with_selfloops
()¶ Return a list of nodes with self loops.
A node with a self loop has an edge with both ends adjacent to that node.
Returns: nodelist : list
A list of nodes with self loops.
See also
Examples
>>> G = nx.Graph() # or DiGraph, MultiGraph, MultiDiGraph, etc >>> G.add_edge(1,1) >>> G.add_edge(1,2) >>> G.nodes_with_selfloops() [1]