Is There Any Shortest Path Algorithm That Finds The Shortest Path Between Only 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.