Given an undirected, weighted graph, check whether there exist more than one shortest path between a source and destination node.

Was not able to solve this one. Seems to be a djiktra/backtracking problem. But the complexity in the worst case will be exponential. We just need to check whether more than one shortest path exist, so maybe need not find all paths. Is there a simpler way to solve it?