What does A* assume that Dijkstra does not?

  • A: sum of all edge costs is to be minimized
  • B: no one-way links
  • C: limited number of edges per node
  • D: routes to many destinations are needed
  • E: a heuristic estimate of cost from a node to goal

    Answer: E

    A* takes advantage of a heuristic function to search faster. While a heuristic of 0 could be used, that would be the same as Dijkstra.

    Contents    Page-10    Prev    Next    Page+10    Index