|
IDA SDK
|
This is the complete list of members for mutable_graph_t, including all inherited members.
| abstract_graph_t(void) (defined in abstract_graph_t) | abstract_graph_t | inline |
| add_edge(int i, int j, const edge_info_t *ei) GCC_PUREVIRT (defined in mutable_graph_t) | mutable_graph_t | virtual |
| add_node(const rect_t *r) GCC_PUREVIRT (defined in mutable_graph_t) | mutable_graph_t | virtual |
| add_node_edges(edgevec_t &dlist, int node) (defined in abstract_graph_t) | abstract_graph_t | |
| assign_edge_ports(const graph_row_info_t &gri, const node_set_t &selfrefs) | abstract_graph_t | protected |
| begin(void) const (defined in gdl_graph_t) | gdl_graph_t | inline |
| belongs | mutable_graph_t | |
| calc_bounds(rect_t *r) (defined in abstract_graph_t) | abstract_graph_t | |
| calc_center_of(const intvec_t &nodes) const (defined in mutable_graph_t) | mutable_graph_t | |
| calc_fitting_params(const rect_t &area, graph_location_info_t *gli, double max_zoom) (defined in abstract_graph_t) | abstract_graph_t | |
| calc_group_ea(const intvec_t &) (defined in mutable_graph_t) | mutable_graph_t | inlinevirtual |
| calc_longest_pathes(const node_set_t &entries, intvec_t &tops, int row_height) const | abstract_graph_t | protected |
| calc_row_heights(graph_row_info_t &gri) const | abstract_graph_t | protected |
| callback | abstract_graph_t | |
| callback_ud | abstract_graph_t | |
| change_group_visibility(int group, bool expand) (defined in mutable_graph_t) | mutable_graph_t | inline |
| change_visibility(const intvec_t &nodes, bool expand) (defined in mutable_graph_t) | mutable_graph_t | |
| check_new_group(const intvec_t &nodes, intvec_t &refined) (defined in mutable_graph_t) | mutable_graph_t | |
| circle_center | abstract_graph_t | |
| circle_radius | abstract_graph_t | |
| clear(void) (defined in mutable_graph_t) | mutable_graph_t | inline |
| clear_layout_info(void) | abstract_graph_t | protected |
| clone(void) const GCC_PUREVIRT (defined in mutable_graph_t) | mutable_graph_t | virtual |
| create_circle_layout(point_t p, int radius) (defined in abstract_graph_t) | abstract_graph_t | inline |
| create_digraph_layout(void) (defined in mutable_graph_t) | mutable_graph_t | inline |
| create_graph_row_info(const intvec_t &tops, graph_row_info_t &gri, int graph_height) const | abstract_graph_t | protected |
| create_group(const intvec_t &nodes) (defined in mutable_graph_t) | mutable_graph_t | inline |
| create_orthogonal_layout(void) (defined in abstract_graph_t) | abstract_graph_t | |
| create_polar_tree_layout(point_t p, int radius) (defined in abstract_graph_t) | abstract_graph_t | |
| create_radial_tree_layout(point_t p, int radius) (defined in abstract_graph_t) | abstract_graph_t | |
| create_spanning_tree(edge_typer_t *et, node_set_t *entries, edgeset_t *back_edges, node_ordering_t *pre, node_ordering_t *post) const (defined in abstract_graph_t) | abstract_graph_t | protected |
| create_tree_layout(void) (defined in abstract_graph_t) | abstract_graph_t | inline |
| current_layout | abstract_graph_t | |
| DEFINE_VIRTUAL_DTOR(mutable_graph_t) (defined in mutable_graph_t) | mutable_graph_t | |
| del_custom_layout(void) (defined in mutable_graph_t) | mutable_graph_t | inline |
| del_edge(int i, int j) GCC_PUREVIRT (defined in mutable_graph_t) | mutable_graph_t | virtual |
| del_node(int n) GCC_PUREVIRT (defined in mutable_graph_t) | mutable_graph_t | virtual |
| delete_group(int group) (defined in mutable_graph_t) | mutable_graph_t | inline |
| depth_first(node_ordering_t *pre, node_ordering_t *post, edge_typer_t *et) const (defined in abstract_graph_t) | abstract_graph_t | protected |
| dump_graph(const char *header) const (defined in abstract_graph_t) | abstract_graph_t | |
| edge(int node, int i, bool ispred) const (defined in gdl_graph_t) | gdl_graph_t | inline |
| edges (defined in mutable_graph_t) | mutable_graph_t | |
| empty(void) const (defined in mutable_graph_t) | mutable_graph_t | inlinevirtual |
| end(void) const (defined in gdl_graph_t) | gdl_graph_t | inline |
| entry(void) const (defined in gdl_graph_t) | gdl_graph_t | inlinevirtual |
| exists(int node) const (defined in mutable_graph_t) | mutable_graph_t | inlinevirtual |
| exit(void) const (defined in gdl_graph_t) | gdl_graph_t | inlinevirtual |
| fix_collapsed_group_edges(void) (defined in mutable_graph_t) | mutable_graph_t | |
| for_all_nodes_edges(graph_visitor_t &nev, bool visit_nodes=true) (defined in abstract_graph_t) | abstract_graph_t | |
| front(void) (defined in gdl_graph_t) | gdl_graph_t | inline |
| gather_edge_segments(const graph_row_info_t &gri, edge_segs_vec_t &ges) const | abstract_graph_t | protected |
| gen_dot(FILE *fp) const (defined in gdl_graph_t) | gdl_graph_t | |
| gen_dot(const char *file) const (defined in gdl_graph_t) | gdl_graph_t | |
| gen_gdl(FILE *fp) const (defined in gdl_graph_t) | gdl_graph_t | |
| gen_gdl(const char *file) const (defined in gdl_graph_t) | gdl_graph_t | |
| get_connected_components(intvec_t &entries) const | abstract_graph_t | protected |
| get_custom_layout(void) (defined in mutable_graph_t) | mutable_graph_t | inline |
| get_edge(edge_t e) GCC_PUREVIRT (defined in mutable_graph_t) | mutable_graph_t | virtual |
| get_edge(edge_t e) const (defined in abstract_graph_t) | abstract_graph_t | inline |
| get_edge_color(int, int) const (defined in gdl_graph_t) | gdl_graph_t | inlinevirtual |
| get_edge_ports(edge_t e, point_t &s, point_t &d) const (defined in abstract_graph_t) | abstract_graph_t | |
| get_first_subgraph_node(int group) const (defined in mutable_graph_t) | mutable_graph_t | inline |
| get_graph_groups(void) (defined in mutable_graph_t) | mutable_graph_t | inline |
| get_next_subgraph_node(int group, int current) const (defined in mutable_graph_t) | mutable_graph_t | inline |
| get_node_color(int) const (defined in gdl_graph_t) | gdl_graph_t | inlinevirtual |
| get_node_group(int node) const (defined in mutable_graph_t) | mutable_graph_t | inline |
| get_node_label(char *buf, int, int) const (defined in gdl_graph_t) | gdl_graph_t | inlinevirtual |
| get_node_representative(int node) (defined in mutable_graph_t) | mutable_graph_t | inline |
| gid | mutable_graph_t | |
| graph_dispatcher (defined in mutable_graph_t) | mutable_graph_t | friend |
| grcall(int code,...) (defined in abstract_graph_t) | abstract_graph_t | inline |
| groups_are_present(void) const (defined in mutable_graph_t) | mutable_graph_t | |
| insert_simple_nodes(intvec_t &nodes, int group) const (defined in mutable_graph_t) | mutable_graph_t | |
| insert_visible_nodes(intvec_t &nodes, int group) const (defined in mutable_graph_t) | mutable_graph_t | |
| is_collapsed_node(int node) const (defined in mutable_graph_t) | mutable_graph_t | inline |
| is_deleted_node(int node) const (defined in mutable_graph_t) | mutable_graph_t | inline |
| is_displayable_node(int node) const (defined in mutable_graph_t) | mutable_graph_t | inline |
| is_dot_node(int node) const (defined in mutable_graph_t) | mutable_graph_t | inline |
| is_group_node(int node) const (defined in mutable_graph_t) | mutable_graph_t | inline |
| is_simple_node(int node) const (defined in mutable_graph_t) | mutable_graph_t | inline |
| is_subgraph_node(int node) const (defined in mutable_graph_t) | mutable_graph_t | inline |
| is_uncollapsed_node(int node) const (defined in mutable_graph_t) | mutable_graph_t | inline |
| is_user_graph() (defined in mutable_graph_t) | mutable_graph_t | inlinevirtual |
| is_visible_node(int node) const (defined in mutable_graph_t) | mutable_graph_t | inline |
| make_rect_edges(graph_row_info_t &gri, const edge_segs_vec_t &ges, int first_reverser_node) | abstract_graph_t | protected |
| minimize_crossings(graph_row_info_t &gri) const | abstract_graph_t | protected |
| move_grouped_nodes(const intvec_t &groups, const mutable_graph_t *ng) (defined in mutable_graph_t) | mutable_graph_t | |
| move_nodes_down(intvec_t &tops, const node_ordering_t &post, int first_reverser_node, int row_height) const | abstract_graph_t | protected |
| move_to_same_place(const intvec_t &collapsing_nodes, point_t p) (defined in mutable_graph_t) | mutable_graph_t | |
| mutable_graph_t(uval_t id) (defined in mutable_graph_t) | mutable_graph_t | |
| mutable_graph_t(const abstract_graph_t &g, uval_t id) (defined in mutable_graph_t) | mutable_graph_t | |
| nedge(int node, bool ispred) const (defined in gdl_graph_t) | gdl_graph_t | inline |
| node_flags | mutable_graph_t | |
| node_layout_t typedef (defined in mutable_graph_t) | mutable_graph_t | |
| node_qty(void) const (defined in mutable_graph_t) | mutable_graph_t | inlinevirtual |
| nodes (defined in mutable_graph_t) | mutable_graph_t | |
| npred(int b) const (defined in mutable_graph_t) | mutable_graph_t | inlinevirtual |
| nrect(int n) const (defined in mutable_graph_t) | mutable_graph_t | inline |
| nrect(int n) (defined in mutable_graph_t) | mutable_graph_t | inlinevirtual |
| nsucc(int b) const (defined in mutable_graph_t) | mutable_graph_t | inlinevirtual |
| org_preds (defined in mutable_graph_t) | mutable_graph_t | |
| org_succs (defined in mutable_graph_t) | mutable_graph_t | |
| path_back(const array_of_node_set_t &domin, int m, int n) const | abstract_graph_t | protected |
| path_back(edge_typer_t &et, int m, int n) const (defined in abstract_graph_t) | abstract_graph_t | protected |
| path_exists(int m, int n) const (defined in gdl_graph_t) | gdl_graph_t | inline |
| pred(int b, int i) const (defined in mutable_graph_t) | mutable_graph_t | inlinevirtual |
| preds (defined in mutable_graph_t) | mutable_graph_t | |
| predset(int b) const (defined in mutable_graph_t) | mutable_graph_t | inline |
| print_edge(FILE *, int, int) const (defined in gdl_graph_t) | gdl_graph_t | inlinevirtual |
| print_graph_attributes(FILE *) const (defined in gdl_graph_t) | gdl_graph_t | inlinevirtual |
| print_node(FILE *, int) const (defined in gdl_graph_t) | gdl_graph_t | inlinevirtual |
| print_node_attributes(FILE *, int) const (defined in gdl_graph_t) | gdl_graph_t | inlinevirtual |
| recalc_edge_widths(const edgeset_t &back_edges, const edge_infos_t &self_edges) | abstract_graph_t | protected |
| rect_edges_made | abstract_graph_t | |
| redo_layout(void) GCC_PUREVIRT (defined in mutable_graph_t) | mutable_graph_t | virtual |
| refresh(void) GCC_PUREVIRT (defined in mutable_graph_t) | mutable_graph_t | virtual |
| replace_edge(int i, int j, int x, int y) GCC_PUREVIRT (defined in mutable_graph_t) | mutable_graph_t | virtual |
| reset(void) (defined in mutable_graph_t) | mutable_graph_t | inline |
| resize(int n) GCC_PUREVIRT (defined in mutable_graph_t) | mutable_graph_t | virtual |
| set_callback(hook_cb_t *_callback, void *_ud) (defined in abstract_graph_t) | abstract_graph_t | inline |
| set_custom_layout(void) const (defined in mutable_graph_t) | mutable_graph_t | inline |
| set_deleted_node(int node) (defined in mutable_graph_t) | mutable_graph_t | inline |
| set_edge(edge_t e, const edge_info_t *ei) GCC_PUREVIRT (defined in mutable_graph_t) | mutable_graph_t | inlinevirtual |
| set_graph_groups(void) const (defined in mutable_graph_t) | mutable_graph_t | inline |
| set_node_group(int node, int group) (defined in mutable_graph_t) | mutable_graph_t | inline |
| set_nrect(int n, const rect_t &r) GCC_PUREVIRT (defined in mutable_graph_t) | mutable_graph_t | virtual |
| set_x_coords(const graph_row_info_t &gri, const node_set_t &selfrefs, int first_added_node) | abstract_graph_t | protected |
| size(void) const (defined in mutable_graph_t) | mutable_graph_t | inlinevirtual |
| succ(int b, int i) const (defined in mutable_graph_t) | mutable_graph_t | inlinevirtual |
| succs (defined in mutable_graph_t) | mutable_graph_t | |
| succset(int b) const (defined in mutable_graph_t) | mutable_graph_t | inline |
| title | abstract_graph_t | |
| tree_layout(edge_typer_t &et, const node_set_t &entries) (defined in abstract_graph_t) | abstract_graph_t | protected |
| vgrcall(int code, va_list va) (defined in abstract_graph_t) | abstract_graph_t | inline |
| visit_nodes(int node, graph_node_visitor_t &gv) const | abstract_graph_t | protected |
| visit_paths(int node, graph_path_visitor_t &gv) const | abstract_graph_t | protected |
1.8.9.1
