求解網(wǎng)絡(luò)中的最短路徑。假設(shè)某個(gè)計(jì)算機(jī)網(wǎng)絡(luò)有n個(gè)站點(diǎn),依次編號為1,2,…,n;有的站點(diǎn)之間有直接的線路連接(即這兩個(gè)站點(diǎn)之間沒有其它站點(diǎn)),有的站點(diǎn)之間沒有直接的線路連接。如果用三元組(i,j,f)來表示該網(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ì)算出對于網(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
算法ebook(10部算法經(jīng)典著作的合集) 算法ebook> 10部算法經(jīng)典著作的合集 chm格式 (1)Fundamentals of Data Structures by Ellis Horowitz and Sartaj Sahni (2)Data Structures, Algorithms and Program Style Using C by James F. Korsh and Leonard J. Garrett (3)Data Structures and Algorithm Analysis in C by Mark Allen Weiss (4)Data Structures: From Arrays to Priority Queues by Wayne Amsbury (5)Information Retrieval: Data Structures & Algorithms edited by William B. Frakes and Ricardo Baeza-Yates (6)Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest (7)Practical Data Structures in C++ by Bryan Flamig (8)Reliable Data Structures in C by Thomas Plum (9)Data Structures and Algorithms Alfred V. Aho, Bell Laboratories, Murray Hill, New Jersey John E. Hopcroft, Cornell University, Ithaca, New York Jeffrey D. Ullman, Stanford University, Stanford, California (10)DDJ Algorithms and Data Structures Articles
標(biāo)簽:
ebook
Fundamentals
Structures
Ellis
上傳時(shí)間:
2015-04-04
上傳用戶:tfyt