+ )iRt^RIt.ROt]PR4t]PR4t]PR4tR#)z8 Functions for identifying isolate (degree zero) nodes. Nc*VPV4^8H#)aDetermines whether a node is an isolate. 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. Parameters ---------- G : NetworkX graph n : node A node in `G`. Returns ------- is_isolate : bool True if and only if `n` has no neighbors. Examples -------- >>> G = nx.Graph() >>> G.add_edge(1, 2) >>> G.add_node(3) >>> nx.is_isolate(G, 2) False >>> nx.is_isolate(G, 3) True degree)Gns&&Y/var/www/html/photoedit/myenv/lib/python3.14/site-packages/networkx/algorithms/isolate.py is_isolater s< 88A;! c0RVP44#)a&Iterator over isolates in the graph. 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. Parameters ---------- G : NetworkX graph Returns ------- iterator An iterator over the isolates of `G`. Examples -------- To get a list of all isolates of a graph, use the :class:`list` constructor: >>> G = nx.Graph() >>> G.add_edge(1, 2) >>> G.add_node(3) >>> list(nx.isolates(G)) [3] To remove all isolates in the graph, first create a list of the isolates, then use :meth:`Graph.remove_nodes_from`: >>> G.remove_nodes_from(list(nx.isolates(G))) >>> list(G) [1, 2] For digraphs, isolates have zero in-degree and zero out_degree: >>> G = nx.DiGraph([(0, 1), (1, 2)]) >>> G.add_node(3) >>> list(nx.isolates(G)) [3] c3<"TFwrV^8XgKVxK R#5i)N).0rds& r isolates..Vs /*$!QAA*s  rrs&risolatesr+sV 0!((* //r c8\R\V444#)a0Returns the number of isolates in the graph. 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. Parameters ---------- G : NetworkX graph Returns ------- int The number of degree zero nodes in the graph `G`. c3&"TFp^xK R#5i)Nr )rvs& rr%number_of_isolates..ks&+Qq+s)sumrrs&rnumber_of_isolatesrYs$ &(1+& &&r )rrr)__doc__networkxnx__all__ _dispatchablerrrr r rr sd :@*0*0Z''r