Homework 3

Due Friday, October 6
5 points.
  1. (1 point) What is the priority for an edge in the minimal spanning tree search?

  2. (1 point) What is the priority for an edge in the single-source shortest paths search?

  3. (1 point) What is the invariant for the Floyd-Warshall algorithm?

  4. (1 point) What is done in the update step of the Floyd-Warshall algorithm?

  5. (1 points) What is the meaning of the edge weights in a flow network?