数据结构与算法MOOC / 第七章 图 练习题(Excercise for chapter7 graphs)9:社交网络
AC代码
#include <cstdio>
char mat[301][301];
int prev[301], stk[301], it_stk;
int treeFind(int n) {
if (prev[n] == n)
return n;
it_stk = 0;
while (prev[n] != n) {
stk[it_stk++] = n;
n = prev[n];