U 9v f ã@sDdZddlZdddgZejdd„ƒZejdd„ƒZejdd„ƒZdS) z8 Functions for identifying isolate (degree zero) nodes. éNÚ is_isolateÚisolatesÚnumber_of_isolatescCs| |¡dkS)a-Determines 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 r©Zdegree)ÚGÚn©rú?/tmp/pip-unpacked-wheel-_lngutwb/networkx/algorithms/isolate.pyr scCsdd„| ¡DƒS)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_degre:: >>> G = nx.DiGraph([(0, 1), (1, 2)]) >>> G.add_node(3) >>> list(nx.isolates(G)) [3] css|]\}}|dkr|VqdS)rNr)Ú.0rÚdrrr Ú Uszisolates..r©rrrr r*s+cCstdd„t|ƒDƒƒS)a\Returns 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`. css|] }dVqdS)éNr)r Úvrrr r ksz%number_of_isolates..)Úsumrr rrr rXs)Ú__doc__ZnetworkxZnxÚ__all__Ú _dispatchrrrrrrr Ús   -