NetworkX
1.9.1
Overview
Download
Installing
Tutorial
Reference
Introduction
Graph types
Algorithms
Functions
Graph generators
Atlas
Classic
Small
Random Graphs
Degree Sequence
Random Clustered
Directed
Geometric
Hybrid
kl_connected_subgraph
is_kl_connected
Bipartite
Line Graph
Ego Graph
Stochastic
Intersection
Social Networks
Linear algebra
Converting to and from other data formats
Relabeling nodes
Reading and writing graphs
Drawing
Exceptions
Utilities
License
Citing
Credits
Glossary
Reference
Overview
Introduction
Graph types
Algorithms
Functions
Graph generators
Atlas
Classic
Small
Random Graphs
Degree Sequence
Random Clustered
Directed
Geometric
Hybrid
Bipartite
Line Graph
Ego Graph
Stochastic
Intersection
Social Networks
Linear algebra
Converting to and from other data formats
Reading and writing graphs
Drawing
Exceptions
Utilities
License
Citing
Credits
Glossary
Testing
Developer Guide
History
Bibliography
NetworkX Examples
NetworkX
Docs
»
Reference
»
Reference
»
Graph generators
»
is_kl_connected
is_kl_connected
¶
is_kl_connected
(
G
,
k
,
l
,
low_memory=False
)
[source]
¶
Returns True if G is kl connected.