CodeGuru Home VC++ / MFC / C++ .NET / C# Visual Basic VB Forums Developer.com
Results 1 to 3 of 3

Threaded View

  1. November 13th, 2007, 07:25 PM #3
    tomercagan
    tomercagan is offline Junior Member
    Join Date
    Nov 2007
    Posts
    5

    Re: Netowrk "Routing" Algorithm

    Hi Zachm,

    Thanks for the input!

    To your experience, by how much would the A* be fater the Dijkstra's? Would anyone be fast enough to search a few 1000s node's graph in a matter of seconds?

    Thanks again,

    Tomer

    < I asked also this but remove it after re-reading the algorithm implementation. (If anyone wonder about this, it is simple to solve by keeping the next hop pointer as we go through the algorithm)
    Do I have to do special "version" in order to save the path in either of the algorithms?>
    Last edited by tomercagan; November 13th, 2007 at 07:57 PM. Reason: Remove stupid, lazyness induced question
    Reply With Quote Reply With Quote
« Previous Thread | Next Thread »

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  

Forum Rules




Click Here to Expand Forum to Full Width

Featured