Is There Any Shortest Path Algorithm That Finds The Shortest Path Between Only Two Nodes The Dikstra shortest path algorithm on a weighted graph, directional or bidirectional, pretty quick. There is also the Bellman Ford algorithm. However, these two find the shortest path between one source to all vertices. However, if I only want to know the path between two vertices, is there a faster algorithm that only finds the distance between two nodes?
Nope.  The best you can do is to use Dijkstra's or Bellman-Ford.  With Dijkstra's algorithm, you can stop the iteration as soon as you reach the target node, but this doesn't improve the worst-case asymptotic running time.