Q26
In a graph with weighted edges, what does the term "relaxation" refer to in shortest path algorithms?
A.
Expanding the adjacency list of a vertex.
B.
Removing edges that cause negative cycles.
C.
Updating the shortest path estimate if a shorter path is found.
AnswerD.
Adding a new vertex to the graph.
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board