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

Proxy of C++ graph_node_visitor_t class.

Inheritance diagram for graph_node_visitor_t:

Public Member Functions

"void" reinit (self)
 reinit(self) Reset visited nodes.
 
"void" set_visited (self, "int" n)
 set_visited(self, n) Mark node as visited.
 
"bool" is_visited (self, "int" n)
 is_visited(self, n) -> bool Have we already visited the given node?
 
"int" visit_node (self, "int" arg0)
 visit_node(self, arg0) -> int Implements action to take when a node is visited.
 
"bool" is_forbidden_edge (self, "int" arg0, "int" arg1)
 is_forbidden_edge(self, arg0, arg1) -> bool Should the edge between 'n' and 'm' be ignored?
 
 __init__ (self)
 init(self) -> graph_node_visitor_t
 
 __disown__ (self)
 

Properties

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

Constructor & Destructor Documentation

◆ __init__()

__init__ ( self)
Parameters
selfPyObject *

Member Function Documentation

◆ __disown__()

__disown__ ( self)

◆ is_forbidden_edge()

"bool" is_forbidden_edge ( self,
"int" arg0,
"int" arg1 )
Parameters
arg0int
arg1int

◆ is_visited()

"bool" is_visited ( self,
"int" n )
Parameters
n(C++: int)

◆ reinit()

"void" reinit ( self)

◆ set_visited()

"void" set_visited ( self,
"int" n )
Parameters
n(C++: int)

◆ visit_node()

"int" visit_node ( self,
"int" arg0 )
Parameters
arg0int

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: