What advantage might A* have over Dijkstra's Algorithm?

  • A: Lower-cost route than Dijkstra
  • B: Finds same answer as Dijkstra for one goal with less work
  • C: Gets answers nearly as good but runs faster
  • D: Finds paths between more pairs of nodes
  • E: Has a stronger guarantee of optimality


    Contents    Page-10    Prev    Next    Page+10    Index