☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
演算法
›
Ch4 圖論演算法
第 11 題／共 111 題
◀
AL 11/111
錯題回報
00:00
11. 最短路徑、Dijkstra、Floyd-Warshall
#AL-04-011
中
最短路徑
Dijkstra
Floyd-Warshall
📝
☆
Properties of shortest path problem: Which of the following statements is/are correct?
A
Dijkstra's algorithm can be applied to any directed graph with no negative cycle.
B
The heap data structure is likely to be used in Dijkstra's algorithm.
C
Floyd-Warshall algorithm can be applied to any directed graph with negative weights.
D
Floyd-Warshall algorithm is based on the concept of dynamic programming.
E
Every shortest path in a weighted directed graph
G
G
G
will not change if an extra weight is added on every edge of
G
G
G
📝 寫筆記
📄 台大112
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 演算法》Ch4 圖論演算法
‹
本章題號 · 1–20 / 111
›
全部 111
易 42
中 62
難 7
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
