edge_expansion(G, S, T=None, weight=None)

The edge expansion is the quotient of the cut size and the smaller of the cardinalities of the two sets. [1]

Parameters

G : NetworkX graph

S : collection

A collection of nodes in G.

T : collection

A collection of nodes in G.

weight : object

Edge attribute key to use as weight. If not specified, edges have weight one.

Returns

number

The edge expansion between the two sets S and T.

Returns the edge expansion between two node sets.

See Also

boundary_expansion

mixing_expansion

node_expansion

Examples

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

networkx.algorithms.cuts.conductance networkx.algorithms.cuts.normalized_cut_size networkx.algorithms.cuts.node_expansion networkx.algorithms.cuts.boundary_expansion networkx.algorithms.cuts.mixing_expansion networkx.algorithms.cuts.volume

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them

---

GitHub : /networkx/algorithms/cuts.py#227
type: <class 'function'>
Commit: