graph_node_visitor_t Class Reference

Inheritance diagram for graph_node_visitor_t:

Public Member Functions
None	reinit (self)
None	set_visited (self, int n)
bool	is_visited (self, int n)
int	visit_node (self, int arg0)
bool	is_forbidden_edge (self, int arg0, int arg1)
	__init__ (self)
	__disown__ (self)

Properties
	thisown

Constructor & Destructor Documentation

__init__()

__init__

(

self

)

Member Function Documentation

__disown__()

__disown__

(

self

)

is_forbidden_edge()

bool is_forbidden_edge	(		self,
		int	arg0,
		int	arg1 )

Should the edge between 'n' and 'm' be ignored?

is_visited()

bool is_visited	(		self,
		int	n )

Have we already visited the given node?

reinit()

None reinit

(

self

)

Reset visited nodes.

set_visited()

None set_visited	(		self,
		int	n )

Mark node as visited.

visit_node()

int visit_node	(		self,
		int	arg0 )

Implements action to take when a node is visited.

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_graph.py