def sedgewick_maze_graph(create_using=None):
 G = empty_graph(0, create_using)
 G.add_nodes_from(range(8))
 G.add_edges_from([[0, 2], [0, 7], [0, 5]])
 G.add_edges_from([[1, 7], [2, 6]])
 G.add_edges_from([[3, 4], [3, 5]])
 G.add_edges_from([[4, 5], [4, 7], [4, 6]])
 G.name = 'Sedgewick Maze'
 return G

def sedgewick_maze_graph ( create_using = None ) : G = empty_graph ( 0 , create_using ) G . add_nodes_from ( range ( 8 ) ) G . add_edges_from ( [ [ 0 , 2 ] , [ 0 , 7 ] , [ 0 , 5 ] ] ) G . add_edges_from ( [ [ 1 , 7 ] , [ 2 , 6 ] ] ) G . add_edges_from ( [ [ 3 , 4 ] , [ 3 , 5 ] ] ) G . add_edges_from ( [ [ 4 , 5 ] , [ 4 , 7 ] , [ 4 , 6 ] ] ) G . name = 'Sedgewick Maze' return G
return a small maze with a cycle .