数据结构家谱图代码.docx

1、数据结构家谱图代码/main.cpp# include # include # include # include # include # include Head.hvoid main() HANDLE consolehwnd; /字体颜色的改变 consolehwnd = GetStdHandle(STD_OUTPUT_HANDLE); /字体颜色的改变 int chose,i; BinTree T; T=NULL; while(1) SetConsoleTextAttribute(consolehwnd,FOREGROUND_INTENSITY+FOREGROUND_RED); /字体颜

2、色的改变 printf(*家谱信息功能表*n); SetConsoleTextAttribute(consolehwnd,FOREGROUND_INTENSITY+FOREGROUND_BLUE|FOREGROUND_GREEN); printf(1:新建一个根节点n); printf(2:以添加成员节点构造家谱图n); printf(3:家谱树的层次显示n); printf(4家谱树保存到文件！n); printf(5:家谱树读入文件！n); printf(:家谱信息的删除n); printf(6:结束程序n); SetConsoleTextAttribute(consolehwnd,FOR

3、EGROUND_INTENSITY+FOREGROUND_RED); /字体颜色的改变 printf(*按以上功能表进行操作*n); SetConsoleTextAttribute(consolehwnd,FOREGROUND_INTENSITY+FOREGROUND_BLUE+FOREGROUND_GREEN+FOREGROUND_RED); for(i=1;i=100;) printf(请输入你在功能表上的选项:) ; scanf(%d,&chose); if(1=chose=11) break; else printf(你输入的选项不正确，请重新输入！n); switch(chose)

4、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); /

5、将家谱信息保存到文件中 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.

6、h# include # include # include # include # include # define QUEUESIZE 100typedef struct Data /出生日期结构体 int day; int month; int year;dataly;typedef struct BiTNode /个人资料信息 char live15; /建在（T表示活着，F表示过世） char name20; /姓名 char sex15; /性别 char marriage15; /是否已婚（Y为已婚，N为未婚） char birthadd20; /出生地 char address

7、15; /家庭地址 char profession20; /职业 char fathername20; /父亲姓名 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 QEl

8、emType; /*typedef struct int front; int rear; QElemType elemQUEUESIZE;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,BinTre

9、e 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

10、(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-da

11、ta; 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.year2013|p-birthday.year=0) printf(你输入的年份错误，请重新输入！n); return 0; if(12birthd