grape.h

最小生成树的kruskal算法实现 使用mfc显示界面（可以随机生成边）

// Grape.h: interface for the Grape class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_GRAPE_H__E5754293_59EF_4139_8BB1_E166E9A47A72__INCLUDED_)
#define AFX_GRAPE_H__E5754293_59EF_4139_8BB1_E166E9A47A72__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
#include "MyPoint.h"
#include "MyEdge.h"
#include <vector>

class Grape  
{
public:
	void FindMST();
	void SortEdge(int inc);
	Grape();
	virtual ~Grape();
	void AddPoint(CPoint pp)
	{
		MyPoint p(pp.x, pp.y, vp.size());
		vp.push_back(p);
	}
	void GenerateEdge();
	std::vector<MyPoint> vp;
	std::vector<MyEdge> ve;
	std::vector<int> vIDofMSTEdge; 
};

#endif // !defined(AFX_GRAPE_H__E5754293_59EF_4139_8BB1_E166E9A47A72__INCLUDED_)