You are on page 1of 7
Pa, POORNIMA a INSTITUTE OF ENGINEERING & TECHNOLOGY DETAILED LECTURE NOTES PAGE NO. Pe singles Soe Shortest Path problem ~ RSLS sec a | > qhe probe of tinclin shortest | Nextex Ve toolt other Vextices inthe graph. ® 20 10 aig = t | te eos Es teat tS ES ae (croogte Mas) | @ Routing system: | ij ' \goxthm ie . a : Hon to singl< - Souxce a eeaees tp graph thea: Shorrest path propler? in Pp ‘ n bo " ore HOON oth ahes ene 4 t wakgnts nonnegative o— hen ths Od > Our ae Quite Votes VEV all other Vertocs: path 4rom a Source th. AixvecteA and ced . ‘ 1p H=2EENGaNA = inputs? > kleighted ee aay uxce Vor : a - ane nonnegative shortest path from a POORNIMA INSTITUTE OF ENGINEERING & TE HNOLOGY | DETAILED LECTURE NOTES “Va The algosithen Com distance yo U | the weight ay ® 2. the algoxtthm Keep frock O+ chor which ane distance ines ron a lable Ss pr tose ules tor. each Noxctex Ul the tne stork Voctes YF that ts pain p)w Vand: tne set of Vextices een Gmpured. Nth tt: Fos | 3 No Nexkex any Vexrex Ut | Ane distance b . | pedo ee ath trom ap tour 4, Ax the end jor each Vertex U having \able DCU) | 5 equal to tne actuod | the stocking exter \rand Vextex U- | wot wr corr | <9 SKS ie Fe cu) + CCUed< A) Gost ay A)= olcuy +e (uv) Sol'e- = where 3- C A Coat UD SOWee \y Destination d= clistance_ @ x ‘cee > + satay ose take P| so Whe Gos to & \tow ts =09)% yo @ Now we take a both ex & Vecorsiescit.S 00 “ee pain have @\- Oe) Cindivect) ®i73 (direck) @piectiensiten te 22 2 So am ee NEERING & TECHNOL GY G, PoorNMA “Relaxation Fy dear cCuy > orye<% Coon a Acw) diton teue ) then i | dAcy= dcuj+e Cu) =p 0 = U0 Now Graph iA one 20 na vino 20 (2) | 32 =O Cost yo ® pelet with the volue ac Now pie \5 Com aiepa + Le aS a) 20) eS on Se acre ecu) Disadvantages 5— @ Tt do blind Seach So castes lot of time chile prong @ Tt cannot handle Negative ealges, © Thlaunable to manage sharp calgeo Ao a Scene Acyclic qraphe axe prccluccal anal the ddeaf shortest path is frequently impossible +o ginal. -pe Applications o } Di katea’s Algo 2— 0 To determine the quickest Route @® \n applications bow socla! ne hoorking Within a phone Network @ To locate the phoes an the Wap, @

You might also like