k_edge_subgraphs(self, k)
Refines the k-edge-ccs into k-edge-subgraphs. The running time is more than $O(
<SubstitutionRef: |value: '|V|' |>)$.
For single values of k it is faster to use :None:None:`nx.k_edge_subgraphs`. But for multiple values of k, it can be faster to build AuxGraph and then use this method.
Desired edge connectivity
Queries the auxiliary graph for k-edge-connected subgraphs.
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph
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