[Babel-users] Questions

[Mitar]

Hi!

On Sun, Apr 3, 2011 at 8:29 PM, Juliusz Chroboczek <jch at pps.jussieu.fr> wrote:
>> Because it is not really that as it reuses data it has about paths to
>> other nodes.
>
> No, it doesn't.

How not? If you have such topology:

A -- B -- C

When B runs its "run" then it learns the shortest path towards C. And
when A runs its "run" and the shortest path between B and C is already
found/calculated and it is not recalculated again (what would be if
you would say that runs are independent). No?


Mitar