"Dijkstra's algorithm uses a depth first search (DFS) approach to a graph traversal," - isn't it BFS. I think it is BFS instead of DFS. Correct me if I am wrong
You're correct. I just rushed through that description too fast and didn't notice my mistake. Fixed!
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
"Dijkstra's algorithm uses a depth first search (DFS) approach to a graph traversal," - isn't it BFS. I think it is BFS instead of DFS. Correct me if I am wrong
You're correct. I just rushed through that description too fast and didn't notice my mistake. Fixed!