Good work! I suggest yo all triggering the algorithms below first: Edsger Dijkstra's algorithm (it's somehow implemented on OSPF protocol and of course some other ones). Robert Prim's algorithm (finding minimum spanning tree in a graph, most accurately a weighted graph). Joseph Kruskal's algorithm Otakar Borůvka's algorithm ... And a bunch of other algorithms, leading you to a better point of view in order to find the shortest path and calculating appropriate nodes, and sides.
BTW, Any questions? On Jan 24, 4:22 pm, "Albert Sanchez" <[EMAIL PROTECTED]> wrote: > Hi, > > Anyone interested in "road traffic" strategies? Flow optimization, time > dependent shortest paths problems? > > Albert --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
