☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
演算法
›
Ch5 NP Complete Problems
第 14 題／共 30 題
◀
AL 14/30
錯題回報
00:00
14. NP-Hard、Graph Problems
#AL-05-014
中
NP-Hard
Graph Problems
📝
☆
Assume that
N
P
≠
P
NP \ne P
N
P
=
P
. Which of the following problem(s) is(are) NP-hard?
A
(A) Finding a longest simple path between two nodes in a directed graph where the edge-weight is one for every edge.
B
(B) Finding a smallest cycle in a graph where the edge weight is one for every edge.
C
(C) Finding a largest cycle in a graph, where the edge weight is one for every edge.
D
(D) Finding a negative-weight cycle with any kind (positive or negative) of edge weights.
E
(E) Finding a shortest simple path between two nodes in a directed graph with negative-weight cycles.
📝 寫筆記
📄 交大110
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 演算法》Ch5 NP Complete Problems
‹
本章題號 · 1–20 / 30
›
全部 30
易 13
中 17
難 0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
