試卷名稱:110年 - 110 國立臺灣大學_碩士班招生考試_電信工程研究所丙組:資料結構與演算法(B)#113108
年份:110年
科目:研究所、轉學考(插大)◆資料結構與演算法
18. Suppose we run Dijkstra's single-source shortest-path algorithm on the following weighted directed graph with vertex a as
the source. In what order do the nodes get included into the set of verticcs for which the shortest path distances are
finalized?
(A) a, b, c, d, e,f
(B) a, b, c,f, d,e
(C) a, b, c, f,e, d
(D) a, b, e, c, f, d