Scribd
Upload
20 views

ADSAA Unit 4 Notes

Heheh

Uploaded by

sri datta
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
20 views

ADSAA Unit 4 Notes

Heheh

Uploaded by

sri datta
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 28
UNIT. tu * Greedy method mi Guy rAcouuicy Te deston an algorithm. we will constuch ote p b ‘h, fox an specif c solulion we have 8 types. feasible olution [ feasible Solutions] 2) optim slater [only | Set Solution] Bert objective fonction, => The solution which obtein the objecttue 13 known 0; feasible Solution. The Best Solution a feasible Solution 4 Option Solution. ; problem ae Ey always Pasty 7 3 tae Mmiaient zalto a Ay ye eee 5 Minimum | Sluten Wedlor %8 the Anal Solubon gypider fran Option | Solution (Group a wei ks [sotutions ) (Some simes Solutions ma be ser ) an % used fo Provide — Solutions for maximize and minimizadion, . : ‘ Ethe solution 43 Considered # Hi if ts Heal. Coro! abstraction, Algorithm Prgealgt 5) i Solution s= 9 for W=l do 9 alo t ( Gia? Select (xJ If (feasibte (Solution, a)) my anion (olution, a). f Yelurg Solution ; 4 Applications: > Knapsack problem “> Job ao ool th deadlines. minimum, ake Knopsacee problem? Choettons are acceptable] avs (oo [Foe onal Knapsac ics Creed method ] Dn Ab object: ‘ for each obj. three exist @ weights and pers weight will alm be for keapsnct Ka psacte ir & maximization Solution (Profit). maximum profit will be optimat Soluhion. Wr,Wa, Ws, Wo m0 ~ P,P, Subject to aii, Oo (dds ds du ds ) D023) ty be deo processed \ &t nes, motimum deadline « nouf jobs 3 + 8B jobs. : (CR ARR)- (10, Yor 30,6048) Skep-1 att the profits must be 10 descending order otcerding to ports. so . Amentese the jots in - fer gvder. (FRB, a) > (60, wo, 20 18 , to) (dikes oe oe) > (3.2,13,2) Gk is Mof mecetsory iP ‘lps on tn Aeceasig order - es ag Baye by stape. icky Should be Hesibie Solution ce profie. is : [} 26 fs Sy { 50 a J, dy Js - nol feasible Solublon oo” deadtine mut be 3 Re ab least ? Gequence i Must so it wi Exaing fo Slots. . mR wer fe jee? uence Algeh Jobseg (3.3.0) j Slo] doIee Tye =) oF tiz2 wo dp t mek aoe = Gir) eer AICI) +) + | ert sf (Also) < AG] ax AL oe) He i for Qisi< te ret da Jl+9: = 5799 I (r+ ] 1 eet, el, rf : i i § int b Spannin draghi AUST (Misia os eboney d ae OTE ty @ minimization toblem, ious) 7 Here, we need do dare fapul 09 wal ghrt -¥ph, | / twetghted graph (raph which consists of verfegs edges and nodes, 2 Q 3) | lo 30 | voeighted graph ['lp) X Not wiighted graph “il is Dn ve fices, o ape tre. 2) N-I ed es sre ree 3) 90 cudes. G5 oder to peel MST Gt has DIPS ms | 2) Keushkat's shied graphs edges. Gf “there 3 ddljacent edges then we Need to take | pe [Sa matrix, representa tion | an CF there 45 no. odjacen f : toxe w infinity) Output fo MST (min imun Cost Spannin tree ] Se Pttory veiter - Ren dorn Nt be v x . some techni g ues shourd Contain ne weight at weighted, edges then we need * ler adjacent vertices of L. alon ws jacent Vecti ces. ' ansider Minimum Cort ver lex Here, lay 35: havin minimure Cor€, By y ae p ver’ exists 17 the Spanni, ew tree. Se consicde; nexl ™'inienum for é , vertay . eee | — 3 10 F: Comme — <3 61. jo p Se Consi ce; Achacent Vettex Vious verlices. of o Along wit 3213 Consicle 1 a =238 4 2 (as, OA 6-05 9- > 9-529 O=H-2 a (8) Sort B40 +9 PP Miman est vertex nodes = G 1 aelges { Verkex ar Toot Node. 6) 2 ‘ adjacent vertex of @ and there wee Minimum cost verter are | ae crea dey exist gerok Considerable — —Add +, Spanning oa T= M0t Const derably i % Consi der al jacont nodes— 6°79 ' i 6>8>5 q fread late 3 e we age 6 Nodes (vertices) ane << | The Process hy vepenbe gy = The finat MsT nS + tost = @ 3434242434944 = IS+ \6 = 36, Gee GQ? ae Die Algerie he, — ee’ oe ” se ot ethod = ae a rms: Kagewa De Ofer ips -fov ae us ey ‘ oe Prins Re & a) jg he Al orl 3 Np atest oth A dae ie. rAd der the eninirnuey CO 7 aie peat side Qrbifar oa verte Sat. tlyh ae [ua]: rok ors Bees for tee} v4 Bones Nerti ces i it (cost Gd 2 Cost (a) near [iJ:=K else near (Gil :-1 A : near [x] - near (1] =0 a tt=2) to o=) do ba. Jet j be Verkex Such that tof visifele near (ijpo ie cost-(i, near Gy) i$ misimun, add io pia! s=f-rwe beeen the tree E[i,2] e+ near liJs the nearest ewe fend meost t= cost [), , neay(j 7) 4 mest near [i] :+6 ak Kr= ] +o a if neoiCKH+ 0 LR cost i Nearly fort [«, jy) Neary (kJ: =), a 3 rebar meosl, { ¢ ety NN, Ee S (£02) Crariurt, Yau}, Coot + { 4,13, 20,5, 80 } \ RHE de 2 ! at ) | eOwJ 4, (he] ea " E atest: = cos t (ur) - @ 5S 5a. ON Pel feost [ing] c cort(isJ Po—O fon Cort fu cost [1,2] ot Poa ies PS frets af ae F sncement =? Valuo, cos [2:4 < keost [7,2] seoJE fit. neaxr[2]-2 =o sabreed vais! 123 fom vahee ests < ot 84] evi ob dae pre toy _ gee cost(uyi] < cot 4) ' Of 5 STue ray] s U =—=0 > —<_ Vaiked, . | Bnet _teop 122 gel ; | ep ga BE coat Civeall]) < mv a | 940 ke ast (2) =4 fa ae a { t(2.J-2 | ) tpyayic morlJ- 2. Kel4o 4 ja yz) | neol3 +0 —Palse, Oto neor(x}t 0 Net conditiah 5 cost [ 3, eo: [3]) > cost [s,1] Z0>20 “Tue neot[3) -=1> updalled near Value oe Bee go oT. 2 ond the tracing Continues foalf refurny moose. d Setghted re? Krusteal's onthy Mst 7s used | bStep-i: Consider all the cages Sehese the Meost edge repecds. 7” “— ord most = 34446474 +6 alt _ Cost * S# I UES = 37. a |e = ee a ae. 7 ator Neils fe krysal'S Th method Algostho tourney (Er tostint Constiut! heap aac 40 edge bi vm a oe ssl to 7 do | parent (y.e-l Li=0 —a he no ed ges Dog mee? =0 ull (rex a1 £2 hee : i Pp nol emp { nae v Conder minimum cost edy & (uv) ond re heapily using adjutl je a (wes to giv paven! element- ys find diferent sePs. Jin had Bi G1) the) po avoid cy kg el; E(t): 20 q tod e=v — ntost == Meost+ tot [u,v] . Be (j,k) i Lf prot 10 oe trout e Shes tet ests a Sil + Sous inet =r To Salve antainizcation and ophimal > Me acted 40 Consicle the mall Value. ag nded, the shorlest_ path |, problem : a Single Source uv atts have used a algosithen Di jKshy i. i , and “Gell man alga (ot denow) sik wifel gerbe tigat we olp- shortest path We a) source, 2 Olyissty ts alg oF Step-'* < choos ® one source vertex Coashucl toble AlerHees 10 the ea. citi ae pee for Dijicatea's algorithm: Const dec numeral order ont hecnuse my Considering 49 alphabelfead order If cwill be Ne dif tua é Qa 9 XE fo oH sg dable MA 7 rr _Dijistay ally 0, vig ted >| Vertice 5 \ a 3 2 [oa ® (Consider cue Verity © R Shortest path (low wt) +o O t © =0 and ty remaining we don't Know 30 on & Soup visit ©) source verter) pp teh odiacent - Verftces There meet ef sr at " Crges - \ me 9 an i , ole AR tue oct travel, 29, a rave | “Con dition ¢ diy tostluy) < fv) ( j ost ( ei ) (ost (14, 5 ) : orbs <4] Eirok q 049 <\\aaeeee 7". 9° ae a Meeplace me ath 4 al 1 vile d t J § us 4 a a 0 oo Wow (au) i uv ee AB) acstGuj edly | dl) ttost(2,6) ede] O+ | e2w-— Tre, OWE 215 ue ww ouisited \ ‘9 3 CokE u > eo ° wo Oa by 0% om EF CG ( L { visited! re minimis eter wisiked ! % 3 uy adiecents wo a YU g —chan Us) —Chang 1G Ys 2 Not thang : 49S Charge } 4949 pricy | em Fiat ©) du} test (ye) eu(r) 4 ; pol minimum Q, gilt d : i, wo 0 ww o ‘ q oO o | 6 AY 1 ' ; é 3° ae 204, 3 i _ Pe 2 Bo 1 y Be al dQidtost (uve dw] {(ptes Gw <4() B+ 444 red Fale. grok visit © id (or wo ° coe Be a omer 4 & 244 A 0 oe Ose we § 4 3 } 6 wir 9 0 3 ME only thang —theete Conf Krink iit | e yiited. \ L =) MA BS 3 a» cs oo ge rl el oe 204 ™ 0 3: Lame 1M 3 4 me 3 Lyle 24,35 fle ° A ae eevee 4 3) Tf ao, i ie none y mo ee! dhe Shortest sabre pbiow ¥ Example co ee Dijicteas alporthan A Wa Ve. v % 4 6 @ ag Source 243 vistt_g ad) acent vertexy2 736 1136/1 of 3. 97! Br ah aoe 356 BOT can tet, y im WHY 213 oe oon (3,9) (3,6) Condition i, Ud yey Wise Wyse dlilecost(uy)e AW) ae a) teost (9, ed Cy OF 13 <08— Thug a (63) (6,5) V=2,Ve3 63 eg 1 Sto to n do. choose the vevter (Wf such that Sth = fulte and with mintnum ea S[Uf- true tox each vertex w adjacent fo iF (di > dle) + costLvisq) then dv] <= dtu! teilu]

You might also like