3 ms·

Those are two different algorithms for searching in a graph (they are in fact very similar, one uses a queue, and the other uses a stack). Check your Cormen.

• sltkr 13y ago
  It's more like: breadth-first search is a specialization of Dijkstra's algorithm, which is a specialization of A*.
  • jmt7les 13y ago
    A* uses BFS but was a specialization of Dijkstra's, not the other way around.
    • Sharlin 13y ago
      No, Dijkstra is simply A* whose heuristic function is h(x)=0. A* is the more general one.
      • amitp 13y ago
        Another way of looking at it: A* is Dijkstra where the edge weights have been modified. http://11011110.livejournal.com/135302.html http://11011110.livejournal.com/135302.html
  • sgeisenh 13y ago
    While breadth-first search and Dijkstra's have a lot in common, Dijkstra's is a priority first search which is inherently sequential, whereas there is some parallelism to be had in BFS since you can check the neighbors of your frontier concurrently given a data structure with which it is efficient to do so.