图的DFS 邻接表和邻接矩阵

#include <iostream>
#include <cstdio>
#include<vector>
#include<stack>
#include<list>
using namespace std;
//递归
void dfs(int n, const vector<vector<int>>&isconnected ,vector<int>&visited)
{
	
	cout << n << ' ';//输出当前顶点
	visited[n] = 1;
	for (int j = 0; j < isconnected.size(); j++)
	{
		if (visited[j]) continue;
		if (!visited[j] && isconnected[n][j])
		{
			dfs(j,isconnected,visited);
		}
	}

}
//递归遍历只能遍历到与n相连顶点的所有，不相连的则不能遍历输出
void dfs(int n,  vector <list<int>>&arr, vector<int>&visited)
{
	cout << n << ' ';
	visited[n] = 1;
	list<int>::iterator iter;
	for (iter = arr[n].begin(); iter != arr[n].end(); iter++)
	{
		if (!visited[*iter])
			dfs(*iter,arr,visited);
	}
}
//非递归
void dfs_nonrecursion(int n, vector <list<int>>&arr, vector<int>&visited)
{
	list<int>::iterator iter;
	cout << n << ' ';
	visited[n] = 1;
	stack<int>s;
	s.push(n);
	while (!s.empty())
	{
		int v = s.top();
		s.pop();
		if (!visited[v])
		{
			visited[v] = 1;
			cout << v << ' ';
		}
		for (iter = arr[v].begin(); iter != arr[v].end(); iter++)
		{
			if (!visited[*iter])
				s.push(*iter);
		}

	}
}
void dfsMatrix_nonrecursion(vector<vector<int>>&isconnected, vector<int>&visited)
{
	int n = isconnected.size();
	for (int i = 0; i < n; i++)
	{
		if (visited[i]) continue;//已经访问的顶点不再操作
		cout << i << ' ';
		visited[i] = 1;
		stack<int>s;
		s.push(i);
		while (!s.empty())
		{
			int v = s.top();
			s.pop();
			if (!visited[v])
			{
				visited[v] = 1;
				cout << v << ' ';
			}
			for (int j = 0;j<n;j++)
			{
				if (!visited[j]&&isconnected[v][j])
					s.push(j);
			}
		}

	}
	cout << endl;
}
int main()
{
	//邻接矩阵

	int n, m;
	cin >> n >> m;//有n个顶点m条边
	vector<vector<int>>vv(n, vector<int>(n));
	vector<int>visited(n);
	//	cout << vv.size() << endl;

	int i, j;
	int k = m;
	for (; k > 0; k--)
	{
		cin >> i >> j;
		vv[i][j] = 1;
		vv[j][i] = 1;

	}
	for (int ii = 0; ii < n; ii++)
	{
		for (int jj = 0; jj < n; jj++)
		{
			cout << vv[ii][jj] << ' ';
		}
		cout << endl;
	}
	
	//dfs(0, vv, visited);
	dfsMatrix_nonrecursion(vv, visited);
	
	/*vector<list<int>>v;
	list<int>l1 = { 1,2,3 };
	v.push_back(l1);
	list<int>l2 = { 0,4};
	v.push_back(l2);
	list<int>l3 = { 0,4,5 };
	v.push_back(l3);
	list<int>l4 = { 0 };
	v.push_back(l4);
	list<int>l5 = { 1,2};
	v.push_back(l5);
	list<int>l6 = { 2 };
	v.push_back(l6);

	int n = v.size();
	vector<int>visited(n);*/

	//dfs(0, v, visited);
	//dfs_nonrecursion(0, v, visited);

	system("pause");
	return 0;
}

总结：dfs的非递归遍历和图的bfs结构是一样的，只是容器改变了