is_kl_connected(G, k, l, low_memory=False)
A graph is locally :None:None:`(k, l)`-connected if for each edge :None:None:`(u, v)` in the graph there are at least l edge-disjoint paths of length at most k joining :None:None:`u` to :None:None:`v`.
The graph to test for local :None:None:`(k, l)`-connectedness.
The maximum length of paths to consider. A higher number means a looser connectivity requirement.
The number of edge-disjoint paths. A higher number means a stricter connectivity requirement.
If this is True, this function uses an algorithm that uses slightly more time but less memory.
Whether the graph is locally :None:None:`(k, l)`-connected subgraph.
Returns True if and only if G is locally :None:None:`(k, l)`-connected.
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.hybrid.kl_connected_subgraph
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