hypercube_graph(n)
The nodes are the integers between 0 and 2 ** n - 1
, inclusive.
For more information on the hypercube graph, see the Wikipedia article :None:None:`Hypercube graph`.
<Unimplemented 'target' '.. _Hypercube graph: https://en.wikipedia.org/wiki/Hypercube_graph'>
The dimension of the hypercube. The number of nodes in the graph will be 2 ** n
.
The hypercube graph of dimension n.
Returns the n-dimensional hypercube graph.
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.distance_regular.is_distance_regular
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them