Find the shortest walk with negative weighted edges, but not cycle. Pseudo-code BellmanFord(𝑠):1for 𝑖←1 to 𝑉−1:2for all edge 𝑢→𝑣:3if 𝑢→𝑣 is tense:4relax(𝑢→𝑣)56for all edge 𝑢→𝑣:7if 𝑢→𝑣 is tense:8Fail// Negative cycle detected9 Runtime 𝑂(|𝑉‖𝐸|)