Main Page | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Namespace Members | Class Members | File Members

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

Functions

void dijkstra (rrouteset_t &routes, std::map< address_t, address_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
 


Function Documentation

void olsr::alg::dijkstra rrouteset_t routes,
std::map< address_t, address_t > &  sources
 


Generated on Thu Jul 28 21:21:49 2005 for Qolyester daemon by  doxygen 1.4.1