Q138
Dijkstra's Algorithm run on a weighted, directed graph G=V,E with non-negative weight function w and source s, terminates with d[u]=delta(s,u) for all vertices u in V.
A.
True
AnswerB.
False
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board