-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Brandon Martin-Anderson schrieb: > I don't know about of any sneaky, optimized algorithms, but > graphserver allows the definition and use in a basic dijkatra > algorithm of arbitrary weight functions, where the weight function > takes as input the state vector at the edge's origin vertex. That'd > take I part of the problem. In general it may be simpler to use a > stock dijkatra with edge weights found at runtime, than to use a > specialized algorithm. Works for me.
This will not work correctly. Dijkstra never visits an edge twice. Thus by finding a path with a lower metric to any of the nodes in the state- vector it will not re-evaluate your metric for the ways following the one you just found a better path to. Marcus -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.6 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iD8DBQFI1I3Cf1hPnk3Z0cQRAidLAJ46WqW69e7EOiT4qGGtVAgKpeoljwCgwIgn g6eHTz1Mc22mo16Pl4Uwz4I= =4vZE -----END PGP SIGNATURE----- _______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/listinfo/routing
