graph_node_visitor_t Class Reference

Node visitor - see drawable_graph_t::visit_nodes() More...

#include <graph.hpp>

Public Member Functions
void idaapi	reinit (void)
	Reset visited nodes.
void idaapi	set_visited (int n)
	Mark node as visited.
bool idaapi	is_visited (int n) const
	Have we already visited the given node?
virtual int idaapi	visit_node (int)
	Implements action to take when a node is visited.
virtual bool idaapi	is_forbidden_edge (int, int) const
	Should the edge between 'n' and 'm' be ignored?
virtual	~graph_node_visitor_t ()

Detailed Description

Node visitor - see drawable_graph_t::visit_nodes()

Constructor & Destructor Documentation

~graph_node_visitor_t()

virtual graph_node_visitor_t::~graph_node_visitor_t ( )

inlinevirtual

Member Function Documentation

reinit()

void idaapi graph_node_visitor_t::reinit ( void )

inline

Reset visited nodes.

set_visited()

void idaapi graph_node_visitor_t::set_visited ( int n )

inline

Mark node as visited.

is_visited()

bool idaapi graph_node_visitor_t::is_visited ( int n ) const

inline

Have we already visited the given node?

visit_node()

virtual int idaapi graph_node_visitor_t::visit_node ( int )

inlinevirtual

Implements action to take when a node is visited.

is_forbidden_edge()

virtual bool idaapi graph_node_visitor_t::is_forbidden_edge ( int , int  ) const

inlinevirtual

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

---

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

• /Users/geoffrey/ida-sdk/src/include/graph.hpp