(精品論文)c++課程設(shè)計_信息管理系統(tǒng)

C+課程設(shè)計_信息管理系統(tǒng)#include #include #define MaxHEAP 100 using namespace std; class Elem private: int objectID; int priority; string proName; public: Elem(int objectID=0,int priority=0) setID(objectID); setPri(priority); setProN(proName); int getID() return objectID; int getPri() return priority; string getProN() return proName; void setID(int id) objectID=id; void setPri(int pri) priority=pri; void setProN(string s) proName=s; ; class Heap private: Elem itemsMaxHEAP; int size; public : Heap() Elem itemsMaxHEAP; setSize(0); void setSize(int sz) size=sz; int heapIsEmpty() return size=0; void heapInsert(Elem newItem) if(size=0)&(itemsparent.getPri()itemsplace.getPri() Elem temp=itemsparent; itemsparent=itemsplace; itemsplace=temp; place=parent; parent=(place-1/2); +size; heapRebuild(0); Elem heapDelete(int ID) Elem rootItem; if(!heapIsEmpty() for(int i=0;isize;i+) if(itemsi.getID()=ID) rootItem=itemsi; swap(itemsi,items0); items0=items-size; heapRebuild(0); else coutn錯誤:目錄為空endl; return rootItem; void heapInit() setSize(0); cout空的項目endl; void heapView() if(size=0) cout空的項目!endl; else cout共有項目數(shù): sizeendl; for(int ct=0;ctsize;ct+) coutID: itemsct.getID() 優(yōu)先級: itemsct.getPri() 名稱： itemsct.getProN()endl; void search(int ID) int N=0; for(int i=0;isize;i+) if(itemsi.getID()=ID) N+; coutID: itemsi.getID() 優(yōu)先級: itemsi.getPri() 名稱： itemsi.getProN()endl; if(!N) cout未找到匹配的項目endl; void heapRebuild(int root) int child=2*root+1; if(childsize) int rightChild=child+1; if(rightChild=itemschild.getPri() child=rightChild; if(itemsroot.getPri()=itemschild.getPri() Elem temp=itemsroot; itemsroot=itemschild; itemschild=temp; heapRebuild(child); ; class priQueue private: Heap h; public: priQueue() Heap(); int priIsEmpty() return h.heapIsEmpty(); void priInit() h.heapInit(); void priInsert(Elem newItem) h.heapInsert(newItem); Elem priDelete(int ID) return h.heapDelete(ID); void priView()h.heapView(); void search(int ID) h.search(ID); ; void showMenu() cout-endl; cout-*信息管理系統(tǒng)*-endl; cout-endl; cout 1.重置endl; cout 2.添加endl; cout 3.刪除endl; cout 4.查找endl; cout 5.顯示endl; cout 0.退出endl; cout-endl; void showTip() cout-_-操作完成！endl; cout-選擇05繼續(xù)endl; int main() string i=-1; int ID,PRI; string proName; Elem in; priQueue PQ; PQ.priInit(); system(cls); showMenu(); cout選擇菜單中的數(shù)字以便處理數(shù)據(jù)！i; system(cls); while(i!=0) if(i=1) system(cls); showMenu(); cout你選擇了1,項目將全部清空:endl; PQ.priInit(); showTip(); else if(i=2) system(cls); showMenu(); cout你選擇了2,輸入ID，優(yōu)先級，項目名稱endl; cout輸入 ID:ID; cout輸入優(yōu)先級:PRI; cout輸入項目名稱:proName; in.setID(ID); in.setPri(PRI); in.setProN(proName); PQ.priInsert(in); showTip(); else if(i=3) system(cls); showMenu(); cout你選擇了3,請選擇你要刪除的ID號ID; PQ.priDelete(ID); showTip(); else if(i=4) system(cls); showMenu(); cout你選擇了4,輸入要查找的項目ID號ID; PQ.search(ID); showTip(); else if(i