Note

This documents the development version of NetworkX. Documentation for the current release can be found here.

networkx.algorithms.cuts.conductance

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
GNetworkX graph
Scollection

A collection of nodes in G.

Tcollection

A collection of nodes in G.

weightobject

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.

References

1

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