5 ms·
What I find interesting is that A star, DFS, BFS, Dijkstra's algorithm, JPS, etc are all basically the same algorithm. The only real difference is the queuing p
by TheLoneWolfling 11y ago
What I find interesting is that A star, DFS, BFS, Dijkstra's algorithm, JPS, etc are all basically the same algorithm. The only real difference is the queuing priority. (BFS is LIFO, DFS is FIFO, Dijkstra is min-distance-from-start-first, A star is min-distance-from-start-plus-(admissible,ideally)-heuristic-distance-to-end-first )
Most CS courses I've seen teach them as entirely separate algorithms, which I find... frustrating. Or rather, unnecessarily complex.
- ggambetta 11y agoWhat you say is absolutely correct, and I really don't understand why this is not the way it's explained by default. I've written some articles, linked from some other comment here, that does exactly what you propose. People generally find them extremely useful.
- Scea91 11y agoThen I am glad that my CS course taught them the way you describe.
- mcv 11y agoI learned them as refinements of each other. Similarly, we were taught alpha-beta search as refinement of minimax search in games.