I am looking for the most efficient algorithm for finding shortest path between two Vertices. The graph is:undirectededge-weightedNon-negativeless then 300 nodesI understand that most of the algorithms based on Dijkstra's shortest path algorithm. But which one is the most efficient for the case a specified above. Thank you.
What is the fastest algorithm for finding shortest path in undirected edge-weighted graph?
algorithms;graphs;shortest path;efficiency