IDAPython 9.0
Loading...
Searching...
No Matches
simple_graph_t Class Reference

Proxy of C++ simple_graph_t class.

Inheritance diagram for simple_graph_t:
gdl_graph_t mbl_graph_t

Public Member Functions

 __init__ (self, *args, **kwargs)
 init(self) -> gdl_graph_t
 
"void" compute_dominators (self, "array_of_node_bitset_t &" domin, "bool" post=False)
 compute_dominators(self, domin, post=False)
 
"void" compute_immediate_dominators (self, "array_of_node_bitset_t const &" domin, "intvec_t" idomin, "bool" post=False)
 compute_immediate_dominators(self, domin, idomin, post=False)
 
"int" depth_first_preorder (self, "node_ordering_t" pre)
 depth_first_preorder(self, pre) -> int
 
"int" depth_first_postorder (self, "node_ordering_t" post)
 depth_first_postorder(self, post) -> int
 
"simple_graph_t::iterator" begin (self)
 begin(self) -> simple_graph_t::iterator
 
"simple_graph_t::iterator" end (self)
 end(self) -> simple_graph_t::iterator
 
"int" front (self)
 front(self) -> int
 
"void" inc (self, "simple_graph_t::iterator &" p, "int" n=1)
 inc(self, p, n=1)
 
"int" goup (self, "int" node)
 goup(self, node) -> int
 
- Public Member Functions inherited from gdl_graph_t
"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
 
 __disown__ (self)
 

Static Public Attributes

str title = property(_ida_hexrays.simple_graph_t_title_get, _ida_hexrays.simple_graph_t_title_set, doc=)
 
str colored_gdl_edges = property(_ida_hexrays.simple_graph_t_colored_gdl_edges_get, _ida_hexrays.simple_graph_t_colored_gdl_edges_set, doc=)
 

Properties

 thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag")
 
- Properties inherited from gdl_graph_t
 thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag")
 

Constructor & Destructor Documentation

◆ __init__()

__init__ ( self,
* args,
** kwargs )
Parameters
selfPyObject *

Reimplemented from gdl_graph_t.

Reimplemented in mbl_graph_t.

Member Function Documentation

◆ begin()

"simple_graph_t.iterator" begin ( self)

Reimplemented from gdl_graph_t.

◆ compute_dominators()

"void" compute_dominators ( self,
"array_of_node_bitset_t &" domin,
"bool" post = False )
Parameters
dominarray_of_node_bitset_t &
postbool

◆ compute_immediate_dominators()

"void" compute_immediate_dominators ( self,
"array_of_node_bitset_t const &" domin,
"intvec_t" idomin,
"bool" post = False )
Parameters
dominarray_of_node_bitset_t const &
idominintvec_t &
postbool

◆ depth_first_postorder()

"int" depth_first_postorder ( self,
"node_ordering_t" post )
Parameters
postnode_ordering_t *

◆ depth_first_preorder()

"int" depth_first_preorder ( self,
"node_ordering_t" pre )
Parameters
prenode_ordering_t *

◆ end()

"simple_graph_t.iterator" end ( self)

Reimplemented from gdl_graph_t.

◆ front()

"int" front ( self)

Reimplemented from gdl_graph_t.

◆ goup()

"int" goup ( self,
"int" node )
Parameters
nodeint

◆ inc()

"void" inc ( self,
"simple_graph_t.iterator &" p,
"int" n = 1 )
Parameters
psimple_graph_t::iterator &
nint

Member Data Documentation

◆ colored_gdl_edges

str colored_gdl_edges = property(_ida_hexrays.simple_graph_t_colored_gdl_edges_get, _ida_hexrays.simple_graph_t_colored_gdl_edges_set, doc=)
static

◆ title

str title = property(_ida_hexrays.simple_graph_t_title_get, _ida_hexrays.simple_graph_t_title_set, doc=)
static

Property Documentation

◆ thisown

thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag")
static

The documentation for this class was generated from the following file: