Consider the following statements:
(i) Let P be a shortest path from some vertex s to some other vertex t in a directed graph. If the weight of each edge in the graph is increased by one, P will still be a shortest path from s to t.
(ii) If a topological sort exists for the vertices in a directed graph, then a DFS on the graph will produce no back edges.
(iiI) Both DFS and BFS require \(Ω(V )\) storage for their operation.
Which of the above statement/s is/are correct ?
1
(i) and (ii) only
2
(iii) only
3
(ii) and (iii) only
4
All are correct