struct _node_list node_list
void adjustGrid(Grid *g, int nnodes)
void walkGrid(Grid *, int(*)(void *, void *))
int gLength(cell *p)
return the number of nodes in a cell
cell * findGrid(Grid *, int, int)
void delGrid(Grid *)
close and free all grid resources
void addGrid(Grid *, int, int, Agnode_t *)
add node n to cell (i,j) in grid g
result of partitioning available space, part of maze