[Routing] Routing algorithms

Marcus Wolschon Marcus at Wolschon.biz
Sat Sep 20 13:34:57 BST 2008


-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Nic Roets schrieb:
> When you add a segment E you have ONE of the routes that lead to
> that segment. But if c(E) fluctuates wildly according to which
> route you used to get there, then it may be worthwhile to take a
> longer route to get to the start of E, just so that you get a lower
> c(E).
>
> On Sat, Sep 20, 2008 at 10:57 AM, OJ W <ojwlists at googlemail.com
> <mailto:ojwlists at googlemail.com>> wrote:
>
> I must be implementing A* wrong then, because every time I add a
> new segment to a potential route in pyroute, I have the history
> showing how it got to that segment.

You get the history but that history is going to change later on
as shorter pathes to any of the nodes in that history are found.

Marcus
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.6 (GNU/Linux)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org

iD8DBQFI1O3wf1hPnk3Z0cQRAnlmAJ0XtJgz6fLWTfc8fYNI8cn8jfWCJQCgw5jY
xhG2qNT83QBhjmyQl0osIRs=
=bY5x
-----END PGP SIGNATURE-----





More information about the Routing mailing list