So, I've recently started messing around with algorithms due to CS course, and I'd like to know this.
Should DA (Dijkstra Algorithm) be viewed as a DP successive approximation procedure? If so, why?
I understand this doesn't have much to do with hacking, but I gotta know the basics first.
1 Response
I would add that it has roots in graph theory and backtracking. Also, I plan to eventually do a tutorial on Dijkstra's algorithm.
Share Your Thoughts