29#define IsNode(cp) (cp->flags & MZ_ISNODE)
31#define IsVScan(cp) (cp->flags & MZ_VSCAN)
33#define IsHScan(cp) (cp->flags & MZ_HSCAN)
35#define IsSmallV(cp) (cp->flags & MZ_SMALLV)
37#define IsSmallH(cp) (cp->flags & MZ_SMALLH)
maze * mkMaze(graph_t *)
creates maze and fills maze::gcells and maze::cells. A subroutine of orthoEdges.
void updateWts(sgraph *g, cell *cp, sedge *ep)
updates sedge::weight of cell edges
result of partitioning available space, part of maze
sedge * edges[6]
up to six links (sedge) between four sides (snode) of the cell
snode ** sides
up to four sides: M_RIGHT, M_TOP, M_LEFT, M_BOTTOM
available channels for orthogonal edges around nodes of graph_t
cell * cells
cells not corresponding to graph nodes
cell * gcells
cells corresponding to graph nodes
Dt_t * vchans
set of vertical channels, created by extractVChans
Dt_t * hchans
set of horizontal channels, created by extractHChans.
a node of search graph sgraph, is created as a border segment between two adjusted cells of type cell...