|
| __init__ (self) |
|
| __disown__ (self) |
|
'char *' | get_node_label (self, int n) |
|
None | print_graph_attributes (self, 'FILE *' fp) |
|
bool | print_node (self, 'FILE *' fp, int n) |
|
bool | print_edge (self, 'FILE *' fp, int i, int j) |
|
None | print_node_attributes (self, 'FILE *' fp, int n) |
|
int | size (self) |
|
int | node_qty (self) |
|
bool | exists (self, int node) |
|
int | entry (self) |
|
int | exit (self) |
|
int | nsucc (self, int node) |
|
int | npred (self, int node) |
|
int | succ (self, int node, int i) |
|
int | pred (self, int node, int i) |
|
bool | empty (self) |
|
'bgcolor_t' | get_node_color (self, int n) |
|
'bgcolor_t' | get_edge_color (self, int i, int j) |
|
'size_t' | nedge (self, int node, bool ispred) |
|
int | edge (self, int node, int i, bool ispred) |
|
int | front (self) |
|
'node_iterator' | begin (self) |
|
'node_iterator' | end (self) |
|
◆ __init__()
◆ __disown__()
◆ cancelled
Initial value:= property(_ida_gdl.cancellable_graph_t_cancelled_get,
_ida_gdl.cancellable_graph_t_cancelled_set)
◆ thisown
Initial value:= property(lambda x: x.this.own(), lambda x, v: x.this.own(v),
doc='The membership flag')
The documentation for this class was generated from the following file: