图书信息管理系统源程序.doc

m_book.c#include struct node char name10;int price;char pub15;extern struct node *add(),*del(struct node *);extern struct node *load(),*mhdel(struct node *);/*/* 函数功能：显示菜单，选择菜单 */* 输入参数：无 */* 函数输出：选择的菜单序号 */*/int menu_select()int cn=0;printf( *n);printf(tt 1. Add a bookn);printf(tt 2. Display book libraryn);printf(tt 3. Query a bookn);printf(tt 4. Delete a bookn);printf(tt 5. Save to diskn);printf(tt 6. Load from disk n);printf(tt 7. Mohu searchn);printf(tt 8. Mohu deleten);printf(tt 0. Exitn);printf(t*n);printf(n Input(08): );for(; ;) scanf(%d,&cn);if (cn8) printf(Error ! Input again(16):);elsebreak;return cn;void main(void)struct node *head=NULL;for(; ;) clrscr();switch(menu_select()case 1: head=add(head);break;case 2: print(head);break;case 3: search(head);break;case 4: head= del(head);break;case 5: save(head);break;case 6: head=load();break;case 7: mhsearch(head);break;case 8: head=mhdel(head);break;case 0: exit(0);s_book.c#include #include #include struct node char name10; float price; char pub15; struct node *link;struct node *add(struct node *head ) ; /* 函数功能：创建结点，输入结点数据 */void print(struct node *head); /* 函数功能：链表输出 */void save(struct node *head); /* 函数功能：链表存储 */void search(struct node *head); /* 函数功能：链表结点查找 */struct node *del(struct node *head); /* 函数功能：结点删除 */struct node *load(void); /* 函数功能：从文件中读入数据，创建链表 */struct node *mhdel(struct node *head); /* 函数功能：结点模糊删除 */void mhsearch(struct node *head); /* 函数功能：链表结点模糊查找 */*/* 函数功能：创建结点，输入结点数据 */* 输入参数：链表头指针 */* 函数输出：链表头指针 */*/struct node *add(struct node *head ) int i;float jg;struct node *p, *pnew;pnew=(struct node *)malloc(sizeof(struct node); printf(Please input book name,price,publishern);printf(name:);scanf(%s,pnew-name);printf(price:);scanf(%f,&jg);pnew-price=jg;printf(publisher:);scanf(%s,pnew-pub);pnew-link=NULL;if (head=NULL)return (pnew);p=head;while (p-link!=NULL) /* 找到尾结点 */p=p-link;p-link=pnew;return (head);/*/* 函数功能：链表输出 */* 输入参数：链表头指针 */* 函数输出：无 */*/void print(struct node *head) struct node *p;p=head;printf(nametpricetpublishern);while (p!=NULL)printf(%st%-5.2ft%-sn,p-name,p-price,p-pub);p=p-link;printf(nttPress any keys!);getch();/*/* 函数功能：链表存储 */* 输入参数：链表头指针 */* 函数输出：无 */*/void save(struct node *head) FILE *fp;struct node *p;if (fp=fopen(library,wb)=NULL) printf(Cant open file!n);exit(1);p=head;while (p!=NULL)fwrite(p,sizeof(struct node),1,fp);p=p-link;fclose(fp);/*/* 函数功能：从文件中读入数据，创建链表 */* 输入参数：无 */* 函数输出：链表头指针 */*/struct node *load(void)FILE *fp;struct node *p,*pnew,*phead;if (fp=fopen(library,rb)=NULL) printf(Cant open file!n);exit(1);pnew=(struct node *)malloc(sizeof(struct node);fread(pnew, sizeof(struct node),1,fp);pnew-link=NULL;phead=pnew;p=pnew;while (!feof(fp) pnew=(struct node *)malloc(sizeof(struct node);if (1!=fread(pnew, sizeof(struct node),1,fp) break;pnew-link=NULL;p-link=pnew;p=p-link;fclose(fp);return(phead);/*/* 函数功能：链表结点查找 */* 输入参数：链表头指针 */* 函数输出：无 */*/void search(struct node *head)char sname15;struct node *p;printf(Please input book namen);printf(name:);scanf(%s,sname);p=head;while (p!=NULL) if (strcmp(p-name,sname)=0)printf( name price publshiern);printf(Book Found: %s %5.2f %sn,p-name,p-price,p-pub);printf(nttPress any keys!);getch();return;p=p-link;printf(Book Not Exist!n);printf(nttPress any keys !); getch();/*/* 函数功能：结点删除 */* 输入参数：链表头指针 */* 函数输出：返回链表头指针 */*/struct node *del(struct node *head)char sn15,s;int flag=0;struct node *p,*q;printf(Please input book namen);printf(name:);scanf(%s,sn);p=head;while(p!=NULL)while(p!=NULL &(strcmp(p-name,sn)!=0) q=p;p=p-link;if(strcmp(p-name,sn)=0)& p!=NULL)flag=1;printf( name price publshiern);printf(Book Found: %s %5.2f %sn,p-name,p-price,p-pub);printf(Do you want to del this book(y/n);scanf(n%c,&s);if(s=y | s=Y)if(p=head)head=p-link;else q-link=p-link;free(p);printf(This book is deleted!n);printf(nttPress any keys !);getch();elseprintf(nThis book not delete!n);printf(nttPress any keys!);getch();return head;else if(flag!=1) printf(nNOT found!);printf(nttPress any key!);getch();break;if(p!=NULL) p=p-link; return head;void mhsearch(struct node *head)char s15;int flag=0;struct node *p;printf(Please input book namen);printf(name:);scanf(%s,s);p=head;while(p!=NULL)while(p!=NULL & (strstr(p-name,s)=NULL) p=p-link;if(strstr(p-name,s)!=NULL) printf( name price publshiern);printf(Book Found: %s %5.2f %sn,p-name,p-price,p-pub);flag=1;getch();else if(flag!=1) printf(nNOT found!);printf(nttPress any key!);getch();if(p!=NULL) p=p-link; struct node *mhdel(struct node *head)char sn15,s;int flag=0;struct node *p,*q;printf(Please input book namen);printf(name:);scanf(%s,sn);p=head;while(p!=NULL)while(p!=NULL &(strstr(p-name,sn)=NULL) q=p;p=p-link;if(strcmp(p-name,sn)!=NULL)& p!=NULL)flag=1;printf( name price publshiern);printf(Book Found: %s %5.2f %sn,p-name,p-price,p-pub);printf(Do you want to del this book(y/n);scanf(n%c,&s);if(s=y | s=Y)if(p=head)head=p-link;else q-link=p-lin