Provided an example of the weighted directed graph G = (V, E) with weight function ω: E→R and source vertex s such that the G satisfies following property:
For each edge (u,v)∈E, there is the shortest-paths tree rooted at s which consists of (u, v) and another shortest-paths tree rooted at s which does not consists of (u, v).