|
Defines |
| #define | STROKE_CLOSED (1 << 0) |
| #define | STROKE_FILLED (1 << 1) |
| #define | STROKE_PENDOWN (1 << 2) |
| #define | STROKE_VERTICES_ALLOCATED (1 << 3) |
| #define | elist_fastapp(item, L) do {L.list[L.size++] = item; L.list[L.size] = NULL;} while(0) |
| #define | elist_append(item, L) do {L.list = ALLOC(L.size + 2,L.list,edge_t*); L.list[L.size++] = item; L.list[L.size] = NULL;} while(0) |
| #define | alloc_elist(n, L) do {L.size = 0; L.list = N_NEW(n + 1,edge_t*); } while (0) |
| #define | free_list(L) do {if (L.list) free(L.list);} while (0) |
| #define | GD_alg(g) (g)->u.alg |
| #define | GD_bb(g) (g)->u.bb |
| #define | GD_border(g) (g)->u.border |
| #define | GD_cl_cnt(g) (g)->u.cl_cnt |
| #define | GD_clust(g) (g)->u.clust |
| #define | GD_cluster_was_collapsed(g) (g)->u.cluster_was_collapsed |
| #define | GD_comp(g) (g)->u.comp |
| #define | GD_dist(g) (g)->u.dist |
| #define | GD_drawing(g) (g)->u.drawing |
| #define | GD_exact_ranksep(g) (g)->u.exact_ranksep |
| #define | GD_expanded(g) (g)->u.expanded |
| #define | GD_flags(g) (g)->u.flags |
| #define | GD_has_Latin1char(g) (g)->u.has_Latin1char |
| #define | GD_has_labels(g) (g)->u.has_labels |
| #define | GD_has_images(g) (g)->u.has_images |
| #define | GD_has_flat_edges(g) (g)->u.has_flat_edges |
| #define | GD_ht1(g) (g)->u.ht1 |
| #define | GD_ht2(g) (g)->u.ht2 |
| #define | GD_inleaf(g) (g)->u.inleaf |
| #define | GD_installed(g) (g)->u.installed |
| #define | GD_label(g) (g)->u.label |
| #define | GD_leader(g) (g)->u.leader |
| #define | GD_rankdir(g) (g)->u.rankdir |
| #define | GD_flip(g) (GD_rankdir(g) & 1) |
| #define | GD_ln(g) (g)->u.ln |
| #define | GD_maxrank(g) (g)->u.maxrank |
| #define | GD_maxset(g) (g)->u.maxset |
| #define | GD_minrank(g) (g)->u.minrank |
| #define | GD_minset(g) (g)->u.minset |
| #define | GD_move(g) (g)->u.move |
| #define | GD_n_cluster(g) (g)->u.n_cluster |
| #define | GD_n_nodes(g) (g)->u.n_nodes |
| #define | GD_ndim(g) (g)->u.ndim |
| #define | GD_neato_nlist(g) (g)->u.neato_nlist |
| #define | GD_nlist(g) (g)->u.nlist |
| #define | GD_nodesep(g) (g)->u.nodesep |
| #define | GD_outleaf(g) (g)->u.outleaf |
| #define | GD_rank(g) (g)->u.rank |
| #define | GD_rankleader(g) (g)->u.rankleader |
| #define | GD_ranksep(g) (g)->u.ranksep |
| #define | GD_rn(g) (g)->u.rn |
| #define | GD_set_type(g) (g)->u.set_type |
| #define | GD_label_pos(g) (g)->u.label_pos |
| #define | GD_showboxes(g) (g)->u.showboxes |
| #define | GD_spring(g) (g)->u.spring |
| #define | GD_sum_t(g) (g)->u.sum_t |
| #define | GD_t(g) (g)->u.t |
| #define | ND_UF_parent(n) (n)->u.UF_parent |
| #define | ND_UF_size(n) (n)->u.UF_size |
| #define | ND_alg(n) (n)->u.alg |
| #define | ND_clust(n) (n)->u.clust |
| #define | ND_coord_i(n) (n)->u.coord |
| #define | ND_dist(n) (n)->u.dist |
| #define | ND_flat_in(n) (n)->u.flat_in |
| #define | ND_flat_out(n) (n)->u.flat_out |
| #define | ND_has_port(n) (n)->u.has_port |
| #define | ND_heapindex(n) (n)->u.heapindex |
| #define | ND_height(n) (n)->u.height |
| #define | ND_hops(n) (n)->u.hops |
| #define | ND_ht_i(n) (n)->u.ht |
| #define | ND_id(n) (n)->u.id |
| #define | ND_in(n) (n)->u.in |
| #define | ND_inleaf(n) (n)->u.inleaf |
| #define | ND_label(n) (n)->u.label |
| #define | ND_lim(n) (n)->u.lim |
| #define | ND_low(n) (n)->u.low |
| #define | ND_lw_i(n) (n)->u.lw |
| #define | ND_mark(n) (n)->u.mark |
| #define | ND_mval(n) (n)->u.mval |
| #define | ND_n_cluster(n) (n)->u.n_cluster |
| #define | ND_next(n) (n)->u.next |
| #define | ND_node_type(n) (n)->u.node_type |
| #define | ND_onstack(n) (n)->u.onstack |
| #define | ND_order(n) (n)->u.order |
| #define | ND_other(n) (n)->u.other |
| #define | ND_out(n) (n)->u.out |
| #define | ND_outleaf(n) (n)->u.outleaf |
| #define | ND_par(n) (n)->u.par |
| #define | ND_pinned(n) (n)->u.pinned |
| #define | ND_pos(n) (n)->u.pos |
| #define | ND_prev(n) (n)->u.prev |
| #define | ND_priority(n) (n)->u.priority |
| #define | ND_rank(n) (n)->u.rank |
| #define | ND_ranktype(n) (n)->u.ranktype |
| #define | ND_rw_i(n) (n)->u.rw |
| #define | ND_save_in(n) (n)->u.save_in |
| #define | ND_save_out(n) (n)->u.save_out |
| #define | ND_shape(n) (n)->u.shape |
| #define | ND_shape_info(n) (n)->u.shape_info |
| #define | ND_showboxes(n) (n)->u.showboxes |
| #define | ND_state(n) (n)->u.state |
| #define | ND_clustnode(n) (n)->u.clustnode |
| #define | ND_tree_in(n) (n)->u.tree_in |
| #define | ND_tree_out(n) (n)->u.tree_out |
| #define | ND_weight_class(n) (n)->u.weight_class |
| #define | ND_width(n) (n)->u.width |
| #define | ND_xsize(n) (n)->u.xsize |
| #define | ND_ysize(n) (n)->u.ysize |
| #define | ED_alg(e) (e)->u.alg |
| #define | ED_conc_opp_flag(e) (e)->u.conc_opp_flag |
| #define | ED_count(e) (e)->u.count |
| #define | ED_cutvalue(e) (e)->u.cutvalue |
| #define | ED_dist(e) (e)->u.dist |
| #define | ED_edge_type(e) (e)->u.edge_type |
| #define | ED_factor(e) (e)->u.factor |
| #define | ED_head_label(e) (e)->u.head_label |
| #define | ED_head_port(e) (e)->u.head_port |
| #define | ED_label(e) (e)->u.label |
| #define | ED_label_ontop(e) (e)->u.label_ontop |
| #define | ED_minlen(e) (e)->u.minlen |
| #define | ED_path(e) (e)->u.path |
| #define | ED_showboxes(e) (e)->u.showboxes |
| #define | ED_spl(e) (e)->u.spl |
| #define | ED_tail_label(e) (e)->u.tail_label |
| #define | ED_tail_port(e) (e)->u.tail_port |
| #define | ED_to_orig(e) (e)->u.to_orig |
| #define | ED_to_virt(e) (e)->u.to_virt |
| #define | ED_tree_index(e) (e)->u.tree_index |
| #define | ED_weight(e) (e)->u.weight |
| #define | ED_xpenalty(e) (e)->u.xpenalty |
Typedefs |
| typedef unsigned char | boolean |
| typedef int(* | qsort_cmpf )(const void *, const void *) |
| typedef int(* | bsearch_cmpf )(const void *, const void *) |
| typedef Agraph_t | graph_t |
| typedef Agnode_t | node_t |
| typedef Agedge_t | edge_t |
| typedef Agsym_t | attrsym_t |
| typedef GVC_s | GVC_t |
| typedef gvrender_engine_s | gvrender_engine_t |
| typedef htmllabel_t | htmllabel_t |
| typedef pointf | pointf |
| typedef inside_t | inside_t |
| typedef point | point |
| typedef box | box |
| typedef port | port |
| typedef pathend_t | pathend_t |
| typedef path | path |
| typedef bezier | bezier |
| typedef splines | splines |
| typedef bezierf | bezierf |
| typedef splinesf | splinesf |
| typedef textline_t | textline_t |
| typedef textlabel_t | textlabel_t |
| typedef polygon_t | polygon_t |
| typedef stroke_t | stroke_t |
| typedef shape_t | shape_t |
| typedef shape_functions | shape_functions |
| typedef shape_desc | shape_desc |
| typedef queue | queue |
| typedef adjmatrix_t | adjmatrix_t |
| typedef rank_t | rank_t |
| typedef enum engine_e | engine_t |
| typedef layout_t | layout_t |
| typedef field_t | field_t |
| typedef hsbcolor_t | hsbcolor_t |
| typedef enum color_type_e | color_type |
| typedef color_s | color_t |
| typedef nlist_t | nlist_t |
| typedef elist | elist |
| typedef Agraphinfo_t | Agraphinfo_t |
| typedef Agnodeinfo_t | Agnodeinfo_t |
| typedef Agedgeinfo_t | Agedgeinfo_t |
Enumerations |
| enum | shape_kind {
SH_UNSET,
SH_POLY,
SH_RECORD,
SH_POINT,
SH_EPSF,
SH_USER
} |
| enum | engine_e {
DOT,
NEATO,
TWOPI,
FDP,
CIRCULAR
} |
| enum | ratio_t {
R_NONE,
R_VALUE,
R_FILL,
R_COMPRESS,
R_AUTO,
R_EXPAND
} |
| enum | color_type_e { HSV_DOUBLE,
RGBA_BYTE,
RGBA_WORD,
CMYK_BYTE
} |
