is_isolate(G, n)
An isolate is a node with no neighbors (that is, with degree zero). For directed graphs, this means no in-neighbors and no out-neighbors.
True if and only if n has no neighbors.
Determines whether a node is an isolate.
>>> G = nx.Graph()
... G.add_edge(1, 2)
... G.add_node(3)
... nx.is_isolate(G, 2) False
>>> nx.is_isolate(G, 3) TrueSee :
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.isolate.is_isolate
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them