Note

This documents the development version of NetworkX. Documentation for the current release can be found here.

networkx.algorithms.hybrid.is_kl_connected

is_kl_connected(G, k, l, low_memory=False)[source]

Returns True if and only if G is locally (k, l)-connected.

A graph is locally (k, l)-connected if for each edge (u, v) in the graph there are at least l edge-disjoint paths of length at most k joining u to v.

Parameters
GNetworkX graph

The graph to test for local (k, l)-connectedness.

kinteger

The maximum length of paths to consider. A higher number means a looser connectivity requirement.

linteger

The number of edge-disjoint paths. A higher number means a stricter connectivity requirement.

low_memorybool

If this is True, this function uses an algorithm that uses slightly more time but less memory.

Returns
bool

Whether the graph is locally (k, l)-connected subgraph.

References

1

Chung, Fan and Linyuan Lu. “The Small World Phenomenon in Hybrid Power Law Graphs.” Complex Networks. Springer Berlin Heidelberg, 2004. 89–104.