main.cpp

创建静态

#include"define.h"
#include"list.cpp"
#include"stack.cpp"
#include"bitree.cpp"
#include"huffmantree3.cpp"
#include"graph.cpp"
//全局变量比较少，功能多，代码简洁，大家可运行玩玩，有错误请发送错误报告，欢迎找茬



void main()
{
	for(flag=1;flag==1;)
	{
		switch(select())
		{
		case 1:
			for(flag2=1;flag2==1;)
			{
				switch(selectl())
				{
				case 1:L=inil();creatl(L);break;
				case 2:chal();break;
				case 3:charul();break;
				case 4:shanchul();break;
				case 5:printl(L);break;
				case 6:sort(L);break;
				case 7:nixu(L);break;
				case 8:cout<<lenl(L)<<endl;break;
				case 9:flag2=0;break;
				case 0:end();break;
				}
			}
			break;
		case 2:
			for(flag2=1;flag2==1;)
			{
				switch(selects())
				{	
				case 1:creats(S);break;
				case 2:hebing();break;
				case 3:chas();break;
				case 4:charus(S);break;
				case 5:shanchus(S);break;
				case 6:nipr(S);break;
				case 7:traverses(S,uprs);break;
				case 8:pipei();break;
				case 9:flag2=0;break;
				case 0:end();break;	
				}
			}
			break;	
		case 3:
			for(flag2=1;flag2==1;)
			{
				switch(selectt())
				{
				case 1:cret();break;
				case 2:tra();break;
				case 3:threa();break;
				case 4:traversal(thrt,upr);break;
				case 5:exchange(T);print(T,0);break;
				case 6:print(T,0);break;
				case 7:;break;
				case 8:;break;
				case 9:flag2=0;break;
				case 0:end();break;	
				}	
			}	
			break;
		case 4:M();break;
		case 5:HuffmanCoding(HT, HC, wei, n);break;
		case 6:huffmantree3();break;
		case 7:
			for(flag2=1;flag2==1;)
			{
				switch(selecttu())
				{
				case 1:creat(G);;break;
				case 2:DFStraverse(G,print);;break;
				case 3:BFStraverse(G,print);;break;
				case 4:tuopupaixu();;break;
				case 5:;break;
				case 6:;break;
				case 7:;break;
				case 8:;break;
				case 9:flag2=0;break;
				case 0:end();break;	
				}	
			}
			break;
		case 8:;break;
		case 9:;break;
		case 0:end();break;
		}
	}
}