試題詳解

40. OSPF (Open Shortest Path First) 路由協定以計算 “圖” (Graph) 上的最短路徑來決定路由，請問那種演算法可以求出圖的最短路徑？
(A)Dijkstra's algorithm
(B)Spanning-tree algorithm
(C)Depth-first search algorithm (DFS)
(D)Breadth-first search algorithm (BFS)