Question 3 Assume Given Arbitrary Graph G Distinct Unique Weights Capacities Every Edge Fo Q43812363
QUESTION 3 Assume you are given an arbitrary graph G which has distinct/unique weights or capacities on every edge. From the following statements mark only ones which are true given this situation! Note: wrong answers count negative. a. There is a unique maximum flow path (not the flow value, but the flow itself) b. The shortest path is unique between every pair of vertices. c. The minimum spanning tree is unique. Show transcribed image text QUESTION 3 Assume you are given an arbitrary graph G which has distinct/unique weights or capacities on every edge. From the following statements mark only ones which are true given this situation! Note: wrong answers count negative. a. There is a unique maximum flow path (not the flow value, but the flow itself) b. The shortest path is unique between every pair of vertices. c. The minimum spanning tree is unique.
Expert Answer
Answer to QUESTION 3 Assume you are given an arbitrary graph G which has distinct/unique weights or capacities on every edge. From…
OR