問題詳情

6.Apply Dijkstra’s Algorithm to find a shortest path from a to f. Indicate what is your shortest path and the total weight of the path. You must show every step in order to get full credits. (14 pts)

參考答案

答案：C
難度：簡單0.737632
統計：A(81),B(32),C(1819),D(136),E(0)

用户評論

【Jimmy Huang】評論

角迴區

【Tsai Hui Lien】評論

人類腦子裡主宰短期記憶的結構：海馬回 左右腦各ㄧ。