DFS的栈做法

Posted 2022-12-14 幻觉czw

#include<iostream>//求出搜索路径
#include<stack>
using namespace std;
#define N 9
int main()

	stack<int>A;
	bool visit[N];
	memset(visit,0,sizeof(visit));
	bool arr[N][N]=
		0,0,0,0,0,1,1,0,0,
		1,0,0,0,0,0,0,1,0,
		1,0,0,1,0,0,0,0,0,
		0,0,1,0,0,1,0,0,0,
		0,0,1,1,0,0,1,0,0,
		0,0,0,0,1,0,0,0,0,
		0,0,0,0,0,0,0,0,0,
		0,1,0,0,0,0,0,0,0,
		0,0,0,0,0,0,0,0,0
	;
	for(int i=0;i<N;++i)
	
		if(!visit[i])
		
			visit[i]=1;
			A.push(i);
			while(!A.empty())
			
				cout<<A.top()<<' ';
				int idx=A.top();
				A.pop();
				for(int j=0;j<N;++j)
				
					if(arr[idx][j]==1 && visit[j]==0)
					
						A.push(j);
						visit[j]=1;
						break;
					
				
			
		
	
	return 0;