Most efficient way or algo to find shortest path between any two nodes in a graph?

Asked Oct 09 '17 at 07:32

Active Dec 10 '19 at 09:03

Viewed 54 times

I have a huge graph of network nodes. I would like to know what is the most efficient algo or technique to obtain the shortest path between any two nodes in the graph?

I have studied an algorithm of "All pair shortest path" but the time complexity is O(V^3) which is worse in my case as the number of nodes is large. How to reduce this complexity?

edited Dec 10 '19 at 09:03

halfer

19,824
17
99
186

asked Oct 09 '17 at 07:32

user3243499

2,953
6
33
75

Whats the size of the input, number of vertices? number of edges? – harmands Oct 09 '17 at 12:45
I think you should definitely give a look to this, https://stackoverflow.com/a/7265454/3444956 – harmands Oct 09 '17 at 12:52

Most efficient way or algo to find shortest path between any two nodes in a graph?

0 Answers0