【正文】 etween the two cities.Through the analysis of several mon shortest path algorithm research and realized that the classical Dijkstra algorithm, Floyd algorithm. We discussed various algorithms ideology, theory, implementation, data structures, as well as algorithms described and analyzed to pare their advantages and shortings, and the practicality of the plexity of the specific time and space. For present characteristics of modern transportation work, classical shortest path algorithm analysis and research for the road to explore several issues in transportation work optimization process routes that require special handling, and in theory give the corresponding reasonable solution. Key words：traffic advisory shortest path Dijkstra algorithm Floyd algorithm1序 言最短路徑問(wèn)題一直在計(jì)算機(jī)科學(xué)、交通工程學(xué)、地理信息系統(tǒng)、運(yùn)籌學(xué)等學(xué)科中是一個(gè)研究的熱點(diǎn)，它不僅是資源分配問(wèn)題解決的基礎(chǔ)，更是線(xiàn)路選擇問(wèn)題解決的基礎(chǔ)，特別是在地圖、車(chē)輛調(diào)度以及路由選擇方面有著廣泛的應(yīng)用。這樣的一個(gè)交通系統(tǒng)可以回答人們提出的有關(guān)交通的所有問(wèn)題，比如任意一個(gè)城市到其他城市的最短路徑，或者任意兩個(gè)城市之間的最短路徑問(wèn)題。、圖表要求：1）文字通順，語(yǔ)言流暢，書(shū)寫(xiě)字跡工整，打印字體及大小符合要求，無(wú)錯(cuò)別字，不準(zhǔn)請(qǐng)他人代寫(xiě)2）工程設(shè)計(jì)類(lèi)題目的圖紙，要求部分用尺規(guī)繪制，部分用計(jì)算機(jī)繪制，所有圖紙應(yīng)符合國(guó)家技術(shù)標(biāo)準(zhǔn)規(guī)范。本人授權(quán)　　 　 　大學(xué)可以將本學(xué)位論文的全部或部分內(nèi)容編入有關(guān)數(shù)據(jù)庫(kù)進(jìn)行檢索，可以采用影印、縮印或掃描等復(fù)制手段保存和匯編本學(xué)位論文。除了文中特別加以標(biāo)注引用的內(nèi)容外，本論文不包含任何其他個(gè)人或集體已經(jīng)發(fā)表或撰寫(xiě)的成果作品。盡我所知，除文中特別加以標(biāo)注和致謝的地方外，不包含其他人或組織已經(jīng)發(fā)表或公布過(guò)的研究成果，也不包含我為獲得 及其它教育機(jī)構(gòu)的學(xué)位或?qū)W歷而使用過(guò)的材料。對(duì)本研究提供過(guò)幫助和做出過(guò)貢獻(xiàn)的個(gè)人或集體，均已在文中作了明確的說(shuō)明并表示了謝意。對(duì)本文的研究做出重要貢獻(xiàn)的個(gè)人和集體，均已在文中以明確方式標(biāo)明。涉密論文按學(xué)校規(guī)定處理。圖表整潔，布局合理，文字注釋必須使用工程字書(shū)寫(xiě)，不準(zhǔn)用徒手畫(huà)3）畢業(yè)論文須用 A4 單面打印，論文 50 頁(yè)以上的雙面打印4）圖表應(yīng)繪制于無(wú)格子的頁(yè)面上5）軟件工程類(lèi)課題應(yīng)有程序清單，并提供電子文檔1）設(shè)計(jì)（論文）2）附件：按照任務(wù)書(shū)、開(kāi)題報(bào)告、外文譯文、譯文原文（復(fù)印件）次序裝訂IV目錄序 言 ...........................................................................................................1一、緒 論 ....................................................................................................2（一）課題的背景和意義 ..................................................................................................2（二）研究現(xiàn)狀 ..................................................................................................................2 ....................................................................................................................2 ............................................................................................................................3 ................................................................................................................................3（三）研究?jī)?nèi)容 ..................................................................................................................4（四）論文結(jié)構(gòu) ..................................................................................................................4二、最短路徑算法相關(guān)原理 ........................................................................4（一）DIJKSTRA 算法 .............................................................................................................4 ....................................................................................................................................5 ...........................................................................................................................................5 ...........................................................................................................................................5（二）FLOYD 算法 ................................................................................................................7： ................................................................................................................................8： ........................................................................................................................................8 算法過(guò)程矩陣的計(jì)算十字交叉法 .....................................................................................8三、開(kāi)發(fā)工具與環(huán)境 ..................................................................................10（一）JAVA 技術(shù) ................................................................................................................101. Java 簡(jiǎn)介 .........................................................................................................................................10 的處理流程 ..............................................................................................................................11四、交通咨詢(xún)系統(tǒng)的實(shí)現(xiàn) ..........................................................................11（一）系統(tǒng)分析 ................................................................................................................11： ..........................................................................................................................11 ..............................................................................................................................12 ..................................................................................................................................12（二）系統(tǒng)功能結(jié)構(gòu) ........................................................................................................121. 系統(tǒng)構(gòu)架設(shè)計(jì) ................................................................................................................................12 ..................................................................................................................................143. 測(cè)試數(shù)據(jù)及分析 ............................................