title: Bellman-Ford algorithm trace
body: <p>I don't know where else to post this question, I just want to know if I did this trace correctly. I am given this diagram</p>
  <p><img src="https://i.imgur.com/LoJvT.png" alt="diagram" /></p>
  <p>and here is the question:</p>
  <blockquote>
  <p>Show the trace of the Bellman-Ford algorithm on the following directed graph, using vertex t as the source. In each pass, relax edges in the order of(x, t),(y, z),(u, t),(y, x),(u, y),(t, x),(t, y), (t, z),(z, x),(z, u). Show the d values after each pass. Does the graph have negatively weighted circles? How do you examine it by using the Bellman-Ford algorithm?</p>
  </blockquote>
  <p>The answer I got was u=12, t=0, x=4, y=12, and z=-3, and it doesn't have a negative weighted circle. This question is worth a lot of points and one mistake means minus a lot, so I don't know who else to have to check this for me. Thank you.</p>