题型：单选题
给定一个无向图，图的节点编号从 0 到 n-1，图的边以邻接表的形式给出。编写的一个python程序，使用深度优先搜索（DFS）遍历该图，并输出遍历的节点顺序。
下面程序中横线处应该填写的是（）
def dfs(graph, start, visited=None):
if visited is None:
visited = set()
visited.add(start)
print(start, end=" ")
for neighbor in graph[start]:
if neighbor not in visited:
________________
graph = {
0: [1, 2],
1: [0, 3, 4],
2: [0, 5],
3: [1],
4: [1, 5],
5: [2, 4]
}
print("DFS 遍历顺序:")
dfs(graph, 0) | A． dfs(graph, neighbor, visited) |
B． dfs(graph+1, neighbor, visited) |
| C． dfs(graph, neighbor) |
D． dfs(graph+1, visited) |
更新时间：2025-06-21 12:22:07
|
【知识点】
CCF—GESP Python七级
抱歉! 您未登录, 不能查看答案和解析点击登录
相似题推荐
单选题
下面程序的运行结果为（ ）。
def query(n, a, x): left = 0 right = n while left < right: mid = left + (right - left) // 2 if a[mid] >= x: right = mid else: left = mid + left if left == n: return -1 return left if __name__ == "__main__": n = 10 x = 3 num = [1, 2, 2, 3, 3, 4, 5, 5, 6, 7] result = query(n, num, x) print(result)
| A． 2 |
B． 3 |
| C． 4 |
D． 5 |
2026-07-18
