Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
dr_hooo
on Sept 5, 2020
|
parent
|
context
|
favorite
| on:
Mathematicians should stop naming things after eac...
Yet we still have Dijkstra's algorithm vs Belmann-Ford, because their differences cannot be captured well in a single word.
ogogmad
on Sept 5, 2020
[–]
Hmm. Dijkstra = Nearest Node First, Bellman-Ford = Shortest k-Edge Path.
afiori
on Sept 6, 2020
|
parent
|
next
[–]
at this point in time it is probably a better idea to simply list both dijkstra and bellman-ford in a wikipedia page for optimal path finding algorithm
3np
on Sept 6, 2020
|
parent
|
prev
[–]
How about A*?
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
