The Dikstra algorithm for shortest paths in a weighted diagram, directional or bidirectional, pretty fast. There is also the Bellman Ford algorithm. However, these two find the shortest path between a source and ** all** Key points. However, if I only want to know the way between

**Vertices, is there a faster algorithm that only determines the distance between two nodes?**

*two*