IDAPython 9.0
Loading...
Searching...
No Matches
gdl_graph_t Class Reference
Inheritance diagram for gdl_graph_t:
cancellable_graph_t drawable_graph_t simple_graph_t qflow_chart_t interactive_graph_t mbl_graph_t

Public Member Functions

'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_iteratorbegin (self)
 
'node_iteratorend (self)
 
 __init__ (self)
 
 __disown__ (self)
 

Properties

 thisown
 

Constructor & Destructor Documentation

◆ __init__()

Member Function Documentation

◆ __disown__()

__disown__ ( self)

Reimplemented in cancellable_graph_t, and drawable_graph_t.

◆ begin()

'node_iterator' begin ( self)

Reimplemented in simple_graph_t.

◆ edge()

int edge ( self,
int node,
int i,
bool ispred )

◆ empty()

bool empty ( self)

Reimplemented in interactive_graph_t.

◆ end()

'node_iterator' end ( self)

Reimplemented in simple_graph_t.

◆ entry()

int entry ( self)

◆ exists()

bool exists ( self,
int node )

Reimplemented in interactive_graph_t.

◆ exit()

int exit ( self)

◆ front()

int front ( self)

Reimplemented in simple_graph_t.

◆ get_edge_color()

'bgcolor_t' get_edge_color ( self,
int i,
int j )

◆ get_node_color()

'bgcolor_t' get_node_color ( self,
int n )

◆ get_node_label()

'char *' get_node_label ( self,
int n )

Reimplemented in qflow_chart_t.

◆ nedge()

'size_t' nedge ( self,
int node,
bool ispred )

◆ node_qty()

int node_qty ( self)

Reimplemented in interactive_graph_t.

◆ npred()

int npred ( self,
int node )

Reimplemented in qflow_chart_t, and interactive_graph_t.

◆ nsucc()

int nsucc ( self,
int node )

Reimplemented in qflow_chart_t, and interactive_graph_t.

◆ pred()

int pred ( self,
int node,
int i )

Reimplemented in qflow_chart_t, and interactive_graph_t.

◆ print_edge()

bool print_edge ( self,
'FILE *' fp,
int i,
int j )

◆ print_graph_attributes()

None print_graph_attributes ( self,
'FILE *' fp )

◆ print_node()

bool print_node ( self,
'FILE *' fp,
int n )

◆ print_node_attributes()

None print_node_attributes ( self,
'FILE *' fp,
int n )

Reimplemented in qflow_chart_t.

◆ size()

int size ( self)

Reimplemented in qflow_chart_t, and interactive_graph_t.

◆ succ()

int succ ( self,
int node,
int i )

Reimplemented in qflow_chart_t, and interactive_graph_t.

Property Documentation

◆ thisown

thisown
static
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: