#include <iostream>
using namespace std;
const int N = 100;
int arr[N][N];
int visited[N];
int n;
string s;
void dfs(int begin)
{
cout << s[begin];
visited[begin] = 1;
for (int i = 0; i < n; i++)
{
if (arr[begin][i] != 0 && !visited[i])dfs(i);
}
}
int main()
{
cin >> n;
cin >> s;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> arr[i][j];
char e;
cin >> e;
int begin = s.find(e);
dfs(begin);
return 0;
}
swust oj1068: 图的按录入顺序深度优先搜索
最新推荐文章于 2024-05-31 11:51:41 发布