lib/circogen/circular.h File Reference
#include <render.h>#include <block.h>#include <stack.h>#include <circo.h>
Go to the source code of this file.
Data Structures | |
| struct | circ_state |
| struct | ndata |
| struct | cdata |
| struct | edata |
Defines | |
| #define | NDATA(n) ((ndata*)((n)->u.alg)) |
| #define | DNODE(n) (NDATA(n)->dnode) |
| #define | EDGEDATA(e) ((edata*)((e)->u.alg)) |
| #define | EDGEORDER(e) (EDGEDATA(e)->order) |
| #define | DATA(n) ((cdata*)((n)->u.alg)) |
| #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 | BCDONE_F (1 << 1) |
| #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 | BCDONE(n) (FLAGS(n)&BCDONE_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_BCDONE(n) (FLAGS(n) |= BCDONE_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_BCDONE(n) (FLAGS(n) &= ~BCDONE_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) |
Define Documentation
| #define BCDONE | ( | n | ) | (FLAGS(n)&BCDONE_F) |
Definition at line 114 of file circular.h.
| #define BCDONE_F (1 << 1) |
Definition at line 107 of file circular.h.
| #define BLOCK | ( | n | ) | (DATA(n)->block) |
| #define CLONE | ( | n | ) | (DATA(n)->u.clone) |
Definition at line 97 of file circular.h.
| #define DATA | ( | n | ) | ((cdata*)((n)->u.alg)) |
Definition at line 88 of file circular.h.
| #define DEGREE | ( | n | ) | (ND_order(n)) |
| #define DISTONE | ( | n | ) | (DATA(n)->u.t.fdist) |
Definition at line 101 of file circular.h.
| #define DISTTWO | ( | n | ) | (DATA(n)->u.t.sdist) |
Definition at line 102 of file circular.h.
| #define DNODE | ( | n | ) | (NDATA(n)->dnode) |
| #define EDGEDATA | ( | e | ) | ((edata*)((e)->u.alg)) |
Definition at line 85 of file circular.h.
| #define EDGEORDER | ( | e | ) | (EDGEDATA(e)->order) |
Definition at line 86 of file circular.h.
| #define FLAGS | ( | n | ) | (DATA(n)->flags) |
Definition at line 91 of file circular.h.
| #define ISPARENT | ( | n | ) | (FLAGS(n)&PARENT_F) |
| #define LEAFONE | ( | n | ) | (DATA(n)->u.t.first) |
Definition at line 99 of file circular.h.
| #define LEAFTWO | ( | n | ) | (DATA(n)->u.t.second) |
Definition at line 100 of file circular.h.
| #define LOWVAL | ( | n | ) | (DATA(n)->u.bc.low_val) |
Definition at line 96 of file circular.h.
| #define NDATA | ( | n | ) | ((ndata*)((n)->u.alg)) |
Definition at line 82 of file circular.h.
| #define NEIGHBOR | ( | n | ) | (FLAGS(n)&NEIGHBOR_F) |
Definition at line 118 of file circular.h.
| #define NEIGHBOR_F (1 << 5) |
Definition at line 111 of file circular.h.
| #define NEXT | ( | n | ) | (DATA(n)->u.bc.next) |
| #define ONPATH | ( | n | ) | (FLAGS(n)&PATH_F) |
Definition at line 117 of file circular.h.
| #define ONSTACK | ( | n | ) | (FLAGS(n)&ONSTACK_F) |
| #define ONSTACK_F (1 << 2) |
Definition at line 108 of file circular.h.
| #define ORIGG | ( | n | ) | (DATA(n)->orig.g) |
| #define ORIGN | ( | n | ) | (DATA(n)->orig.np) |
| #define PARENT | ( | n | ) | (DATA(n)->parent) |
| #define PARENT_F (1 << 3) |
Definition at line 109 of file circular.h.
| #define PATH_F (1 << 4) |
Definition at line 110 of file circular.h.
| #define POSITION | ( | n | ) | (DATA(n)->u.f.pos) |
| #define PSI | ( | n | ) | (DATA(n)->u.f.psi) |
| #define SET_BCDONE | ( | n | ) | (FLAGS(n) |= BCDONE_F) |
Definition at line 121 of file circular.h.
| #define SET_NEIGHBOR | ( | n | ) | (FLAGS(n) |= NEIGHBOR_F) |
Definition at line 125 of file circular.h.
| #define SET_ONPATH | ( | n | ) | (FLAGS(n) |= PATH_F) |
Definition at line 124 of file circular.h.
| #define SET_ONSTACK | ( | n | ) | (FLAGS(n) |= ONSTACK_F) |
| #define SET_PARENT | ( | n | ) | (FLAGS(n) |= PARENT_F) |
| #define SET_VISITED | ( | n | ) | (FLAGS(n) |= VISITED_F) |
Definition at line 120 of file circular.h.
| #define TPARENT | ( | n | ) | (DATA(n)->u.t.tparent) |
Definition at line 98 of file circular.h.
| #define UNSET_BCDONE | ( | n | ) | (FLAGS(n) &= ~BCDONE_F) |
Definition at line 128 of file circular.h.
| #define UNSET_NEIGHBOR | ( | n | ) | (FLAGS(n) &= ~NEIGHBOR_F) |
Definition at line 130 of file circular.h.
| #define UNSET_ONSTACK | ( | n | ) | (FLAGS(n) &= ~ONSTACK_F) |
| #define UNSET_VISITED | ( | n | ) | (FLAGS(n) &= ~VISITED_F) |
Definition at line 127 of file circular.h.
| #define VAL | ( | n | ) | (DATA(n)->u.bc.val) |
| #define VISITED | ( | n | ) | (FLAGS(n)&VISITED_F) |
Definition at line 113 of file circular.h.
| #define VISITED_F (1 << 0) |
Definition at line 106 of file circular.h.
Function Documentation
| void circularLayout | ( | Agraph_t * | sg | ) |
Definition at line 79 of file circular.c.
References agfstnode(), agnnodes(), circPos(), createBlocktree(), and ND_pos.
Referenced by circoLayout().
