the customised struct for TOPOLOGY_OBSTACLES representation More...

Data Fields
bool	dirty

unsigned *	prev_next_cache

double	data []
	a pointer to the cache used to speedup queries on paths (unused in probabilities topology type)

unsigned	neighbours_id [6]

unsigned	free_neighbours

rootsim_bitmap	data []

Detailed Description

the customised struct for TOPOLOGY_OBSTACLES representation

Definition at line 22 of file costs.c.

Field Documentation

rootsim_bitmap _topology_t::data[]

this is the obstacles bitmap

Definition at line 26 of file obstacles.c.

bool _topology_t::dirty

this tells is the prev_next_cache is invalidated

Definition at line 23 of file costs.c.

unsigned _topology_t::free_neighbours

this is the number of reachable neighbours

Definition at line 23 of file obstacles.c.

unsigned _topology_t::neighbours_id

these are the cached neighbours IDs

Definition at line 22 of file obstacles.c.

unsigned * _topology_t::prev_next_cache

this is the cache of previous and next hops needed to reach a destination

Definition at line 24 of file costs.c.

The documentation for this struct was generated from the following files: