Unverified Commit 243cb00b authored by partychicken's avatar partychicken Committed by GitHub
Browse files

Update dfs.md

parent 509c6c68

docs/search/dfs.md

+10 −7
Original line number Diff line number Diff line
@@ -51,12 +51,17 @@ dfs(n) { 


## 实现（不对于图来说）



[Luogu P1706 全排列问题](https://www.luogu.org/problemnew/show/P1706)



C++ 代码：



```cpp

bool vis[N];//访问标记数组

int a[N];//排列数组，按顺序储存当前搜索结果



void dfs(int step)

{

    if (step == n+1)

    if (step == n + 1)//边界

    {

        for (int i = 1; i <= n; i++)

        {
@@ -67,20 +72,18 @@ void dfs(int step) 
    }

    for (int i = 1; i <= n; i++)

    {

        if (book[i] == 0)

        if (vis[i] == 0)

        {

            book[i] = 1;

            vis[i] = 1;

            a[step] = i;

            dfs(step + 1);

            book[i] = 0;

            vis[i] = 0;

        }

    }

    return;

}

```



> 对于 [Luogu P1706 全排列问题](https://www.luogu.org/problemnew/show/P1706)



## 实现（对于图来说）



伪代码：