NetworkX
1.11
Overview
Download
Installing
Tutorial
Reference
Introduction
Graph types
Algorithms
Functions
Graph generators
Atlas
Classic
balanced_tree
barbell_graph
complete_graph
complete_multipartite_graph
circular_ladder_graph
cycle_graph
dorogovtsev_goltsev_mendes_graph
empty_graph
grid_2d_graph
grid_graph
hypercube_graph
ladder_graph
lollipop_graph
null_graph
path_graph
star_graph
trivial_graph
wheel_graph
Expanders
Small
Random Graphs
Degree Sequence
Random Clustered
Directed
Geometric
Line Graph
Ego Graph
Stochastic
Intersection
Social Networks
Community
Non Isomorphic Trees
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
Expanders
Small
Random Graphs
Degree Sequence
Random Clustered
Directed
Geometric
Line Graph
Ego Graph
Stochastic
Intersection
Social Networks
Community
Non Isomorphic Trees
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
»
hypercube_graph
hypercube_graph
¶
hypercube_graph
(
n
)
[source]
¶
Return the n-dimensional hypercube.
Node labels are the integers 0 to 2**n - 1.