mst.h

最小生成树 MST的四种算法实现。 包括普通的Kruskal算法和Prim算法

#ifndef MST_H
#define MST_H

#include <iostream>

using namespace std;

#define maxn			1000
#define maxm			110000
#define maxLen			10000
#define	TestTime		3
#define oo				100000000
#define	inputfilename	"mst.in"
#define outputfilename	"mst.out"

struct edge_t {
	int a, b, len;
};

void	prim_normal_read(int &n, int &m);
int		prim_normal(int &n, int &m);
void	kruskal_normal_read(int &n, int &m);
int		kruskal_normal(int &n, int &m);
void	prim_heap_read(int &n, int &m);
int		prim_heap(int &n, int &m);
void	kruskal_disjoint_set_read(int &n, int &m);
int		kruskal_disjoint_set(int &n, int &m);

#endif