算法与编程基础 - 2026 进行中

科目: 算法与编程基础
级别: IX (I级最简单，XII级最难)
类别: 大学生
试题语言: English
题数: 15
问题示例: A directed graph is processed by repeatedly removing vertices with indegree zero. The process stops before all vertices are removed. What can be concluded? The graph is disconnected, The graph contains a negative-weight edge, The graph has more than one valid topological ordering, The graph contains a directed cycle