networkx.algorithms.hybrid.kl_connected_subgraph¶

kl_connected_subgraph
(G, k, l, low_memory=False, same_as_graph=False)[source]¶ Returns the maximum locally
(k, l)
connected subgraph ofG
.A graph is locally
(k, l)
connected if for each edge(u, v)
in the graph there are at leastl
edgedisjoint paths of length at mostk
joiningu
tov
. Parameters
G (NetworkX graph) – The graph in which to find a maximum locally
(k, l)
connected subgraph.k (integer) – The maximum length of paths to consider. A higher number means a looser connectivity requirement.
l (integer) – The number of edgedisjoint 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.
same_as_graph (bool) – If True then return a tuple of the form
(H, is_same)
, whereH
is the maximum locally(k, l)
connected subgraph andis_same
is a Boolean representing whetherG
is locally(k, l)
connected (and hence, whetherH
is simply a copy of the input graphG
).
 Returns
If
same_as_graph
is True, then this function returns a twotuple as described above. Otherwise, it returns only the maximum locally(k, l)
connected subgraph. Return type
NetworkX graph or twotuple
See also
References