simple_graph_t Class Reference

Inheritance diagram for simple_graph_t:

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

Static Public Attributes
str	title
str	colored_gdl_edges

Properties
	thisown
Properties inherited from gdl_graph_t
	thisown

Constructor & Destructor Documentation

__init__()

__init__	(		self,
		*	args,
		**	kwargs )

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()

None compute_dominators	(		self,
		'array_of_node_bitset_t'	domin,
		bool	post = False )

compute_immediate_dominators()

None compute_immediate_dominators	(		self,
		'array_of_node_bitset_t'	domin,
		'intvec_t'	idomin,
		bool	post = False )

depth_first_postorder()

int depth_first_postorder	(		self,
		'node_ordering_t'	post )

depth_first_preorder()

int depth_first_preorder	(		self,
		'node_ordering_t'	pre )

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 )

inc()

None inc	(		self,
		'simple_graph_t.iterator &'	p,
		int	n = 1 )

Member Data Documentation

colored_gdl_edges

str colored_gdl_edges

static

Initial value:

=  property(_ida_hexrays.
        simple_graph_t_colored_gdl_edges_get, _ida_hexrays.
        simple_graph_t_colored_gdl_edges_set)

title

str title

static

Initial value:

=  property(_ida_hexrays.simple_graph_t_title_get,
        _ida_hexrays.simple_graph_t_title_set)

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:

• ida_hexrays.py