def generateFullMaze(width, height):
g = Graph()
for i in range(0, width * height):
v = Vertex(i)
g.addVertex(v)
# Create a fully connected maze graph
for i in range(0, width * height):
# Connect up
if i > width - 1:
g.addEdge(g.getVertex(i), g.getVertex(i - width))
# Connect down
if i < (width * height) - width:
g.addEdge(g.getVertex(i), g.getVertex(i + width))
# Connect right
if i % width != (width - 1):
g.addEdge(g.getVertex(i), g.getVertex(i + 1))
return g
