dijkstra.hh File Reference

The multisource Dijkstra shortest path algorithm. More...

#include "set/routes.hh"
#include "dijkstra.hxx"

Go to the source code of this file.

Namespaces
namespace	olsr
namespace	olsr::alg
Defines
#define	QOLYESTER_DAEMON_ALG_DIJKSTRA_HH   1
Typedefs
typedef cproxy_t::sym_neighborset_t::iterator	olsr::alg::sniter_t
typedef std::map< address_t, std::pair< address_t, sniter_t > >	olsr::alg::lmap_t
Functions
void	olsr::alg::dijkstra (rrouteset_t &routes, lmap_t &sources)

---

Detailed Description

The multisource Dijkstra shortest path algorithm.

Author:

Ignacy Gawedzki

Date:

Tue Mar 16 14:14:27 2004

The graph used is the current instance of the partial network topology graph. The set of source nodes is the set of 1-hop neighbors. This suffices to generate routing tables, since all shortest paths to 1-hop neighbors are trivial.

---

Define Documentation

#define QOLYESTER_DAEMON_ALG_DIJKSTRA_HH   1