☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
演算法
›
Ch4 圖論演算法
第 69 題／共 111 題
◀
AL 69/111
錯題回報
00:00
69. Dijkstra's Algorithm、Shortest Path
#AL-04-069
易
Dijkstra's Algorithm
Shortest Path
📝
☆
For the directed weighted graph below, compute the shortest paths using Dijkstra's algorithm with node b as the source node. Which of the following statement(s) is(are) true?
A
(A) The shortest path from b to d is of the highest weight among all shortest paths of b to the other nodes.
B
(B) The paths from b to a, b to e, and b to f are of the same number of edges.
C
(C) The total weight of the path from b to h is 10.
D
(D) The longest number of edges in all shortest paths from b to the other nodes is four.
📝 寫筆記
📄 交大111
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 演算法》Ch4 圖論演算法
‹
本章題號 · 61–80 / 111
›
全部 111
易 42
中 62
難 7
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
