4. Let G be a weighted graph with positive edge weights. Let (u, v) be an...

Transcribed Image Text:

4. Let G be a weighted graph with positive edge weights. Let (u, v) be an edge in the graph. It is known that a shortest path from a source vertex s to u has weight 45 and a shortest path from s to u has weight 30. Choose all TRUE statements? U S C (c) (b) e O (a) weight({u, v}) = min (45, 30) (b) weight({u, v}) ≥ 15 (c) weight({u, v}) > 15 4 (d) weight({u, v)) ≥ 20 (e) weight({u, v}) > 20 (f) weight({u, v})= max(45, 30) 4. Let G be a weighted graph with positive edge weights. Let (u, v) be an edge in the graph. It is known that a shortest path from a source vertex s to u has weight 45 and a shortest path from s to u has weight 30. Choose all TRUE statements? U S C (c) (b) e O (a) weight({u, v}) = min (45, 30) (b) weight({u, v}) ≥ 15 (c) weight({u, v}) > 15 4 (d) weight({u, v)) ≥ 20 (e) weight({u, v}) > 20 (f) weight({u, v})= max(45, 30)

Answer rating: 100% (QA)

The detailed answer for the above question is provided below Lets analyze the given information A sh... View the full answer