☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
演算法
›
Ch4 圖論演算法
第 98 題／共 111 題
◀
AL 98/111
錯題回報
00:00
98. Single-Source Shortest Path、Dijkstra's Algorithm
#AL-04-098
中
Single-Source Shortest Path
Dijkstra's Algorithm
📝
☆
Which of the following statements about Single-Source Shortest Paths problem are incorrect?
A
If a graph
G
G
G
contains a negative-weight cycle, then all shortest paths do not exist.
B
A subpath of a shortest path is a shortest path.
C
Dijkstra's algorithm finds single-source shortest paths in graphs with nonnegative-weight cycle.
D
If binary heap is used, the worst-case time complexity of Dijkstra's algorithm is
O
(
E
+
V
log
V
)
O(E + V\log V)
O
(
E
+
V
lo
g
V
)
, where
E
E
E
represents the number of edges and
V
V
V
the number of vertices.
E
If the weight of all edges is the same, there is a faster algorithm than Dijkstra's algorithm to compute single-source shortest paths.
📝 寫筆記
📄 中央114
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 演算法》Ch4 圖論演算法
‹
本章題號 · 81–100 / 111
›
全部 111
易 42
中 62
難 7
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
