Give an example of a weighted, directed graph G = (V, E) with weight function w : E → ℝ and source vertex s such that G satisfies the following property: For every edge (u, ν) ∈ E, there is a shortest-paths tree rooted at s that contains (u, ν) and another shortest-paths tree rooted at s that does not contain (u, ν).