图的遍历（PTA题目解答）

mycode:

#include <iostream>
#include <vector>
#include <queue>
using namespace std;


void dfs(vector<vector<int>> a,int i,vector<int> &test,vector<int> &dfs_sub)
{
	test[i] = 1;
	for (int j = 0; j < a[i].size(); j++)
	{
		if (a[i][j] == 1&& !test[j])
		{
			dfs_sub.push_back(j);
			dfs(a, j,test,dfs_sub);
		}
	}
	return;

}

int main(int argc, char *argv[])
{
	int n;
	int e;

	cin >> n;
	cin >> e;
	
	vector&