Go to the source code of this file.
Data Structures | |
| struct | circ_state |
| struct | ndata |
| struct | cdata |
| struct | edata |
Macros | |
| #define | NDATA(n) ((ndata*)(ND_alg(n))) |
| #define | DNODE(n) (NDATA(n)->dnode) |
| #define | EDGEDATA(e) ((edata*)(ED_alg(e))) |
| #define | ENEXT(e) (EDGEDATA(e)->next) |
| #define | EDGEORDER(e) (EDGEDATA(e)->order) |
| #define | DATA(n) ((cdata*)(ND_alg(n))) |
| #define | ORIGG(n) (DATA(n)->orig.g) |
| #define | ORIGN(n) (DATA(n)->orig.np) |
| #define | FLAGS(n) (DATA(n)->flags) |
| #define | PARENT(n) (DATA(n)->parent) |
| #define | BLOCK(n) (DATA(n)->block) |
| #define | NEXT(n) (DATA(n)->u.bc.next) |
| #define | VAL(n) (DATA(n)->u.bc.val) |
| #define | LOWVAL(n) (DATA(n)->u.bc.low_val) |
| #define | CLONE(n) (DATA(n)->u.clone) |
| #define | TPARENT(n) (DATA(n)->u.t.tparent) |
| #define | LEAFONE(n) (DATA(n)->u.t.first) |
| #define | LEAFTWO(n) (DATA(n)->u.t.second) |
| #define | DISTONE(n) (DATA(n)->u.t.fdist) |
| #define | DISTTWO(n) (DATA(n)->u.t.sdist) |
| #define | POSITION(n) (DATA(n)->u.f.pos) |
| #define | PSI(n) (DATA(n)->u.f.psi) |
| #define | VISITED_F (1 << 0) |
| #define | ONSTACK_F (1 << 2) |
| #define | PARENT_F (1 << 3) |
| #define | PATH_F (1 << 4) |
| #define | NEIGHBOR_F (1 << 5) |
| #define | VISITED(n) (FLAGS(n)&VISITED_F) |
| #define | ONSTACK(n) (FLAGS(n)&ONSTACK_F) |
| #define | ISPARENT(n) (FLAGS(n)&PARENT_F) |
| #define | ONPATH(n) (FLAGS(n)&PATH_F) |
| #define | NEIGHBOR(n) (FLAGS(n)&NEIGHBOR_F) |
| #define | SET_VISITED(n) (FLAGS(n) |= VISITED_F) |
| #define | SET_ONSTACK(n) (FLAGS(n) |= ONSTACK_F) |
| #define | SET_PARENT(n) (FLAGS(n) |= PARENT_F) |
| #define | SET_ONPATH(n) (FLAGS(n) |= PATH_F) |
| #define | SET_NEIGHBOR(n) (FLAGS(n) |= NEIGHBOR_F) |
| #define | UNSET_VISITED(n) (FLAGS(n) &= ~VISITED_F) |
| #define | UNSET_ONSTACK(n) (FLAGS(n) &= ~ONSTACK_F) |
| #define | UNSET_NEIGHBOR(n) (FLAGS(n) &= ~NEIGHBOR_F) |
| #define | DEGREE(n) (ND_order(n)) |
Functions | |
| void | circularLayout (Agraph_t *sg, Agraph_t *rg) |
Macro Definition Documentation
Definition at line 90 of file circular.h.
Referenced by createBlocktree().
| #define CLONE | ( | n | ) | (DATA(n)->u.clone) |
Definition at line 94 of file circular.h.
Definition at line 85 of file circular.h.
| #define DEGREE | ( | n | ) | (ND_order(n)) |
Definition at line 125 of file circular.h.
Referenced by insertDeglist(), and removeDeglist().
| #define DISTONE | ( | n | ) | (DATA(n)->u.t.fdist) |
Definition at line 98 of file circular.h.
| #define DISTTWO | ( | n | ) | (DATA(n)->u.t.sdist) |
Definition at line 99 of file circular.h.
| #define DNODE | ( | n | ) | (NDATA(n)->dnode) |
Definition at line 79 of file circular.h.
Referenced by circomps().
Definition at line 81 of file circular.h.
| #define EDGEORDER | ( | e | ) | (EDGEDATA(e)->order) |
Definition at line 83 of file circular.h.
| #define ENEXT | ( | e | ) | (EDGEDATA(e)->next) |
Definition at line 82 of file circular.h.
| #define FLAGS | ( | n | ) | (DATA(n)->flags) |
Definition at line 88 of file circular.h.
Definition at line 111 of file circular.h.
Referenced by layout_block().
| #define LEAFONE | ( | n | ) | (DATA(n)->u.t.first) |
Definition at line 96 of file circular.h.
| #define LEAFTWO | ( | n | ) | (DATA(n)->u.t.second) |
Definition at line 97 of file circular.h.
| #define LOWVAL | ( | n | ) | (DATA(n)->u.bc.low_val) |
Definition at line 93 of file circular.h.
Definition at line 78 of file circular.h.
| #define NEIGHBOR | ( | n | ) | (FLAGS(n)&NEIGHBOR_F) |
Definition at line 113 of file circular.h.
| #define NEIGHBOR_F (1 << 5) |
Definition at line 107 of file circular.h.
| #define NEXT | ( | n | ) | (DATA(n)->u.bc.next) |
Definition at line 91 of file circular.h.
Referenced by stackPop(), and stackPush().
Definition at line 112 of file circular.h.
Definition at line 110 of file circular.h.
Referenced by stackCheck().
| #define ONSTACK_F (1 << 2) |
Definition at line 104 of file circular.h.
| #define ORIGG | ( | n | ) | (DATA(n)->orig.g) |
Definition at line 86 of file circular.h.
| #define ORIGN | ( | n | ) | (DATA(n)->orig.np) |
Definition at line 87 of file circular.h.
Referenced by circomps().
Definition at line 89 of file circular.h.
Referenced by createBlocktree().
| #define PARENT_F (1 << 3) |
Definition at line 105 of file circular.h.
| #define PATH_F (1 << 4) |
Definition at line 106 of file circular.h.
| #define POSITION | ( | n | ) | (DATA(n)->u.f.pos) |
Definition at line 100 of file circular.h.
Referenced by layout_block(), and node_position().
| #define PSI | ( | n | ) | (DATA(n)->u.f.psi) |
Definition at line 101 of file circular.h.
Referenced by layout_block().
| #define SET_NEIGHBOR | ( | n | ) | (FLAGS(n) |= NEIGHBOR_F) |
Definition at line 119 of file circular.h.
Definition at line 118 of file circular.h.
Definition at line 116 of file circular.h.
Referenced by stackPush().
Definition at line 117 of file circular.h.
Referenced by createBlocktree().
Definition at line 115 of file circular.h.
| #define TPARENT | ( | n | ) | (DATA(n)->u.t.tparent) |
Definition at line 95 of file circular.h.
| #define UNSET_NEIGHBOR | ( | n | ) | (FLAGS(n) &= ~NEIGHBOR_F) |
Definition at line 123 of file circular.h.
Definition at line 122 of file circular.h.
Referenced by stackPop().
Definition at line 121 of file circular.h.
| #define VAL | ( | n | ) | (DATA(n)->u.bc.val) |
Definition at line 92 of file circular.h.
Referenced by createBlocktree().
Definition at line 109 of file circular.h.
| #define VISITED_F (1 << 0) |
Definition at line 103 of file circular.h.
Function Documentation
Definition at line 92 of file circular.c.
References agfstnode(), agget(), agnnodes(), circPos(), createBlocktree(), mapbool(), and ND_pos.
Referenced by circoLayout().
