is_kl_connected(G, k, l, low_memory=False)¶
Trueif and only if
Gis locally -connected.
A graph is locally -connected if for each edge in the graph there are at least edge-disjoint paths of length at most joining to .
- G (NetworkX graph) – The graph to test for local -connectedness.
- k (integer) – The maximum length of paths to consider. A higher number means a looser connectivity requirement.
- l (integer) – The number of edge-disjoint paths. A higher number means a stricter connectivity requirement.
- low_memory (bool) – If this is
True, this function uses an algorithm that uses slightly more time but less memory.
Whether the graph is locally -connected subgraph.