Shortest paths are not always unique: sometimes there are two or more different paths with the minimum possible length. Show how to solve the following problem in O ((|V | + |E|) log(|V |)) time.
- Input: An undirected graph G = (V, E); edge lengths `e > 0; starting vertex s ∊ V ; ending vertex t ∊ V .
- Output: True if there is a unique shortest path from s to t and false if there are more than one different shortest paths from s to t.
