C++类霍夫曼树文本解码与编码

#include
#define UNVISITED 0;
using namespace std;
template
class edge
{
public:
int start, end;
int weight; //start是边的始点，end是边的终点，weight是边的权重
edge();
edge(int st, int en, int w) //构造边（st,en），权重为w
{
start = st;
end = en;
weight = w;
}
bool operator >(edge oneedge); // 重载运算符>,通过边权重比较变的大小
bool operator <(edge oneedge); // 重载运算符<,通过边权重比较变的大小
};

template
class graph
{
public:
int vertexnum; //图顶点的数目
int edgenum; //图边的数目
int *mark; //标记某些顶点是否被访问过
EdgeType pro;
graph(){
vertexnum = 0;
edgenum = 0;
}
graph(int ver)
{
vertexnum = ver;
edgenum = 0;
mark = new int[vertexnum];
pro = new EdgeType[vertexnum];
for (int i = 0; i < vertexnum; i++)
{
mark[i] = UNVISITED;
}
}
virtual edge firstedge(int one) = 0; // 返回与顶点one相关联的第一条边
virtual edge nextedge(edge one) = 0;//返回与on有相同起点的下一条边
bool isedge(edge one)
{
if (one.weight>0&& one.end >= 0)
return true;
else
return false;
}
};
template
class Agraph :public ::graph
{
private:
int **mat; //指向邻接矩阵的指针
public:
Agraph(){}
Agraph(int ver) :graph(ver)
{
int i, j;
mat = new int*[ver]; //申请ver大小的mat数组
for (i = 0; i < ver; i++)
mat[i] = new int[ver];
for (i = 0; i < ver; i++)
{
for (j = 0;; j < ver; j++)
mat[i][j] = 0;
}
}
edge firstedge(int one) //返回顶点one的第一条边
{
edge tmp; //将边tmp作为函数的返回值
tmp.start = one; //将one作为边的起点
for (int i = 0; i < vertexnum; i++)
{
if (mat[one][i] != 0)
{
tmp.end = i;
tmp.weight = mat[one][i];
break;
}
}
return tmp;
}
edge nextedge(edge one) //返回与边one右相同起点的下一条边
{
edge tmp;
tmp.start = one.start;
for (int i = one.end + 1; i < ver; i++)
{
if (mat[one.start][i] != 0)
{
tmp.end = i;
tmp.weight = mat[one.start][i];
break;
}
}
return tmp;
}
void setedge(int start, int end, int weight)
{
if (mat[start][end] == 0)
{
edgenum++;
}
mat[start][end] = weight;
}
void deledge(int start, int end)
{
if (mat[start][end] != 0)
{
edgenum--;
}
mat[start][end] = 0;
}
void build()
{
EdgeType a;
/*cout << "输入要建的图的顶点个数:";
cin >> n;
Agraph(n);*/
cout << "输入顶点所包含的内容：";
for (int i = 0; i < vertexnum; i++)
{
cin >> a;
pro[i] = a;
}
cout << "建立个顶点之间的边:";
int i=0,j=0,n = 0;
while (i < 0 || j <0 || n < 0)
{
cout << "请依次输入起点

，终点和权重（当三者有一个为负数时结束!!）";
cin >> i >> j >> n;
setedge(i, j, n);
}
}
};
int main()
{
Agraph a(5);
a.build();
return 0;
}