点击打开链接
求MST的最长边~
prim
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#define Min(a,b) (a)<(b)?(a):(b)
using namespace std;
const int INF = 1000000000;
const int maxn = 2000 + 5;
struct pto
{
int v, len;
};
vector<pto> G[maxn];
bool vis[maxn];
int dis[maxn];
int n, m;
int Prim()
{
int i, j, p, ans, minc;
memset(vis, 0, sizeof vis );
for(i=1; i<=n; ++i) dis[i] = INF;
dis[1] = 0;
ans = ......
阅读全文