DFS的简单应用

/*DFS模型
void DFS(int x)
{
判断边界
尝试每一种可能 for循环
{继续下一步}
返回
}*/
#include"iostream"
using namespace std;
int num[10], book[10];
void DFS(int depth,int n)
{
if (depth > n)
{
for (int i = 1; i <= n; i++)
cout << num[i]<<"   ";
cout << endl;
return;
}
for (int i = 1; i <= n; i++)
{
if (book[i] == 0)
{
num[depth] = i;
book[i] = 1;
DFS(depth + 1, n);
book[i] = 0;
}
}
}
int main()
{
int n;
while (cin >> n)
{
memset( num, 0,sizeof(num));
memset(book, 0, sizeof(num));
DFS(1, n);
}
return 0;
}