number_of_isolates#
- number_of_isolates(G)[source]#
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:
- GNetworkX graph
- Returns:
- int
The number of degree zero nodes in the graph
G.
Additional backends implement this function
cugraph : GPU-accelerated backend.
graphblas : OpenMP-enabled sparse linear algebra backend.
- parallelParallel backend for NetworkX algorithms
The parallel computation is implemented by dividing the list of isolated nodes into chunks and then finding the length of each chunk in parallel and then adding all the lengths at the end.
[Source]