矩阵乘法求最短路

《矩阵乘法求最短路》由会员上传分享，免费在线阅读，更多相关内容在工程资料-天天文库。

1、算法导论矩阵乘法求最短路，如有错误望大家指出[cpp]viewplaincopyprint?11.[cpp]viewplaincopyprint?1.2.3.4.5.6.7.8.9.10.11.12.13.14.15.16.17.18.19.20.21.22.23.24.25.26.27.28.29.30.31.32.33.34.#inelude#inelude#inelude#ineludeusingnamespacestd;#defineMAXN100#defineINF1000000classM

2、at_Graph{public:Mat_Graph(intnum):n(num){memset(Map，0，sizeof(Map));inti,j;for(i=l;i<=n;i++){for(j=l;j<=n;j++){if(i!勺)=INF;}Mat_Graph(Mat_Graph*W)intij;n二w・>n;for(i=l;i<=n;i++)for(j=l;j<=n;j++)voidPrintlEdge()宀int-hor(iulji〈Hnji++)宀print-h(-£d,p.)j■For(j"l」jcunjj++)宀i-h(Map〔i二j〕T0cocoMap〔

3、i=j〕rINF)prints・「〉zd=j)j}printf(Jrr)」}prinr+f(=・・)jvoidPrintlMatrix()宀int-hor(iulji〈Hnji++)宀■Fozjul」j++)55555554444444444333336543210987654321098765Mapri二j〕"千〉Map「i二voidAddsingleEdge(intsr+artjinr+end》inr+weighr+Hl)宀Map〔sr+art〕〔end〕nweight」voidAddDoubleEdge(intawinr+b』inrtweighr+Hl)宀A

4、ddsingleEdge(ajyweighr+)-AddsingleEdge(b》a・weight)-voidDeler+esingleEdge(intsr+artjintend)宀Map〔sr+art二end」HINFjvoidDeleteDoubleEdge(inta》inr+b)宀Deler+esingleEdge(aJb)-DelertesingleEdge(ya)-printf("%9dn,Map[i][j]);79.80.}81.printf(n");82.}83.printf("");84.}85.86.87.intMap[MAXN+4][MAX

5、N+4]；88.intn;//点的数戢89.intm;//边的数量90.};91.92.93.94.I95.96.97.98.99.100.101.102.103.104.105.106.107.108.109.110.111.112.//附加・》矩阵的乘法Mat_Graph*Matrix_Multiply(Mat_Graph*A,Mat_Graph*B){intn=A・>n;intijk;Mat_Graph*C=newMat_Graph(n);for(i=l;i<=n;i++)for(j=l;j<=n;j++)C->Map[i][j]=0；for(k=l;k<=n;k+

6、+){C->Map[i][j]=C->Map[i][j]+A->Map[i][k]*B->Map[k][j];}}returnC;113.114.//工具函数115・intmin(inta,intb)116.{117.returnb>a?a:b;118.}119.119.Mat_Graph*Extend_Shortest_Paths(Mat_Graph*L,Mat_Graph*W)120.{121.intijk;144・宀145・intnHa146・int147・148・MatIGraph*LHnewMatlGraph(w)j149・-hor(mu2sm++)15P宀15

7、1・LuExtendlshortes-tlpaths(LJW)j152・L-〉prinr+IMar+rix()j15W》154・155・returnL」156二157・159°159・MatIGraph关FasterlAlllpairslshortestlpaths(MatlGraph*w)169宀16Lint162・intnHw-〉a16W164・MatIGraph*LHnewMatlGraph(w)j165・mH1」123124125126127128129130131132133134135intn=MatlGraph*