課程設(shè)計故宮導(dǎo)游咨詢設(shè)計(最短路徑)

1、 故宮導(dǎo)游咨詢數(shù)學(xué)與計算機(jī)學(xué)院課程設(shè)計說明書課 程 名 稱: 數(shù)據(jù)結(jié)構(gòu)與算法課程設(shè)計 課 程 代 碼: 6014389 題 目: 故宮導(dǎo)游咨詢 年級/專業(yè)/班: 學(xué) 生 姓 名: 學(xué) 號: 開 始 時 間: 2011 年 12 月 9 日完 成 時 間: 2011 年 12 月 23 日課程設(shè)計成績：學(xué)習(xí)態(tài)度及平時成績（30）技術(shù)水平與實際能力（20）創(chuàng)新（5） 說明書（計算書、圖紙、分析報告）撰寫質(zhì)量（45）總 分（100）指導(dǎo)教師簽名： 年 月 日目 錄引 言- 4 -1、需求分析- 4 -1.1任務(wù)與分析- 4 -2 概要設(shè)計- 1 -2.1 adt描述- 1 -2.2程序模塊結(jié)構(gòu)- 2

2、 -2.3各功能模塊- 2 -3詳細(xì)設(shè)計- 3 -3.1結(jié)構(gòu)體定義- 3 -3.2 初始化- 3 -3.3 插入操作- 4 -3.4、錄入信息- 4 -3.5修改操作- 5 -3.6查詢操作- 6 -3.7刪除操作- 6 -3.8求到某一景點的路徑- 8 -3.9求到所有景點的路徑- 10 -3.10求到所有景點的路徑- 12 -3.11主函數(shù)- 15 -4 調(diào)試分析- 18 -4.1測試數(shù)據(jù)- 19 -4.2調(diào)試問題- 19 -4.3算法時間復(fù)雜度- 19 -4.4經(jīng)驗和體會- 19 -5用戶使用說明- 19 -6測試結(jié)果- 19 -6.1錄入信息- 19 -6.2查詢景點模塊- 21 -6

3、.3修改模塊- 22 -6.4插入模塊- 23 -6.5刪除模塊- 24 -6.6查詢到某景點最佳路徑- 25 -6.7查詢到所有景點的最短路徑。- 26 -結(jié) 論- 28 -致 謝- 29 -參考文獻(xiàn)- 30 -摘 要隨著計算機(jī)的普及，涉及計算機(jī)相關(guān)的科目也越來越普遍，其中數(shù)據(jù)結(jié)構(gòu)是計算機(jī)專業(yè)重要的專業(yè)基礎(chǔ)課程與核心課程之一，為適應(yīng)我國計算機(jī)科學(xué)技術(shù)的發(fā)展和應(yīng)用，學(xué)好數(shù)據(jù)結(jié)構(gòu)非常必要，然而要掌握數(shù)據(jù)結(jié)構(gòu)的知識非常難，所以對“數(shù)據(jù)結(jié)構(gòu)”的課程設(shè)計比不可少。本說明書是對“故宮導(dǎo)游咨詢”課程設(shè)計的說明。首先是對需求分析的簡要闡述，說明系統(tǒng)要完成的任務(wù)和相應(yīng)的分析，并給出測試數(shù)據(jù)。其次是概要設(shè)計，說

4、明所有抽象數(shù)據(jù)類型的定義、主程序的流程以及各程序模塊之間的層次關(guān)系，以及adt描述。然后是詳細(xì)設(shè)計，描述實現(xiàn)概要設(shè)計中定義的基本功操作和所有數(shù)據(jù)類型，以及函數(shù)的功能及代碼實現(xiàn)。再次是對系統(tǒng)的調(diào)試分析說明，以及遇到的問題和解決問題的方法。然后是用戶使用說明書的闡述，然后是測試的數(shù)據(jù)和結(jié)果的分析，最后是對本次課程設(shè)計的結(jié)論。關(guān)鍵詞：計算機(jī)、課程設(shè)計、數(shù)據(jù)結(jié)構(gòu) 引 言 數(shù)據(jù)結(jié)構(gòu)是計算機(jī)專業(yè)重要的專業(yè)基礎(chǔ)課程與核心課程之一，在計算機(jī)領(lǐng)域應(yīng)用廣泛，計算機(jī)離不開數(shù)據(jù)結(jié)構(gòu)。數(shù)據(jù)結(jié)構(gòu)課程設(shè)計為了能使我們掌握所學(xué)習(xí)的知識并有應(yīng)用到實際的設(shè)計中的能力，對于掌握這門課程的學(xué)習(xí)方法有極大的意義。本課程設(shè)計的題目為“故

5、宮導(dǎo)游咨詢”，完成相應(yīng)的錄入信息、查找、修改、刪除、計算功能等等。本課程設(shè)計采用的編程環(huán)境為microsoft visual stdio 6.0。1、需求分析 游客游覽某一景點時，對景點都不熟悉。特別是對于象故宮這樣的大型景點，如果隨便參觀的話，可能會錯過一些景點，也可能走許多冤枉路。為了方便游客，需要一套軟件系統(tǒng)，能夠為游客提供：查詢景點信息，給出到某個景點的最佳路線，給出到所有景點的最佳路線。為系統(tǒng)管理員提供以下功能：添加和撤銷景點，添加和撤銷旅游線路，修改景點信息。 1.1任務(wù)與分析 此系統(tǒng)要完成對故宮景點信息的儲存、修改、刪除、添加和查詢最短路線，因為涉及到最短路線問題，所以數(shù)據(jù)結(jié)構(gòu)優(yōu)

6、先考慮采用圖的鄰接矩陣儲存結(jié)構(gòu)，景點和旅游線路可以構(gòu)成圖狀結(jié)構(gòu)，景點作為圖的頂點，旅游線路作為圖的邊，邊上的權(quán)值作為景點間的距離。此結(jié)構(gòu)便于完成任務(wù)的各種操作。1.2測試數(shù)據(jù) 圖1 測試數(shù)據(jù)2 概要設(shè)計 2.1 adt描述 adt graph數(shù)據(jù)對象：d故宮景點和路徑數(shù)據(jù)關(guān)系：rvrvr=|v,wv，表示頂點v和頂點w之間的邊；基本操作： void creat();/錄入景點和路徑的信息。void select();/查找某景點的信息。void xiugai();/修改某景點的信息。void insert();/插入新的景點和路徑信息。void delet();/刪除景點和路徑信息。void

7、shortpath1();/查詢到某景點的最短路徑。void shortpath2();/查詢到所有景點的最短路徑。void main();/主函數(shù)。2.2程序模塊結(jié)構(gòu) 圖2 程序模塊結(jié)構(gòu)2.2.1 結(jié)構(gòu)體定義景點的結(jié)構(gòu)體定義如下：struct ding string dingdian; string xinxi;2.3各功能模塊錄入模塊:void creat()錄入景點和路徑的信息，并儲存。查詢景點模塊:void select()查找某景點的信息。修改模塊:void xiugai()修改某景點的信息。插入模塊:void insert()插入新的景點和路徑信息。刪除模塊:void delet(

8、)刪除景點和路徑信息。查詢到某景點最佳路徑:void shortpath1()：查詢到某景點的最短路徑。查詢到查詢到所有景點的最短路徑:void shortpath2()查詢到所有景點的最短路徑3詳細(xì)設(shè)計3.1結(jié)構(gòu)體定義景點的結(jié)構(gòu)體定義如下：struct ding string dingdian; string xinxi;3.2 初始化構(gòu)造函數(shù)初始化變量：graph:graph() for(int i=0;imaxvertices;i+) verticesi.dingdian=0; for(i=0;imaxvertices;i+) for(int j=0;jmaxvertices;j+)if

9、(i=j)edgeij=0;elseedgeij=maxweight;nume=0;numv=0;3.3 插入操作插入路徑和景點信息： void graph:insert() int i,vi,vj,w,x,y; coutxy; cout輸入添加景點名稱:endl; for(i=0;iy;i+) coutnumv+i+1verticesnumv+i.dingdian;cout verticesnumv+i.xinxi;cout添加成功!endl; for(i=0;ix;i+) coutvivjw; edgevi-1vj-1=w; edgevj-1vi-1=w; cout添加成功!endl; n

10、ume=x+nume; numv=y+numv;3.4、錄入信息void graph:creat() int i,vi,vj,w; coutnumenumv; cout輸入景點名稱:endl; for(i=0;inumv;i+) couti+1verticesi.dingdian;coutverticesi.xinxi; for(i=0;inume;i+) coutvivjw; edgevi-1vj-1=w; edgevj-1vi-1=w; 3.5修改操作void graph:xiugai() string a,c; int b=0; couta; for(int i=0;inumv;i+)

11、if(verticesi.dingdian=a) coutc;verticesi.xinxi=c;b+;cout修改成功!endl;if(b=0)cout不存在該景點！endl;3.6查詢操作void graph:select() string a; int b=0; couta; for(int i=0;inumv;i+)if(verticesi.dingdian=a)coutverticesi.xinxiendl;b+;if(b=0)cout不存在該景點！endl;3.7刪除操作void graph:delet() int x,y,z,k,v; coutkz; for(int j=0;jk

12、;j+) coutv; for(int i=0;inumv;i+) if(i!=v-1) edgev-1i=maxweight;edgeiv-1=maxweight; cout撤銷成功!endl; for(int i=0;iz;i+) coutxy; if(edgex-1y-1!=maxweight) edgex-1y-1=maxweight; edgey-1x-1=maxweight; cout撤銷成功!endl; nume-; else cout不存在該路線!endl; 3.8求到某一景點的路徑void graph:shortpath1() int v,v1; string b,c; co

13、utb; coutc; for(int i=0;inumv;i+)if(verticesi.dingdian=b)v=i; for( i=0;inumv;i+)if(verticesi.dingdian=c)v1=i; for( i=0;inumv;i+) disti=edgevi;si=0;if(i!=v&distimaxweight)pathi=v;elsepathi=-1; sv=1; distv=0; for(i=0;inumv;i+) float min=maxweight;int u=v;for(int j=0;jnumv;j+)if(!sj&distjmin)u=j;min=di

14、stj;su=1;for(int w=0;wnumv;w+) if(!sw&edgeuwmaxweight&distu+edgeuwdistw)distw=distu+edgeuw;pathw=u; for( i=0;inumv;i+) if(i!=v&i=v1&disti!=maxweight) string c10; int j=0; int k=i; cout從b到verticesi.dingdian的; cout最佳路徑長度為:; coutdisti米 ; cout大約需要走disti/100分鐘 ; cout=1;n-) coutcn; if(n!=1) cout; coutendl

15、; 3.9求到所有景點的路徑void graph:shortpath2() int v; string b; coutb; for(int i=0;inumv;i+)if(verticesi.dingdian=b)v=i; for( i=0;inumv;i+) disti=edgevi;si=0;if(i!=v&distimaxweight)pathi=v;elsepathi=-1; sv=1; distv=0; for(i=0;inumv;i+) float min=maxweight;int u=v;for(int j=0;jnumv;j+)if(!sj&distjmin)u=j;min=

16、distj;su=1;for(int w=0;wnumv;w+) if(!sw&edgeuwmaxweight&distu+edgeuwdistw)distw=distu+edgeuw;pathw=u; for( i=0;inumv;i+) if(i!=v&disti!=maxweight) string c10; int j=0; int k=i; cout從b到verticesi.dingdian的; cout最佳路徑長度為:; coutdisti米 ; cout大約需要走disti/100分鐘 ; cout=1;n-) coutcn; if(n!=1) cout; coutendl; 3

17、.10求到所有景點的路徑void graph:shortpath2() int v; string b; coutb; for(int i=0;inumv;i+) if(verticesi.dingdian=b) v=i; for( i=0;inumv;i+) disti=edgevi; si=0; if(i!=v&distimaxweight) pathi=v; elsepathi=-1; sv=1; distv=0; for(i=0;inumv;i+) float min=maxweight;int u=v;for(int j=0;jnumv;j+)if(!sj&distjmin)u=j;

18、min=distj;su=1;for(int w=0;wnumv;w+)if(!sw&edgeuwmaxweight&distu+edgeuwdistw)distw=distu+edgeuw;pathw=u; for( i=0;inumv;i+) if(i!=v&disti!=maxweight) string c10; int j=0; int k=i; cout從b到verticesi.dingdian的; cout最佳路徑長度為:; coutdisti米 ; cout大約需要走disti/100分鐘 ; cout=1;n-) coutcn; if(n!=1) cout; coutendl

19、; 3.11主函數(shù)void main() graph a; for(;) char c; system(cls); cout*endl; cout* 登錄! *endl; cout*endl; cout* a、管理員 *endl; cout* b、游客 *endl; cout* c、退出 *endl; cout* 請選擇(a、b、c)*endl; cout*c; if(c=a) int d;char b;coutd;if(d=123)for(;)system(cls);cout*endl;cout* 歡迎登陸故宮管理系統(tǒng) *endl;cout*endl;cout* a、錄入景點和路徑信息 *e

20、ndl;cout* b、修改景點信息 *endl;cout* c、插入景點和路徑 *endl;cout* d、刪除景點和路徑 *endl; cout* e、退出 *endl;cout* 請選擇(a、b、c、d、e) *endl;cout*b; if(b=a) a.creat(); system(pause); if(b=b) a.xiugai(); system(pause);if(b=c)a.insert(); system(pause);if(b=d)a.delet(); system(pause); if(b=e)break;elsecout密碼錯誤!endl;system(pause)

21、; if(c=b) char b; for(;) system(cls);cout*endl; cout* 歡迎登陸故宮導(dǎo)游系統(tǒng) *endl;cout*endl;cout* a、查詢信息 *endl;cout* b、查詢到景點的最佳路徑 *endl;cout* c、查詢到所有景點的最佳路徑 *endl; cout* d、退出 *endl;cout* 請選擇(a、b、c、d) *endl;cout*b;if(b=a) a.select(); system(pause); if(b=b)a.shortpath1();system(pause);if(b=c)a.shortpath2();syste

22、m(pause);if(b=d)break; if(c=c) break; 4 調(diào)試分析4.1測試數(shù)據(jù)測試數(shù)據(jù)見圖1.4.2調(diào)試問題 在調(diào)試過程中遇到輸出路徑算法有錯誤，當(dāng)刪除一條路徑時時不能正確輸出相應(yīng)路徑，然后對輸出路徑的條件進(jìn)行改進(jìn)，增加了條件，測試成功。 4.3算法時間復(fù)雜度錄入：時間復(fù)雜度為o(n);查詢景點信息: 時間復(fù)雜度為o(n);修改景點信息: 時間復(fù)雜度為o(n);插入景點和路徑: 當(dāng)插入的景點和路徑為x，y時，若x=y時間復(fù)雜度為o(x)反之為o(y);刪除景點和路徑: 當(dāng)刪除的景點和路徑為x，y時，若x=y時間復(fù)雜度為o(x)反之為o(y);查詢到某景點最佳路徑；此算法

23、為迪杰斯特拉算法時間復(fù)雜度為o(n*n);查詢到所有景點的最短路徑: 此算法為迪杰斯特拉算法時間復(fù)雜度為o(n*n);4.4經(jīng)驗和體會在本次課程設(shè)計中主要是對圖的數(shù)據(jù)結(jié)構(gòu)操作，所有剛開始對知識不是很熟悉操作起來有一定難度，容易在程序的關(guān)鍵地方但經(jīng)過翻閱教材能較好的解決問題。5用戶使用說明本系統(tǒng)是關(guān)于故宮的管理系統(tǒng)分為兩類用戶，管理員和游客，由于管理員可以對數(shù)據(jù)進(jìn)行修改，為了保護(hù)數(shù)據(jù)，所以管理員登陸需要密碼而游客不需要密碼，管理員有添加景點和路徑、刪除景點和路徑、修改景點信息權(quán)限，游客能查詢景點信息、查找到某一景點的最佳路徑和到所有景點的最佳路徑。6測試結(jié)果6.1錄入信息 圖3 錄入信息界面 圖

24、4 錄入信息界面6.2查詢景點模塊 圖5 查詢景點信息界面6.3修改模塊 圖6 修改景點信息界面6.4插入模塊 圖7 添加景點信息界面6.5刪除模塊 圖8 刪除景點信息界面6.6查詢到某景點最佳路徑 圖9 查詢到某景點最佳路徑界面6.7查詢到所有景點的最短路徑。 圖10 查詢到所有景點最佳路徑界面結(jié) 論 本次課程設(shè)計“故宮導(dǎo)游咨詢”按照任務(wù)書相應(yīng)的要求成功的完成了任務(wù)，由于本課程設(shè)計涉及景點和路徑，采用圖的儲存結(jié)構(gòu)和算法比較方便處理數(shù)據(jù)的儲存、查詢、刪除等操作。但圖的操作比較難，比如求某景點到所有景點的最佳路徑問題，需要使用到迪杰斯特拉算法實現(xiàn)。 致 謝 在本次課程設(shè)計過程中，首先感謝輔導(dǎo)老師

25、周立章，在數(shù)據(jù)結(jié)構(gòu)課堂上為課程設(shè)計需要的前期知識打下了基礎(chǔ)，在課程設(shè)計過程中抽出休息時間來做相應(yīng)的課程設(shè)計指導(dǎo)。同時在這次課程設(shè)計中，也要感謝許多樂意同學(xué)對我不懂的地方的指導(dǎo)和耐心講解。參考文獻(xiàn) 1 嚴(yán)蔚敏，吳偉民.數(shù)據(jù)結(jié)構(gòu).清華大學(xué)出版社出版。 2 嚴(yán)蔚敏，吳偉民. 數(shù)據(jù)結(jié)構(gòu)題集(c語言版) .清華大學(xué)出版社.2003年5月。3 楊秀金，數(shù)據(jù)結(jié)構(gòu)(c+版) .高等教育出版社.2009年4月。4 朱戰(zhàn)立.數(shù)據(jù)結(jié)構(gòu)(c+語言描述)（第二版本）.高等出版社出版.2004年4月。5 胡學(xué)鋼.數(shù)據(jù)結(jié)構(gòu)(c語言版) .高等教育出版社.2004年8月。6 楊金秀.數(shù)據(jù)結(jié)構(gòu)（c語言版）.西安電子科技大學(xué)出版

26、社，2004年8月。 g an employment tribunal claimemployment tribunals sort out disagreements between employers and employees.you may need to make a claim to an employment tribunal if: you dont agree with the disciplinary action your employer has taken against you your employer dismisses you and you think th

27、at you have been dismissed unfairly.for more information about dismissal and unfair dismissal, seedismissal.you can make a claim to an employment tribunal, even if you haventappealedagainst the disciplinary action your employer has taken against you. however, if you win your case, the tribunal may r

28、educe any compensation awarded to you as a result of your failure to appeal.remember that in most cases you must make an application to an employment tribunal within three months of the date when the event you are complaining about happened. if your application is received after this time limit, the

29、 tribunal will not usually accept it.if you are worried about how the time limits apply to you, take advice from one of the organisations listed underfurther help.employment tribunals are less formal than some other courts, but it is still a legal process and you will need to give evidence under an

30、oath or affirmation.most people find making a claim to an employment tribunal challenging. if you are thinking about making a claim to an employment tribunal, you should get help straight away from one of the organisations listed underfurther help.if you are being represented by a solicitor at the t

31、ribunal, they may ask you to sign an agreement where you pay their fee out of your compensation if you win the case. this is known as adamages-based agreement. in england and wales, your solicitor cant charge you more than 35% of your compensation if you win the case.if you are thinking about signin

32、g up for a damages-based agreement, you should make sure youre clear about the terms of the agreement. it might be best to get advice from an experienced adviser, for example, at a citizens advice bureau. to find your nearest cab, including those that give advice by e-mail, click onnearest cab.for m

33、ore information about making a claim to an employment tribunal, seeemployment tribunals.the (lack of) air up there watch mcayman islands-based webb, the head of fifas anti-racism taskforce, is in london for the football associations 150th anniversary celebrations and will attend citys premier league

34、 match at chelsea on sunday.i am going to be at the match tomorrow and i have asked to meet yaya toure, he told bbc sport.for me its about how he felt and i would like to speak to him first to find out what his experience was.uefa hasopened disciplinary proceedings against cskafor the racist behavio

35、ur of their fans duringcitys 2-1 win.michel platini, president of european footballs governing body, has also ordered an immediate investigation into the referees actions.cska said they were surprised and disappointed by toures complaint. in a statement the russian side added: we found no racist ins

36、ults from fans of cska.age has reached the end of the beginning of a word. may be guilty in his seems to passing a lot of different life became the appearance of the same day; may be back in the past, to oneself the paranoid weird belief disillusionment, these days, my mind has been very messy, in m

37、y mind constantly. always feel oneself should go to do something, or write something. twenty years of life trajectory deeply shallow, suddenly feel something, do it.一字開頭的年齡已經(jīng)到了尾聲?；蛟S是愧疚于自己似乎把轉(zhuǎn)瞬即逝的很多個不同的日子過成了同一天的樣子；或許是追溯過去，對自己那些近乎偏執(zhí)的怪異信念的醒悟，這些天以來，思緒一直很凌亂，在腦海中不斷糾纏?？傆X得自己自己似乎應(yīng)該去做點什么，或者寫點什么。二十年的人生軌跡深深淺淺，突

38、然就感覺到有些事情，非做不可了。the end of our life, and can meet many things really do?而窮盡我們的一生，又能遇到多少事情是真正地非做不可？during my childhood, think lucky money and new clothes are necessary for new year, but as the advance of the age, will be more and more found that those things are optional; junior high school, thought

39、to have a crush on just means that the real growth, but over the past three years later, his writing of alumni in peace, suddenly found that isnt really grow up, it seems is not so important; then in high school, think dont want to give vent to out your inner voice can be in the high school children

40、 of the feelings in a period, but was eventually infarction when graduation party in the throat, later again stood on the pitch he has sweat profusely, looked at his thrown a basketball hoops, suddenly found himself has already cant remember his appearance.童年時，覺得壓歲錢和新衣服是過年必備，但是隨著年齡的推進(jìn)，會越來越發(fā)現(xiàn)，那些東西根本就

41、可有可無；初中時，以為要有一場暗戀才意味著真正的成長，但三年過去后，自己心平氣和的寫同學(xué)錄的時候，突然就發(fā)現(xiàn)是不是真正的成長了，好像并沒有那么重要了；然后到了高中，覺得非要吐露出自己的心聲才能為高中生涯里的懵懂情愫劃上一個句點，但畢業(yè)晚會的時候最終還是被梗塞在了咽喉，后來再次站在他曾經(jīng)揮汗如雨的球場，看著他投過籃球的球框時，突然間發(fā)現(xiàn)自己已經(jīng)想不起他的容顏。originally, this world, can produce a chemical reaction to an event, in addition to resolutely, have to do, and time.原來，

42、這個世界上，對某個事件能產(chǎn)生化學(xué)反應(yīng)的，除了非做不可的堅決，還有，時間。a persons time, your ideas are always special to clear. want, want, line is clear, as if nothing could shake his. also once seemed to be determined to do something, but more often is he backed out at last. dislike his cowardice, finally found that there are a lot of love, there are a lot of miss, like shadow really have been doomed. those who do, just green years oneself give oneself an arm injection, or is