From 0bfd53394e9062d284586319a50aaf6cc23755eb Mon Sep 17 00:00:00 2001
From: Shixiaocaia <68102662+shixiaocaia@users.noreply.github.com>
Date: Wed, 30 Aug 2023 11:35:06 +0800
Subject: [PATCH] =?UTF-8?q?Update=200797.=E6=89=80=E6=9C=89=E5=8F=AF?=
 =?UTF-8?q?=E8=83=BD=E7=9A=84=E8=B7=AF=E5=BE=84=20Go=E5=86=99=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

更新函数名为dfs
---
 problems/0797.所有可能的路径.md | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/problems/0797.所有可能的路径.md b/problems/0797.所有可能的路径.md
index 5c209f60..e97a6d0d 100644
--- a/problems/0797.所有可能的路径.md
+++ b/problems/0797.所有可能的路径.md
@@ -223,8 +223,8 @@ class Solution:
 func allPathsSourceTarget(graph [][]int) [][]int {
     result := make([][]int, 0)
 
-    var trace func(path []int, step int)
-    trace = func(path []int, step int){
+    var dfs func(path []int, step int)
+    dfs = func(path []int, step int){
         // 从0遍历到length-1
         if step == len(graph) - 1{
             tmp := make([]int, len(path))
@@ -235,11 +235,11 @@ func allPathsSourceTarget(graph [][]int) [][]int {
 
         for i := 0; i < len(graph[step]); i++{
             next := append(path, graph[step][i])
-            trace(next, graph[step][i])
+            dfs(next, graph[step][i])
         }
     }
     // 从0开始，开始push 0进去
-    trace([]int{0}, 0)
+    dfs([]int{0}, 0)
     return result 
 }