- is_kl_connected(G, k, l, low_memory=False)[source]#
Returns True if and only if
A graph is locally
(k, l)-connected if for each edge
(u, v)in the graph there are at least
ledge-disjoint paths of length at most
- GNetworkX graph
The graph to test for local
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
(k, l)-connected subgraph.
Chung, Fan and Linyuan Lu. “The Small World Phenomenon in Hybrid Power Law Graphs.” Complex Networks. Springer Berlin Heidelberg, 2004. 89–104.