☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
演算法
›
Ch4 圖論演算法
第 64 題／共 111 題
◀
AL 64/111
錯題回報
00:00
64. Topological Sort、Dijkstra's Algorithm、Directed Graph
#AL-04-064
中
Topological Sort
Dijkstra's Algorithm
Directed Graph
📝
☆
For the given directed weighted graph below:
A
(A) In every topological sort of the graph, R has to appear after U.
B
(B) The path from S to T with the most total weight includes four edges.
C
(C) The path from S to T found by Dijkstra's algorithm contains three edges.
D
(D) If we add an edge from P to U with weight=0, we can still obtain a valid topological sort.
E
(E) If we add an edge from P to U with weight=0, the Dijkstra's algorithm will still find the same path from S to T as before the edge is added.
📝 寫筆記
📄 交大110
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《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
