diff --git a/codes/java/chapter_graph/graph_dfs.java b/codes/java/chapter_graph/graph_dfs.java index 1c542f4230..1b6dfbe192 100644 --- a/codes/java/chapter_graph/graph_dfs.java +++ b/codes/java/chapter_graph/graph_dfs.java @@ -43,7 +43,7 @@ public static void main(String[] args) { System.out.println("\n初始化后,图为"); graph.print(); - /* 深度优先遍历 BFS */ + /* 深度优先遍历 DFS */ List res = graphDFS(graph, v[0]); System.out.println("\n深度优先遍历(DFS)顶点序列为"); System.out.println(Vertex.vetsToVals(res)); diff --git a/codes/python/chapter_graph/graph_dfs.py b/codes/python/chapter_graph/graph_dfs.py index f4a81ed56e..febeda9494 100644 --- a/codes/python/chapter_graph/graph_dfs.py +++ b/codes/python/chapter_graph/graph_dfs.py @@ -42,7 +42,7 @@ def graph_dfs(graph: GraphAdjList, start_vet: Vertex) -> List[Vertex]: print("\n初始化后,图为") graph.print() - # 深度优先遍历 BFS + # 深度优先遍历 DFS res = graph_dfs(graph, v[0]) print("\n深度优先遍历(DFS)顶点序列为") print(vets_to_vals(res))