networkx.petersen_graph
networkx.tetrahedral_graph
Enter search terms or a module, class or function name.
Return a small maze with a cycle.
This is the maze used in Sedgewick,3rd Edition, Part 5, Graph Algorithms, Chapter 18, e.g. Figure 18.2 and following. Nodes are numbered 0,..,7