1 / 11
文档名称:

家谱图程序.doc

格式:doc   页数:11页
下载后只包含 1 个 DOC 格式的文档,没有任何的图纸或源代码,查看文件列表

如果您已付费下载过本站文档,您可以点这里二次下载

分享

预览

家谱图程序.doc

上传人:fy5186fy 2016/1/30 文件大小:0 KB

下载得到文件列表

家谱图程序.doc

文档介绍

文档介绍:家谱系统程序宁波大红鹰学院#include<>#include<>#include<>typedefstructTreeNode{charname[20];charsex[10];charspousename[20];TreeNode*brother;TreeNode*child;TreeNode*parent;}TreeNode,*TreeNodeP;TreeNodePtreehead;voidInterFace();TreeNodePInite();voidCreateFamily(TreeNodePtree);TreeNodePAddBrother(TreeNodePtree,TreeNodePbother);TreeNodePAddChild(TreeNodePtree,TreeNodePparents);TreeNodePFindNode(TreeNodePtree,char*tt);voidFindPeople(TreeNodePtree);voidPrintfFamily(TreeNodePtree);voidPrintfNode(TreeNodePtree);voidPrintfAllChildren(TreeNodePtree);voidAddMember(TreeNodePtree);voidModification(TreeNodePtree);voidHelp();voidInterFace(){intchoice;printf("\n----------------菜单--------------------\n");printf("\n");printf("\n");printf("\n");printf("\n");printf("\n");printf("\n");printf("\n");printf("\n");printf("\n");printf("------------------------------------------\n");printf("------------------------------------------\n");printf("输入你的选择:");scanf("%d",&choice);while(choice<1||choice>8){printf("请输入范围内的数字:");scanf("%d",&choice);}switch(choice){case1:{CreateFamily(treehead);break;}case2:{PrintfFamily(treehead);break;}case3:{FindPeople(treehead);break;}case4:{PrintfAllChildren(treehead);break;}case5:{AddMember(treehead);break;}case6:{Modification(treehead);break;}case7:{DelPerson(treehead);break;}case8:{Help();break;}case9:{exit(0);break;}}}TreeNodePInite(){TreeNodePp;char*s="sdf";p=(TreeNodeP)malloc(sizeof(TreeNode));printf("正在初始化一个家谱。。。\n");printf("\n请输入家谱顶端祖先的姓名:");scanf("%s",p->name);strcpy(p->sex,"man");printf("\n请输入顶端祖先配偶姓名:");scanf("%s",p->spousename);p->child=NULL;p->brother=NULL;p->parent=NULL;system("cls");returnp;}voidCreateFamily(TreeNodePtree){charflag;fflush(stdin);printf("\n\t给%s添加后代......",tree->name);tree->child=AddChild(tree->child,tree);}TreeNodePAddBrother(TreeNodePtree,TreeNodePbrother){charflag;tree=(TreeNodeP)malloc(sizeof(TreeNode));tree->parent=brother->parent;printf("\