算法基础-搜索与图论

3

1 2 3
1 3 2
2 1 3
2 3 1
3 1 2
3 2 1

void dfs(int u){
	
	if(u == n)
	{	
		for(int i = 0; i < n; i ++ ) 
			cout << path[i] << ' ';
		cout << endl;
		return; 
	}
	else 
	{	

		for(int i = 1; i <= n; i ++ ) 
		{	
			if(!st[i])
                                      			{	 
				path[u] = i; 
				st[i] = 1; 
				dfs(u + 1); 
				st[i] = 0; // 回溯 
			}
		}
	}

}

#include <iostream>

using namespace std;  

const int N = 10; 
int n, path[N]; 
bool st[N]; 


void dfs(int u){
	
	if(u == n)
	{	
		for(int i = 0; i < n; i ++ ) 
			cout << path[i] << ' ';
		cout << endl;
		return; 
	}
	else 
	{	
		for(int i = 1; i <= n; i ++ ) 
		{	
			if(!st[i])
			{	
				path[u] = i; 
				st[i] = 1; 
				dfs(u + 1); 
				st[i] = 0; 
			}
		}
	}

}

int main (){
    cin >> n; 
    dfs(0); 
    return 0; 
    
}