IDAPython 8.4
|
Proxy of C++ gdl_graph_t class.
Public Member Functions | |
"char *" | get_node_label (self, *args) |
get_node_label(self, n) -> char * | |
"void" | print_graph_attributes (self, *args) |
print_graph_attributes(self, fp) | |
"bool" | print_node (self, *args) |
print_node(self, fp, n) -> bool | |
"bool" | print_edge (self, *args) |
print_edge(self, fp, i, j) -> bool | |
"void" | print_node_attributes (self, *args) |
print_node_attributes(self, fp, n) | |
"int" | size (self, *args) |
size(self) -> int | |
"int" | node_qty (self, *args) |
node_qty(self) -> int | |
"bool" | exists (self, *args) |
exists(self, node) -> bool | |
"int" | entry (self, *args) |
entry(self) -> int | |
"int" | exit (self, *args) |
exit(self) -> int | |
"int" | nsucc (self, *args) |
nsucc(self, node) -> int | |
"int" | npred (self, *args) |
npred(self, node) -> int | |
"int" | succ (self, *args) |
succ(self, node, i) -> int | |
"int" | pred (self, *args) |
pred(self, node, i) -> int | |
"bool" | empty (self, *args) |
empty(self) -> bool | |
"bgcolor_t" | get_node_color (self, *args) |
get_node_color(self, n) -> bgcolor_t | |
"bgcolor_t" | get_edge_color (self, *args) |
get_edge_color(self, i, j) -> bgcolor_t | |
"size_t" | nedge (self, *args) |
nedge(self, node, ispred) -> size_t | |
"int" | edge (self, *args) |
edge(self, node, i, ispred) -> int | |
"int" | front (self, *args) |
front(self) -> int | |
"node_iterator" | begin (self, *args) |
begin(self) -> node_iterator | |
"node_iterator" | end (self, *args) |
end(self) -> node_iterator | |
__init__ (self, *args) | |
init(self) -> gdl_graph_t | |
__disown__ (self) | |
Properties | |
thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag") | |
__init__ | ( | self, | |
* | args ) |
self | PyObject * |
Reimplemented in cancellable_graph_t, qflow_chart_t, abstract_graph_t, mutable_graph_t, mbl_graph_t, and simple_graph_t.
__disown__ | ( | self | ) |
Reimplemented in cancellable_graph_t, and abstract_graph_t.
"node_iterator" begin | ( | self, | |
* | args ) |
"int" edge | ( | self, | |
* | args ) |
node | int |
i | int |
ispred | bool |
"bool" empty | ( | self, | |
* | args ) |
Reimplemented in mutable_graph_t.
"node_iterator" end | ( | self, | |
* | args ) |
"int" entry | ( | self, | |
* | args ) |
"bool" exists | ( | self, | |
* | args ) |
node | int |
Reimplemented in mutable_graph_t.
"int" exit | ( | self, | |
* | args ) |
"int" front | ( | self, | |
* | args ) |
"bgcolor_t" get_edge_color | ( | self, | |
* | args ) |
i | int |
j | int |
"bgcolor_t" get_node_color | ( | self, | |
* | args ) |
n | int |
"char *" get_node_label | ( | self, | |
* | args ) |
n | int |
Reimplemented in qflow_chart_t.
"size_t" nedge | ( | self, | |
* | args ) |
node | int |
ispred | bool |
"int" node_qty | ( | self, | |
* | args ) |
Reimplemented in mutable_graph_t.
"int" npred | ( | self, | |
* | args ) |
node | int |
Reimplemented in qflow_chart_t, and mutable_graph_t.
"int" nsucc | ( | self, | |
* | args ) |
node | int |
Reimplemented in qflow_chart_t, and mutable_graph_t.
"int" pred | ( | self, | |
* | args ) |
node | int |
i | int |
Reimplemented in qflow_chart_t, and mutable_graph_t.
"bool" print_edge | ( | self, | |
* | args ) |
fp | FILE * |
i | int |
j | int |
"void" print_graph_attributes | ( | self, | |
* | args ) |
fp | FILE * |
"bool" print_node | ( | self, | |
* | args ) |
fp | FILE * |
n | int |
"void" print_node_attributes | ( | self, | |
* | args ) |
fp | FILE * |
n | int |
Reimplemented in qflow_chart_t.
"int" size | ( | self, | |
* | args ) |
Reimplemented in qflow_chart_t, and mutable_graph_t.
"int" succ | ( | self, | |
* | args ) |
node | int |
i | int |
Reimplemented in qflow_chart_t, and mutable_graph_t.
|
static |