#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 |
Functions | |
void | dijkstra (rrouteset_t &routes, std::map< address_t, address_t > &sources) |
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.
|
|
|
|