/*
P1706 全排列问题
https://www.luogu.org/problemnew/show/P1706
https://bbs.codeaha.com/problem-12031.html
深度优先搜索算法是如何搜索一张图的?
https://segmentfault.com/a/1190000015372033
深度优先搜索算法、广度优先搜索算法学不懂,可能是没理解搜索树
http://dy.163.com/v2/article/detail/EGMPTFKT05318EGN.html
深度优先搜索 Or 深度优先遍历详解
https://blog.csdn.net/qq_38442065/article/details/81634282
基本算法——深度优先搜索(DFS)和广度优先搜索(BFS)
https://www.jianshu.com/p/bff70b786bb6
【算法入门】深度优先搜索(DFS)
https://www.cnblogs.com/DWVictor/p/10048554.html
深度优先搜索 dfs(附模板+例题讲解)
https://blog.csdn.net/qq_43916464/article/details/96154030
深度优先搜索(DFS、深搜)
https://blog.csdn.net/bingfeilongxin/article/details/88599936
【萌新也能懂算法】深度优先搜索
https://www.bilibili.com/video/av37782490/
深度优先搜索算法
https://www.jianshu.com/p/d9830b7e6eea
图的遍历之 深度优先搜索和广度优先搜索
https://www.cnblogs.com/attitudeY/p/6790224.html
https://www.cnblogs.com/qzhc/p/10291430.html
https://blog.csdn.net/Strive_Y/article/details/81810012
图解广度优先搜索与深度优先搜索的区别
https://blog.csdn.net/weixin_43736974/article/details/86664307
*/
#include <stdio.h>
#include <stdlib.h>
int a[10],book[10],n,sum=0;
void dfs(int step)
{
printf("dfs(%d):\n",step);
评论0
最新资源