[Olsr-users] using dijkstra for route calculation

[Adrian Schwartz]

So how does the routing algorithm works?
shortest path?

Adrian

On Mon, Sep 20, 2010 at 9:52 AM, Henning Rogge <(spam-protected)>wrote:

> On Monday 20 September 2010 09:49:21 Adrian Schwartz wrote:
> > Does the routing metric plugin consider all nodes or only MPR nodes?
> The routing metric plugin has to deliver a metric cost for ALL links to
> 1-hop
> neighbors.
>
> MPR selection does not work in 0.6.0 because of a limitation in the
> dijkstra
> algorithm and TC-set. We will fix this in 0.7.0.
>
> Henning Rogge
> --
> 1) You can't win.
> 2) You can't break even.
> 3) You can't leave the game.
> — The Laws of Thermodynamics, summarized
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.olsr.org/pipermail/olsr-users/attachments/20100920/dc4dc0bc/attachment.html>