int dist[N];
int g[N][N];
int res;
int n;
bool st[N];
void prime(){
for (int i = 0; i < n; i ++ )
{
int t = -1;
for (int j = 1; j <= n; j ++ )
if (!st[j] && (t == -1 || dist[t] > dist[j]))
t = j;
res += dist[t];
st[t] = true;
for (int j = 1; j <= n; j ++ ) dist[j] = min(dist[j], g[t][j]);
}
}
prime算法模板
最新推荐文章于 2021-02-25 07:56:29 发布