计算机科学 - 2026 进行中

科目: 计算机科学
级别: XII (I级最简单，XII级最难)
类别: 大学生
试题语言: English
题数: 15
问题示例: A directed graph is given in adjacency-list form. Which algorithm computes single-source shortest paths in linear time when every edge has weight either 0 or 1? Dijkstra’s algorithm with an arbitrary priority queue, 0–1 BFS using a deque, Floyd–Warshall algorithm, Kruskal’s algorithm
参与者: 2