void Warshall(int n)
{
int i, j, k;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (answers[j][i] == 1)
for (k = 1; k <= n; k++)
answers[j][k] = (answers[j][k] || answers[i][k]);
}
Warshall算法求传递闭包
最新推荐文章于 2021-06-20 10:39:24 发布