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 1. Nodes are numbered 0,..,7
create_using (NetworkX graph constructor, optional (default=nx.Graph)) – Graph type to create. If graph instance, then cleared before populated.
G – Small maze with a cycle
- Return type
Figure 18.2, Chapter 18, Graph Algorithms (3rd Ed), Sedgewick