7.17.2. networkx.algorithms.cuts.conductance¶

networkx.algorithms.cuts.conductance(G, S, T=None, weight=None)[source]¶

Returns the conductance of two sets of nodes.

The conductance is the quotient of the cut size and the smaller of the volumes of the two sets. [1]

Parameters:	G : NetworkX graph S : sequence A sequence of nodes in G. T : sequence A sequence of nodes in G. weight : object Edge attribute key to use as weight. If not specified, edges have weight one.
Returns:	number The conductance between the two sets S and T.

See also

cut_size, edge_expansion, normalized_cut_size, volume

References

[R621]

David Gleich. Hierarchical Directed Spectral Graph Partitioning. <https://www.cs.purdue.edu/homes/dgleich/publications/Gleich%202005%20-%20hierarchical%20directed%20spectral.pdf>