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 needed) The contents of the temporary set T Cost label of the final node such as 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(BD), w(C,D), w(C,E), w(D,E) Initial node such as A Final node such as D Negative or positive weights of all ordered pairs: w(A,B), wA,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) Negative or positive weights of edges: w(A,B), w(A,C), w(B,C), w(B,D), w(C,E), w(D,E) Cost labels of all internal nodes. Positive weights of edges: w(A,B), w(A,C), w(B,C), w(B,D), w(C,E), w(D,E)

Explanation / Answer

By applying djkstra algorithm we can computed the below staements:

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---