南郵數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)三.doc

實(shí) 驗(yàn) 報(bào) 告（2015 / 2016 學(xué)年 第 一 學(xué)期）課程名稱(chēng)數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)名稱(chēng)圖的基本運(yùn)算及飛機(jī)換乘次數(shù)最少問(wèn)題實(shí)驗(yàn)時(shí)間2015年12月4日指導(dǎo)單位計(jì)算機(jī)科學(xué)與技術(shù)系指導(dǎo)教師黃海平學(xué)生姓名陳明陽(yáng)班級(jí)學(xué)號(hào)Q14010119學(xué)院(系)貝爾英才專(zhuān) 業(yè)信息科技強(qiáng)化班實(shí) 驗(yàn) 報(bào) 告實(shí)驗(yàn)名稱(chēng)圖的基本運(yùn)算及飛機(jī)換乘次數(shù)最少問(wèn)題指導(dǎo)教師黃海平實(shí)驗(yàn)類(lèi)型驗(yàn)證實(shí)驗(yàn)學(xué)時(shí)4實(shí)驗(yàn)時(shí)間12.4一、 實(shí)驗(yàn)?zāi)康暮鸵箫w機(jī)最少換乘次數(shù)問(wèn)題。（1）設(shè)有n個(gè)城市，編號(hào)為0n-1，m條航線的起點(diǎn)和終點(diǎn)由用戶(hù)輸入提供。尋找一條換乘次數(shù)最少的線路方案。（2）參考：可以使用有向圖表示城市間的航線；只要兩城市間有航班，則圖中這兩點(diǎn)間存在一條權(quán)值為1的邊；可以使用Dijkstra算法實(shí)現(xiàn)。二、實(shí)驗(yàn)環(huán)境(實(shí)驗(yàn)設(shè)備)VSUAL STUDIO2015三、實(shí)驗(yàn)原理及內(nèi)容對(duì)象視圖：源代碼：Graph.h#include #includeusing namespace std;const int INF = 2147483647;enum ResultCode Underflow, Duplicate, Failure, Success, NotPresent, OutOfBounds ;template class Graph /抽象類(lèi) public:virtual ResultCode Insert(int u, int v, T w) = 0;virtual ResultCode Remove(int u, int v) = 0;virtual bool Exist(int u, int v)const = 0;protected:int n, e;template class MGraph :public Graph /鄰接矩陣類(lèi) public: MGraph(int mSize, const T noedg); MGraph(); ResultCode Insert(int u, int v, T w); ResultCode Remove(int u, int v); bool Exist(int u, int v)const; int Choose(int *d, bool *s); void Dijkstra(int v, T *d, int *path);protected: T *a; T noEdge;template MGraph:MGraph(int mSize, const T noedg) n = mSize; e = 0; noEdge = noedg; a = new T*n; for (int i = 0; in; i+) ai = new Tn; for (int j = 0; jn; j+) aij = noEdge; aii = 0; template MGraph:MGraph() for (int i = 0; in; i+) deleteai; deletea;template ResultCode MGraph:Insert(int u, int v, T w) if (u0 | vn - 1 | vn - 1 | u = v) return Failure; if (auv != noEdge) return Duplicate; auv = w; avu = w; e+; return Success;template ResultCode MGraph:Remove(int u, int v) if (u0 | vn - 1 | vn - 1 | u = v) return Failure; if (auv = noEdge) return NotPresent; auv = noEdge;avu = noEdge; e-; return Success;templatebool MGraph:Exist(int u, int v)const if (u0 | vn - 1 | vn - 1 | u = v | auv = noEdge) return false; return true;template int MGraph:Choose(int *d, bool *s) /求最小di int i, minpos; T min; min = INF; minpos = -1; for (i = 0; in; i+) if (di = min&!si) min = di; minpos = i; return minpos;template void MGraph:Dijkstra(int v, T *d, int *path) /迪杰斯特拉算法 int i, k, w; if (vn - 1) throw OutOfBounds; bool *s = new booln; for (i = 0; in; i+) si = false; di = avi; if (i != v&diINF) pathi = v; else pathi = -1; sv = true; dv = 0; for (i = 1; in; i+) k = Choose(d, s); sk = true; for (w = 0; wn; w+) if (!sw & (dk + akw)dw) dw = dk + akw; pathw = k; 源.cpp#include #include#includeGraph.husing namespace std;int main() int n, m; cout n; cout m; MGraphA(n, INF); int c, f; cout 請(qǐng)輸入每條航線的起點(diǎn)和終點(diǎn): endl; for (int i = 0; im; i+) cout 航線 i + 1 c f; A.Insert(c, f, 1); char s; do int v, w; cout v w; while (v0 | wn - 1 | vn - 1) cout v w; int *b = new intn; int *d = new intn; int *path = new intn; A.Dijkstra(v, d, path); int e = n - 1;int j, i,k = 0; for (j = 0; jn; j+) bj = -2; if (w != v) j = w; while (pathj != -1) be = pathj; e-; j = pathj; if (e = n - 1 | dj = INF) cout 這兩點(diǎn)間無(wú)線路! endl; else cout 從 v 城市到 w 城市的換乘次數(shù)最小的線路方案為:; for (k = 0; kn; k+) if (bk != -2) cout bk ,; cout w endl; if (w = v) cout 看來(lái)你錢(qián)比較多 endl; deleteb; deleted; deletepath; cout s; while (s != Y&s != y&s != n&s != N) cout s; while (s = Y | s = y); return 0;運(yùn)行截圖：實(shí) 驗(yàn) 報(bào) 告四、實(shí)驗(yàn)小結(jié)（包括問(wèn)題和解決方法、心得體會(huì)、意見(jiàn)與建議等）使用鄰接表表示的圖和迪杰斯特拉算法實(shí)現(xiàn)飛機(jī)最小換乘路徑本來(lái)不算一件難事，這個(gè)程序?qū)崿F(xiàn)起來(lái)的重點(diǎn)在于容錯(cuò)性的問(wèn)題。在考慮到輸入時(shí)可能有的各種各樣問(wèn)題時(shí)主程序中的輸入判斷就要多改進(jìn)。還有就是我怎么都覺(jué)得飛機(jī)路線圖怎么