You are viewing a single comment's thread from:
RE: Dijkstra’s algorithm of finding optimal paths
Hi, Lemouth.
I'm sorry for the late response. Choice of the algorithm should depend on the specific application. If it's a single-source shortest path problem then Dijkstra's algorithm with Fibonacci heap is a best choice. If you need to find all pairs shortest paths, then you should rather use Floyd–Warshall algorithm
Thanks! I always appreciate answers, even when late. We are all pretty busy and I can understand that, don't worry ^^