这个比较简单,只需要按行访问未访问的元素即可(用一个数组记录是否访问的情况),同时访问后将其入队,实现广度优先。队空时遍历完成。
#include <iostream>
#include <list>
#include <string>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
bool edge[100][100] = { false };
bool visited[100]= { false };
string ans = "";
list <int> BFS;
for (int i = 0; i <= n - 1; i++)
{
for (int j = 0; j <= n - 1; j++)
{
cin >> edge[i][j];
}
}
int p = m - 1;
cout << m << " ";
visited[p] = true;
for (;;)
{
for (int i = 0; i <= n - 1; i++)
{
if (edge[p][i]&&!visited[i])
{
ans = ans + (char)(i + 1 + 48) + " ";
//push
BFS.push_back(i);
visited[i] = true;
}
}
if (!BFS.empty())
{
p = BFS.front();
BFS.pop_front();
}
else break;
}
for (int i = 0; i <= ans.length() - 2; i++)
{
cout << ans[i];
}
}