node_ordering_t Class Reference

Node ordering in a graph. More...

#include <gdl.hpp>

Public Member Functions
	DEFINE_MEMORY_ALLOCATION_FUNCS () void idaapi clear(void)
void idaapi	resize (int n)
size_t idaapi	size (void) const
void idaapi	set (int _node, int num)
bool idaapi	clr (int _node)
int idaapi	node (size_t _order) const
int idaapi	order (int _node)

Detailed Description

Node ordering in a graph.

Maps a node number to a number describing its order in the graph (and vice versa).

Member Function Documentation

DEFINE_MEMORY_ALLOCATION_FUNCS()

node_ordering_t::DEFINE_MEMORY_ALLOCATION_FUNCS ( )

inline

resize()

void idaapi node_ordering_t::resize ( int n )

inline

size()

size_t idaapi node_ordering_t::size ( void ) const

inline

set()

void idaapi node_ordering_t::set ( int _node, int num )

inline

clr()

bool idaapi node_ordering_t::clr ( int _node )

inline

node()

int idaapi node_ordering_t::node ( size_t _order ) const

inline

order()

int idaapi node_ordering_t::order ( int _node )

inline

---

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

• ida-sdk/src/include/gdl.hpp