 |
IDA C++ SDK 9.2
|
|
IDA C++ SDK 9.2
|
This is the complete list of members for drawable_graph_t, including all inherited members.
| add_node_edges(edgevec_t &dlist, int node) | drawable_graph_t | |
| assign_edge_ports(const graph_row_info_t &gri, const node_set_t &selfrefs) | drawable_graph_t | protected |
| begin(void) const | gdl_graph_t | inline |
| calc_bounds(rect_t *r) | drawable_graph_t | |
| calc_fitting_params(const rect_t &area, const rect_t &r, graph_location_info_t *gli, double max_zoom) | drawable_graph_t | |
| calc_fitting_params(const rect_t &area, graph_location_info_t *gli, double max_zoom) | drawable_graph_t | |
| calc_longest_pathes(const node_set_t &entries, intvec_t &tops, int row_height) const | drawable_graph_t | protected |
| calc_row_heights(graph_row_info_t &gri) const | drawable_graph_t | protected |
| callback | drawable_graph_t | |
| callback_ud | drawable_graph_t | |
| circle_center | drawable_graph_t | |
| circle_radius | drawable_graph_t | |
| clear(void) | drawable_graph_t | |
| clear_layout_info(void) | drawable_graph_t | protected |
| clone(void) const =0 | drawable_graph_t | pure virtual |
| create_circle_layout(point_t p, int radius) | drawable_graph_t | inline |
| create_graph_row_info(const intvec_t &tops, graph_row_info_t &gri, int graph_height) const | drawable_graph_t | protected |
| create_orthogonal_layout(void) | drawable_graph_t | |
| create_polar_tree_layout(point_t p, int radius) | drawable_graph_t | |
| create_radial_tree_layout(point_t p, int radius) | drawable_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 | drawable_graph_t | protected |
| create_tree_layout(void) | drawable_graph_t | inline |
| current_layout | drawable_graph_t | |
| DEFINE_MEMORY_ALLOCATION_FUNCS() virtual ~gdl_graph_t() | gdl_graph_t | inline |
| depth_first(node_ordering_t *pre, node_ordering_t *post, edge_typer_t *et) const | drawable_graph_t | protected |
| dump_graph(const char *header) const | drawable_graph_t | |
| edge(int node, int i, bool ispred) const | gdl_graph_t | inline |
| empty(void) const | gdl_graph_t | inlinevirtual |
| end(void) const | gdl_graph_t | inline |
| entry(void) const | gdl_graph_t | inlinevirtual |
| exists(int node) const | gdl_graph_t | inlinevirtual |
| exit(void) const | gdl_graph_t | inlinevirtual |
| for_all_nodes_edges(graph_visitor_t &nev, bool visit_nodes=true) | drawable_graph_t | |
| front(void) | gdl_graph_t | inline |
| gather_edge_segments(const graph_row_info_t &gri, edge_segs_vec_t &ges) const | drawable_graph_t | protected |
| gen_dot(FILE *fp) const | gdl_graph_t | |
| gen_dot(const char *file) const | gdl_graph_t | |
| gen_gdl(FILE *fp) const | gdl_graph_t | |
| gen_gdl(const char *file) const | gdl_graph_t | |
| get_connected_components(intvec_t &entries) const | drawable_graph_t | protected |
| get_edge(edge_t e) const | drawable_graph_t | inline |
| get_edge(edge_t e)=0 | drawable_graph_t | pure virtual |
| get_edge_color(int i, int j) const | gdl_graph_t | inlinevirtual |
| get_edge_ports(edge_t e, point_t &s, point_t &d) const | drawable_graph_t | |
| get_node_color(int n) const | gdl_graph_t | inlinevirtual |
| get_node_label(char *iobuf, int iobufsize, int n) const | gdl_graph_t | inlinevirtual |
| grcall(int code,...) | drawable_graph_t | inline |
| make_rect_edges(graph_row_info_t &gri, const edge_segs_vec_t &ges, int first_reverser_node) | drawable_graph_t | protected |
| minimize_crossings(graph_row_info_t &gri) const | drawable_graph_t | protected |
| move_nodes_down(intvec_t &tops, const node_ordering_t &post, int first_reverser_node, int row_height) const | drawable_graph_t | protected |
| nedge(int node, bool ispred) const | gdl_graph_t | inline |
| node_qty(void) const | gdl_graph_t | inlinevirtual |
| npred(int node) const =0 | gdl_graph_t | pure virtual |
| nrect(int n) const | drawable_graph_t | inline |
| nrect(int n)=0 | drawable_graph_t | pure virtual |
| nsucc(int node) const =0 | gdl_graph_t | pure virtual |
| path_back(const array_of_node_set_t &domin, int m, int n) const | drawable_graph_t | protected |
| path_back(edge_typer_t &et, int m, int n) const | drawable_graph_t | protected |
| path_exists(int m, int n) const | gdl_graph_t | inline |
| pred(int node, int i) const =0 | gdl_graph_t | pure virtual |
| print_edge(FILE *fp, int i, int j) const | gdl_graph_t | inlinevirtual |
| print_graph_attributes(FILE *fp) const | gdl_graph_t | inlinevirtual |
| print_node(FILE *fp, int n) const | gdl_graph_t | inlinevirtual |
| print_node_attributes(FILE *fp, int n) const | gdl_graph_t | inlinevirtual |
| recalc_edge_widths(const edgeset_t &back_edges, const edge_infos_t &self_edges) | drawable_graph_t | protected |
| rect_edges_made | drawable_graph_t | |
| set_callback(hook_cb_t *_callback, void *_ud) | drawable_graph_t | inline |
| set_x_coords(const graph_row_info_t &gri, const node_set_t &selfrefs, int first_added_node) | drawable_graph_t | protected |
| size(void) const =0 | gdl_graph_t | pure virtual |
| succ(int node, int i) const =0 | gdl_graph_t | pure virtual |
| title | drawable_graph_t | |
| tree_layout(edge_typer_t &et, const node_set_t &entries) | drawable_graph_t | protected |
| vgrcall(int code, va_list va) | drawable_graph_t | inline |
| visit_nodes(int node, graph_node_visitor_t &gv) const | drawable_graph_t | protected |
| visit_paths(int node, graph_path_visitor_t &gv) const | drawable_graph_t | protected |
| ~drawable_graph_t() | drawable_graph_t | inlinevirtual |