graph.h

最小切割的近似算法。希望能够对大家有所参考

#define N 32

struct edge
{
	int u, v;
	edge *nextedge;
};

struct set
{
	int vexnum, edgenum;
	struct edge **setedges;
};

class graph
{
private:
	int gsize;
	set *gsets;
	int ssize;
	int *vsid;
	struct edge gedges[128]; //////////
	int esize;
public:
	graph();
	~graph();
	bool DelEdge(int v1, int v2);
	bool MergeSet(int s1, int s2);
	void process();
};