networkx.hypercube_graph
networkx.lollipop_graph
Enter search terms or a module, class or function name.
Return the Ladder graph of length n.
This is two rows of n nodes, with each pair connected by a single edge.
Node labels are the integers 0 to 2*n - 1.