Graph Algorithms · Hard problem

A weighted graph has vertices $s,a,b,t$ and edges $sa{:}4, sb{:}7, ab{:}2, at{:}9$, and $bt$ of unknown positive weight $w$. For what value of $w$ do two different routes from $s$ to $t$ tie for the shortest path length?