|  | 
|  | __init__ (self) | 
|  | init(self) -> cancellable_graph_t 
 | 
|  | 
|  | __disown__ (self) | 
|  | 
| "char *" | get_node_label (self, "int" n) | 
|  | get_node_label(self, n) -> char * 
 | 
|  | 
| "void" | print_graph_attributes (self, "FILE *" fp) | 
|  | print_graph_attributes(self, fp) 
 | 
|  | 
| "bool" | print_node (self, "FILE *" fp, "int" n) | 
|  | print_node(self, fp, n) -> bool 
 | 
|  | 
| "bool" | print_edge (self, "FILE *" fp, "int" i, "int" j) | 
|  | print_edge(self, fp, i, j) -> bool 
 | 
|  | 
| "void" | print_node_attributes (self, "FILE *" fp, "int" n) | 
|  | print_node_attributes(self, fp, n) 
 | 
|  | 
| "int" | size (self) | 
|  | size(self) -> int 
 | 
|  | 
| "int" | node_qty (self) | 
|  | node_qty(self) -> int 
 | 
|  | 
| "bool" | exists (self, "int" node) | 
|  | exists(self, node) -> bool 
 | 
|  | 
| "int" | entry (self) | 
|  | entry(self) -> int 
 | 
|  | 
| "int" | exit (self) | 
|  | exit(self) -> int 
 | 
|  | 
| "int" | nsucc (self, "int" node) | 
|  | nsucc(self, node) -> int 
 | 
|  | 
| "int" | npred (self, "int" node) | 
|  | npred(self, node) -> int 
 | 
|  | 
| "int" | succ (self, "int" node, "int" i) | 
|  | succ(self, node, i) -> int 
 | 
|  | 
| "int" | pred (self, "int" node, "int" i) | 
|  | pred(self, node, i) -> int 
 | 
|  | 
| "bool" | empty (self) | 
|  | empty(self) -> bool 
 | 
|  | 
| "bgcolor_t" | get_node_color (self, "int" n) | 
|  | get_node_color(self, n) -> bgcolor_t 
 | 
|  | 
| "bgcolor_t" | get_edge_color (self, "int" i, "int" j) | 
|  | get_edge_color(self, i, j) -> bgcolor_t 
 | 
|  | 
| "size_t" | nedge (self, "int" node, "bool" ispred) | 
|  | nedge(self, node, ispred) -> size_t 
 | 
|  | 
| "int" | edge (self, "int" node, "int" i, "bool" ispred) | 
|  | edge(self, node, i, ispred) -> int 
 | 
|  | 
| "int" | front (self) | 
|  | front(self) -> int 
 | 
|  | 
| "node_iterator" | begin (self) | 
|  | begin(self) -> node_iterator 
 | 
|  | 
| "node_iterator" | end (self) | 
|  | end(self) -> node_iterator 
 | 
|  |