conductance(G, S, T=None, weight=None)¶
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. 
- G (NetworkX graph)
- S (sequence) – A sequence of nodes in
- T (sequence) – A sequence of nodes in
- weight (object) – Edge attribute key to use as weight. If not specified, edges have weight one.
The conductance between the two sets
 David Gleich. Hierarchical Directed Spectral Graph Partitioning. <https://www.cs.purdue.edu/homes/dgleich/publications/Gleich%202005%20-%20hierarchical%20directed%20spectral.pdf>