卷別

資料結構與演算法

選擇

國立中興大學 2025 · 考試 · 第 10 題

考科演算法

(3 points) Which of the following statements about topological sorting in a directed acyclic graph (DAG) is true?

(A)
A DAG can have multiple valid topological orders.
(B)
A strongly connected graph always has at least one topological order.
(C)
Topological sorting guarantees a unique order in any DAG.
(D)
A directed graph with a cycle can still have a valid topological order.

標準解析

AI 已複查