摘要:
简单的模板题:prim算法适合浓密图: 1 #include<stdio.h> 2 #include<string.h> 3 #define MAXN 110 4 #define INF 100000000 5 6 int n, v[MAXN], low[MAXN], w[MAXN][MAXN]; 7 8 void solve() 9 {10 int ans = 0;11 memset(v,0,sizeof(v));12 v[0] = 1;13 for(int i = 1; i < n; i ++) low[i] = w[0]... 阅读全文