(完整word版)数据结构家谱图代码

//main.cpp# include <stdio.h># include <string.h># include <stdlib.h># include <conio.h># include <windows.h># include "Head.h"void main(){HANDLE consolehwnd;//字体颜色的改变consolehwnd = GetStdHandle(STD_OUTPUT_HANDLE);//字体颜色的改变int chose,i;BinTree T;T=NULL;while(1){SetConsoleTextAttribute(consolehwnd,FOREGROUND_INTENSITY+FOREGROUND_RED);//字体颜色的改变printf("***************家谱信息功能表*************\n");SetConsoleTextAttribute(consolehwnd,FOREGROUND_INTENSITY+FOREGROUND_BLUE|F OREGROUND_GREEN);printf("1:新建一个根节点\n");printf("2:以添加成员节点构造家谱图\n");printf("3:家谱树的层次显示\n");printf("4家谱树保存到文件！\n");printf("5:家谱树读入文件！\n");printf(":家谱信息的删除\n");printf("6:结束程序\n");SetConsoleTextAttribute(consolehwnd,FOREGROUND_INTENSITY+FOREGROUND_RED);//字体颜色的改变printf("************按以上功能表进行操作*************\n");SetConsoleTextAttribute(consolehwnd,FOREGROUND_INTENSITY+FOREGROUND_BLUE+F OREGROUND_GREEN+FOREGROUND_RED);for(i=1;i<=100;){printf("请输入你在功能表上的选项:") ;scanf("%d",&chose);if(1<=chose<=11)break;elseprintf("你输入的选项不正确，请重新输入！\n");}switch(chose){case 1:system("cls"); //在控制台程序使用清屏函数InPut(T); //录入个人信息printf("按任意键返回"); //等待程序system("pause");system("cls");break;case 2:system("cls");Addchild(T); //比较兄弟岁数后再添加system("pause");system("cls");break;case 3:system("cls");LevelOutput(T);system("pause");system("cls");break;case 4:system("cls");KCreatTree(T); //将家谱信息保存到文件中system("pause");system("cls");break;case 5:system("cls");LCreateTree(T); //从文件中读出家谱成员的信息system("pause");system("cls");break;case 6:system("cls");exit(0);system("pause");system("cls");break;default:fflush(stdin);printf("你输入的选项不正确!\n");printf("请从新输入菜单的选项!\n");system("pause");system("cls");}}}//Head.h# include <stdio.h># include <string.h># include <stdlib.h># include <conio.h># include <windows.h># define QUEUESIZE 100typedef struct Data //出生日期结构体{int day;int month;int year;}dataly;typedef struct BiTNode //个人资料信息{char live[15]; //建在（T表示活着，F表示过世）char name[20]; //姓名char sex[15]; //性别char marriage[15]; //是否已婚（Y为已婚，N为未婚）char birthadd[20]; //出生地char address[15]; //家庭地址char profession[20]; //职业char fathername[20]; //父亲姓名int generation; //辈分int message; //接点孩子的个数int hight; //升高int age; //年龄dataly birthday; //出生日期dataly dieday; //死亡日期（如果其已经死亡）struct BiTNode *brother; //兄弟struct BiTNode *child; //孩子struct BiTNode *parent; //父母}BiTNode,*BinTree;typedef BinTree QElemType;/*typedef struct{int front;int rear;QElemType elem[QUEUESIZE];}SqQueue;*/typedef struct QNode{QElemType data;struct QNode *next;}QNode,*QueuePtr;typedef struct{QueuePtr front,rear;}LinkQueue;int JudgeTime(BinTree);int Comepare(BinTree);void InPut(BinTree &T);BinTree LevelFind(BinTree &T,BinTree a);void CreatfTree(BinTree &T);void Addchild(BinTree &T);void OutPut(BinTree T);void LevelOutput(BinTree T);void PreOrderD(BinTree T);void KCreatTree(BinTree &s);void KeepTTFile(BinTree T,FILE *fp);void PrinfTree(BinTree p,FILE *fp);void LAddchild(BinTree &T,LinkQueue &S,FILE *fp);void LCreateTree(BinTree &T);//function.cpp# include "Head.h"//********************************************************* //********************************************************* void InitQueue(LinkQueue &Q){if(!(Q.front=Q.rear=(QueuePtr)malloc(sizeof(QNode)))){exit(0);}Q.front->next=NULL;return;}int QueueEmpty(LinkQueue Q){return(Q.front->next==NULL);}int GetHead(LinkQueue Q,QElemType &e){if(Q.front==Q.rear){return 0;}e=Q.front->next->data;return 1;}void EnQueue(LinkQueue &Q,QElemType e){QueuePtr p;if(!(p=(QueuePtr)malloc(sizeof(QNode)))) {exit(0);}p->data=e;p->next=NULL;Q.rear->next=p;Q.rear=p;return;}int DeQueue(LinkQueue &Q,QElemType &e){QueuePtr p;if(Q.front==Q.rear)return 0;p=Q.front->next;e=p->data;Q.front->next=p->next;if(Q.rear==p)Q.rear=Q.front;free(p);return 1;}void QueueTraverse(LinkQueue Q){QueuePtr p;p=Q.front->next;while(p){printf("%d",p->data);p=p->next;}printf("\n");return;}//**************************************************************************** //**************************************************************************** int JudgeTime(BinTree p) //判断输入的出生日期是否正确{if(p->birthday.year>2013||p->birthday.year<=0){printf("你输入的年份错误，请重新输入！\n");return 0;}if(12<p->birthday.month||p->birthday.month<1){printf("你输入的年份错误，请重新输入！\n");return 0;}if(p->birthday.month==1||p->birthday.month==3||p->birthday.month==5||p->bi rthday.month==7||p->birthday.month==8||p->birthday.month==10||p->birthday.month==12) {if(31<p->birthday.day||p->birthday.day<1){printf("你输入的日期错误，请重新输入！\n");return 0;}}if(p->birthday.month=='4'||p->birthday.month=='6'||p->birthday.month=='11' ){if(30<p->birthday.day||p->birthday.day<1){printf("你输入的日期错误，请重新输入！\n");return 0;}}if(p->birthday.year%400==0||p->birthday.year%4==0&&p->birthday.year%100!=0 ){if(p->birthday.month==2){if(29<p->birthday.day||p->birthday.day<1){printf("你输入的日期错误！\n");return 0;}}}else{if(p->birthday.month==2){if(28<p->birthday.day||p->birthday.day<1){printf("你输入的日期错误！\n");return 0;}}}return 1;}//*************************************************************************** //*************************************************************************** int Comepare(BinTree q) //判断出生日期和死亡日期是否错误{if(q->dieday.year<q->birthday.year){printf("你输入的死亡年份日期错误，请重新输入！\n");return 0;}if(q->dieday.year==q->birthday.year){if(q->dieday.month<q->birthday.month){printf("你输入的月份死亡日期错误，请重新输入！\n");return 0;}}if(q->dieday.year==q->birthday.year){if(q->dieday.month==q->birthday.month){if(q->dieday.day<q->birthday.day){printf("你输入的天数死亡日期错误，请重新输入！\n");return 0;}}}return 1;}//**************************************************************************** //**************************************************************************** void InPut(BinTree &T){int i;T=(BinTree)malloc(sizeof(BiTNode));T->brother=NULL;T->child=NULL;T->parent=NULL;printf("*******请输入你入录人信息********\n");printf("请输入姓名:\n");scanf("%s",T->name);for(i=0;i<=100;i++){printf("请输入性别:(男（m）或女（f）)\n");scanf("%s",T->sex);if(strcmp(T->sex,"m")||strcmp(T->sex,"f")||strcmp(T->sex,"M")||strcmp(T->s ex,"F"))break;}T->generation=1;T->message=0;printf("请输入身高：\n");scanf("%d",&T->hight);printf("请输入家庭住址：\n");scanf("%s",T->address);printf("请输入出生地：\n");scanf("%s",T->birthadd);printf("请输入职业：\n");scanf("%s",T->profession);strcpy(T->fathername,"0");for(i=1;i<=3;i++){printf("请输入出生日期\n");printf("请输入年：\n"); //判断出生日期是否正确，如果不正确，请重新输入scanf("%d",&(T->birthday.year));printf("请输入月：\n");scanf("%d",&(T->birthday.month));printf("请输入日：\n");scanf("%d",&(T->birthday.day));int t=JudgeTime(T);if(t)break;}for(i=0;i<=100;i++){printf("请输入此人是否健在：（健在(l或L)，过逝(d或D)）\n");scanf("%s",T->live);if(strcmp(T->live,"l")==0||strcmp(T->live,"d")==0||strcmp(T->live,"L")==0| |strcmp(T->live,"D")==0)break;}if(strcmp(T->live,"d")==0||strcmp(T->live,"D")==0){for(i=1;i<=3;i++){printf("请输入死亡日期\n");printf("请输入年：\n");scanf("%d",&T->dieday.year);printf("请输入月：\n");scanf("%d",&T->dieday.month);printf("请输入日：\n");scanf("%d",&(T->dieday.day));if(Comepare(T))break;}}if(strcmp(T->live,"d")==0||strcmp(T->live,"D")==0){T->age=(T->dieday.year-T->birthday.year);}else{T->age=(2012-T->birthday.year);}printf("你已成功入录此人的信息\n");}//**************************************************************************** ****//**************************************************************************** ****BinTree LevelFind(BinTree &T,char Name[15]){BinTree e;if(T==NULL){printf("没有找到你输入的信息\n");return NULL;}else{LinkQueue S;InitQueue(S); //初始化队列EnQueue(S,T);while( !QueueEmpty(S)){DeQueue(S,e);if(strcmp(e->name,Name)==0){return e;}else{if(e->brother!=NULL)EnQueue(S,e->brother);if(e->child!=NULL)EnQueue(S,e->child);}}printf("没有找到你输入的信息\n");return NULL;}}//***********************************************************************//*********************************************************************** void CreatfTree(BinTree &T) //按层次遍历生成此家谱{BinTree p;LinkQueue S;InitQueue(S); //构造一个空队列T=(BinTree)malloc(sizeof(BiTNode));printf("请输入家谱成员的信息！\n");InPut(T);EnQueue(S,T); //T进入队列中while(!QueueEmpty(S)){DeQueue(S,p);if(p->message==0){continue;}else{int i=0,x=1;i=p->message;BinTree p1,p2;p2=p1=(BinTree)malloc(sizeof(BiTNode));printf("请输入%s第%d个孩子的信息:\n",p->name,x);InPut(p1);p1->parent=p;i--; //结点的孩子数EnQueue(S,p1);while(i!=0){x=x+1;BinTree p3;p3=(BinTree)malloc(sizeof(BiTNode));printf("请输入%s第%d个孩子的信息:\n",p->name,x);InPut(p3);p1->brother=p3;p3->parent=p;p1=p3; //将p3的地址保存起来，以便下次连接它的兄弟EnQueue(S,p3);i--;}p->child=p2;}}}//*************************************************************************** //*************************************************************************** void OutPut(BinTree T){printf("*******输出个人信息********\n");printf("\n姓名:%s",T->name);printf("\n性别:%s",T->sex);printf("\n年龄：");printf("%d",T->age);printf("\n辈分:");printf("%d",T->generation);printf("\n身高：");printf("%d",T->hight);printf("\n孩子的个数:");printf("%d",T->message);printf("\n家庭住址：");printf("%s",T->address);printf("\n出生地：");printf("%s",T->birthadd);printf("\n职业：");printf("%s",T->profession);printf("\n父亲姓名：");printf("%s",T->fathername);if (strcmp(T->live,"d")==0||strcmp(T->live,"D")==0 ){printf("\n死亡日期:");printf("%d ",T->dieday.year);printf("%d ",T->dieday.month);printf("%d \n",T->dieday.day);}printf("\n出生日期：%d %d %d\n",T->birthday.year,T->birthday.month,T->birthday.day);}//*************************************************************************** //*************************************************************************** void LevelOutput(BinTree T){BinTree e;e=(BinTree)malloc(sizeof(BiTNode));e=T;if(T==NULL){printf("此家谱图为空，没有信息可以输出！\n");return;}else{LinkQueue S;InitQueue(S); //初始化队列EnQueue(S,e);while( !QueueEmpty(S)){DeQueue(S,e);OutPut(e);if(e->brother!=NULL)EnQueue(S,e->brother);if(e->child!=NULL)EnQueue(S,e->child);}return;}}//************************************************************************** //************************************************************************** void PreOrderD(BinTree T){if(T){T->generation++;PreOrderD(T->brother);PreOrderD(T->child);}}//*************************************************************************** //*************************************************************************** void Addchild(BinTree &T) //比较兄弟岁数后再添加{char Name[15];BinTree Tree,p,t,t1;int c,i,j=1;if(T==NULL){T=(BinTree)malloc(sizeof(BiTNode));printf("家谱不存在，则新建家谱树\n");printf("请输入整个家谱图的信息:\n");CreatfTree(T);//调用创建家谱图}else{while(j){printf("请输入你的选项（1~2）：\n");printf("1：添加新成员作为整个家谱的祖先\n");printf("2：添加新成员作为某一成员的孩子\n");for(i=0;i<=3;i++){printf("选项为：");scanf("%d",&c);if(c==1||c==2){break;}elseprintf("你输入的选项有错，请重新输入！\n");}switch(c){case 1:Tree=(BinTree)malloc(sizeof(BiTNode));InPut(Tree);//输入增加节点的信息Tree->child=T;Tree->message++;T->parent=Tree;strcpy(T->fathername,Tree->name) ;PreOrderD(T);//递归函数将整个家族的辈分增加T=Tree;//将指针返回j=0;break;case 2:printf("请输入所添加成员的父亲姓名:\n你有3次机会\n");i=1;while((i++)!=4){scanf("%s",Name);p=LevelFind(T,Name);//将要插入的结点的父亲的指针找出来if(p==NULL){printf("父亲姓名输入错误\n你还有%d次机会\n请从新输入：\n",i-1);if (i==4) {return;}continue;}else{break;}}printf("请输入所添加成员的信息\n");Tree=(BinTree)malloc(sizeof(BiTNode));InPut(Tree); //输入增加节点的信息strcpy(Tree->fathername,p->name);Tree->generation=p->generation+1; //辈分加1if(p->child!=NULL){t1=p;t=p->child;while(t){if(Tree->age<=t->age){if(t->brother==NULL){t->brother=Tree;Tree->parent=p;p->message++; //辈分加1j=0;break;}if (Tree->age<=t->age&&Tree->age>=t->brother->age){Tree->brother=t->brother;t->brother=Tree;Tree->parent=p;p->message++;j=0;break;}t1=t;t=t->brother;continue;}else{Tree->brother=t;t1->child=Tree;Tree->parent=p;p->message++;j=0;break;}}}else{p->child=Tree;Tree->parent=p;p->message++;j=0;break;}break;default:printf("\n\n\t对不起,你的选择不在服务范围之内!\n");printf("\n请再次选择你所要的操作:\n");continue;}}}}//**************************************************************************** ****************//**************************************************************************** ****************void KeepTTFile(BinTree T,FILE *fp) //将树的信息保存到文件中{fprintf(fp,"%s ",T->name);fprintf(fp,"%s ",T->sex);fprintf(fp,"%d ",T->age);fprintf(fp,"%d ",T->generation);fprintf(fp,"%d ",T->hight);fprintf(fp,"%d ",T->message);fprintf(fp,"%s ",T->address);fprintf(fp,"%s ",T->birthadd);fprintf(fp,"%s ",T->profession);fprintf(fp,"%s ",T->fathername);fprintf(fp,"%s ",T->live);if (strcmp(T->live,"d")==0||strcmp(T->live,"D")==0){fprintf(fp,"%d ",T->dieday.year);fprintf(fp,"%d ",T->dieday.month);fprintf(fp,"%d ",T->dieday.day);}fprintf(fp," %d %d %d\n",T->birthday.year,T->birthday.month,T->birthday.da y);}//**************************************************************************** ******************//**************************************************************************** ******************void KCreatTree(BinTree &s) //层次遍历将家谱树保存在文件中{LinkQueue S;BinTree a,p;if (s==NULL){printf("家谱图的信息为空，不用保存到文件中！\n请重新构建家谱图·····\n");return;}FILE *fp;fp=fopen("familytree","wb+");if(fp==NULL){printf("Can not open file\n");exit (0);}InitQueue(S);EnQueue(S,s);while (!QueueEmpty(S)){DeQueue(S,a);KeepTTFile(a,fp);if (a->child!=NULL){EnQueue(S,a->child);p=a->child;while (p->brother!=NULL){EnQueue(S,p->brother); //将一个父亲的所以兄弟都压到队列中，层次保存文件p=p->brother;}}}fclose(fp);printf("家谱信息已成功保存到文件中！\n");return;}//**************************************************************************** ******************//**************************************************************************** ******************void PrinfTree(BinTree T,FILE *fp){fscanf(fp,"%s ",T->name);fflush(stdin);fscanf(fp,"%s ",T->sex);fflush(stdin);fscanf(fp,"%d ",&T->age);fflush(stdin);fscanf(fp,"%d ",&T->generation);fflush(stdin);fscanf(fp,"%d ",&T->hight);fflush(stdin);fscanf(fp,"%d ",&T->message);fflush(stdin);fscanf(fp,"%s ",T->address);fflush(stdin);fscanf(fp,"%s ",T->birthadd);fflush(stdin);fscanf(fp,"%s ",T->profession);fflush(stdin);fscanf(fp,"%s ",T->fathername);fflush(stdin);fscanf(fp,"%s ",T->live);if (strcmp(T->live,"D")==0||strcmp(T->live,"d")==0){fscanf(fp,"%d ",&T->dieday.year);fflush(stdin);fscanf(fp,"%d ",&T->dieday.month);fflush(stdin);fscanf(fp,"%d ",&T->dieday.day);fflush(stdin);}fscanf(fp,"%d %d %d\n",&T->birthday.year,&T->birthday.month,&T->birthday.d ay);fflush(stdin);}//**************************************************************************** *************************//**************************************************************************** **************************void LAddchild(BinTree &T,LinkQueue &S,FILE *fp) //按层次遍历将孩子存储在文件{int i=0;i=T->message;BinTree p1,p2;p2=p1=(BinTree)malloc(sizeof(BiTNode));p1->child=NULL;p1->brother=NULL;p1->parent=T;T->child=p2;i--; //结点的孩子数PrinfTree(p1,fp); //将T结点的信息读入到文件中EnQueue(S,p1);while(i!=0){BinTree p3;p3=(BinTree)malloc(sizeof(BiTNode));p3->parent=T;p3->child=NULL;p3->brother=NULL;p1->brother=p3;p1=p3; //将p3的地址保存起来，以便下次连接它的兄弟PrinfTree(p3,fp);EnQueue(S,p3);i--;}}//**************************************************************************** ***********//**************************************************************************** ***********void LCreateTree(BinTree &T) //从文件中读入成员信息按层次遍历生成家谱{BinTree p;T=(BinTree)malloc(sizeof(BiTNode));T->brother=NULL; //将T的孩子和兄弟初始化为空；T->child=NULL;T->parent=NULL;LinkQueue S;InitQueue(S); //构造一个空队列printf("从文件中读入家谱的成员\n");FILE *fp;fp=fopen("familytree","rb+");if(fp==NULL){printf("Can not open file\n");exit (0);}PrinfTree(T,fp); //将T结点的信息读入到文件中EnQueue(S,T); //T进入队列中while(!QueueEmpty(S)){DeQueue(S,p);if(p->message==0){continue;}else{LAddchild(p,S,fp);}}fclose(fp);printf("家谱信息已从文件中成功读出！\n");return;}。