Copyright© 2004 Sergiu Dumitriu, Marta Gî rdea, Că tă lin Hriţ cu Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled "GNU Free Documentation License" All brand names, product names, or trademarks belong to their respective holders.
標(biāo)簽：
Permission
Copyright
259
Dumitriu
上傳時(shí)間：
2015-04-02
上傳用戶：jackgao
求解網(wǎng)絡(luò)中的最短路徑。假設(shè)某個(gè)計(jì)算機(jī)網(wǎng)絡(luò)有n個(gè)站點(diǎn)，依次編號(hào)為1,2,…,n；有的站點(diǎn)之間有直接的線路連接（即這兩個(gè)站點(diǎn)之間沒(méi)有其它站點(diǎn)），有的站點(diǎn)之間沒(méi)有直接的線路連接。如果用三元組（i,j,f）來(lái)表示該網(wǎng)絡(luò)中的站點(diǎn)I和站點(diǎn)j之間有直接的線路連接且它們之間的距離為f 當(dāng)已知該網(wǎng)絡(luò)各站點(diǎn)之間的直接連接情況由m個(gè)三元組（i1,j1,f1）,(i2,j2,f2),…,(im,jm,fm)確定時(shí)，要求計(jì)算出對(duì)于網(wǎng)絡(luò)中任意一個(gè)站點(diǎn)g(1≤g≤n)到其余各站點(diǎn)的最短距離。
標(biāo)簽：
網(wǎng)絡(luò)
最短路徑
站點(diǎn)
計(jì)算機(jī)網(wǎng)絡(luò)
上傳時(shí)間：
2013-12-27
上傳用戶：asdkin
