Consider the graph below: Which of the following are computed by the Djkstra alg

Question

Consider the graph below: Which of the following are computed by the Djkstra algorithm while it is running? (Select all that are D Positive weights of all ordered pairs: w(A,B), w(A,C), w(A,D), w(A,E), w(B,C), w(B, D), w(B,D), w(C,D), w(C,E), w(D,E) Initial node such as A O Cost labels of all internal nodes. Cost label of the final node such as D O Negative or positive weights of edges: w(A,B), w(A,C), w(B,C), w(B,D), w(C,E), wD,E) O Negative or positive weights of all ordered pairs: w(A,B), w(A,C), w(AD), w(A,E), w(B,C), w(B,D), wB,D), w(C,D) w(C,E), wD,E) O Final node such as D O Positive weights of edges: w(A,B), W(AC), w(B,C), w(B,D), w(C,E), w(D,E) The contents of the temporary set T

Explanation / Answer

/note:- if you have any query regarding this then comment below. please upvote

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---