Classes | |
struct | sort_less |
Typedefs | |
typedef cproxy_t::sym_neighborset_t::iterator | sniter_t |
typedef std::map< address_t, std::pair< address_t, sniter_t > > | lmap_t |
typedef std::hash_map< address_t, unsigned > | weightmap_t |
typedef std::hash_map< address_t, address_t > | nextmap_t |
typedef std::hash_map< address_t, unsigned > | hopsmap_t |
typedef std::hash_set< const gra::AdjNode *, gra::hash_AdjNode, utl::pequal_to< gra::AdjNode > > | npset_t |
typedef std::set< const gra::AdjNode *, sort_less > | sortremaining_t |
Functions | |
void | dijkstra (rrouteset_t &routes, lmap_t &sources) |
const address_t & | main_addr_of (const address_t &) |
void | mprselection () |
void | compute_routes () |
void | flush_routes (const lrouteset_t &local_rs, const rrouteset_t &remote_rs) |
void | clean_routes () |
typedef std::hash_map<address_t, unsigned> olsr::alg::hopsmap_t |
typedef std::map<address_t, std::pair<address_t, sniter_t> > olsr::alg::lmap_t |
typedef std::hash_map<address_t, address_t> olsr::alg::nextmap_t |
typedef std::hash_set<const gra::AdjNode*, gra::hash_AdjNode, utl::pequal_to<gra::AdjNode> > olsr::alg::npset_t |
typedef std::set<const gra::AdjNode*, sort_less> olsr::alg::sortremaining_t |
typedef std::hash_map<address_t, unsigned> olsr::alg::weightmap_t |
void olsr::alg::clean_routes | ( | ) | [inline] |
void olsr::alg::compute_routes | ( | ) | [inline] |
Routine to calculate new routing tables
void olsr::alg::dijkstra | ( | rrouteset_t & | routes, | |
lmap_t & | sources | |||
) | [inline] |
void olsr::alg::flush_routes | ( | const lrouteset_t & | local_rs, | |
const rrouteset_t & | remote_rs | |||
) | [inline] |
Routine to apply new routing tables
const address_t & olsr::alg::main_addr_of | ( | const address_t & | ) | [inline] |
void olsr::alg::mprselection | ( | ) | [inline] |