minispantree.h

最小生成树：分别输入顶点信息、边的信息

#include <iostream.h>
#include <windows.h>
#include <stdio.h>
#include <stdlib.h>

#define		STRLEN		100

#define		OVERFLOW	-1
#define		OK			1
#define		NONEXIST	-1
//#define		ERROR		-1

typedef	enum VisState{YesVisit,NoVisit};
typedef struct VexNode{  //定义结点信息
	char data;		 //在这里假设结点的信息只用一个字符表示	
}VexNode;

typedef struct ArcNode{  //定义边的信息
	int				vex1pos,vex2pos; //边的两个结点
	unsigned int	weight;          //边的权重
	unsigned int	postag;			  //用来标记应该在此位置的现在所在位置
}ArcNode;

typedef struct {         //定义图的信息
	VexNode *vexset_p;
	ArcNode *arcset_p;
	int vexnum,arcnum;
}Graph;

typedef struct {//利用结点的信息进行MFSet处理
	VexNode *nsetptr;//指向结点集
	int *parent;
	int nodenum;
}MFSet;


int CreatUDG(Graph &G); 
int Locate(Graph G,char vex);
int Find_MFSet(MFSet S,int i);
int MinSpanTree(Graph G,MFSet &S);
//int SearchMiniArc(ArcNode &arc,bool &arc_record,Graph G);

int ReadFileToCreatUDG(Graph &G);
int ReadScreenToCreatUDG(Graph &G);