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
- create_usingNetworkX graph constructor, optional (default=nx.Graph)
Graph type to create. If graph instance, then cleared before populated.
- Gnetworkx Graph
Small maze with a cycle
Figure 18.2, Chapter 18, Graph Algorithms (3rd Ed), Sedgewick
Additional backends implement this function
cugraph : GPU-accelerated backend.