Scribd
Upload
32 views40 pages

Aphs

Graphs

Uploaded by

gvkrkarthikraj22
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
32 views40 pages

Aphs

Graphs

Uploaded by

gvkrkarthikraj22
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 40
eeeenmatnennssnstitseseg semen EOI DErIN' TIONS “ GRAPH iH ° ——_ " Get" 2) consisb of a set o yertice, V anda Fach edge 4 o pe Gr Ay one a (yw), where VW E Vv 4 e. “act 0h Age ARCS!~ a Fdges ave sometimes vweV- gc ball anh WwW us heaot of arc. ayer ko as arcs. Fach eye “ a pacr (vw) Where Te sh an loydlertict pty: 4 yertlees Cv,w) where Vv pivectect_graph| Digraphs'- ¥ 3p he pair ber the edge orolereal , then the voph ts olvreckel anol <0 te wb otherwise Catledt as cligraph, g +t the olirecteol graph Gr consists of a seb 4 verties V ane & Be of ares E. The Vertices are also cablect as nodes /poin’ I, the pair fpr tre ecye & not ovdlereat anct hence it Bo called as encivectsl graph: In his graph , wit edge Cv,w) thar wtb adjawnt mB ¥ and vb aoljacent ty w or Cw, Vv) whith aoys + Edge show thindl component Calle wetght or cost Poth :+ — xA s, . path in cLigraph tS the sequence of vertites VjVa- + Ve Such that Vy, 3Y, ln, V2 OV 1 1 Yo ‘a Va-t Nn ATe arcs. TAls pot ws frm Verkx v, & vy, 5 > a of Path’: 3 0 ONC passes thamigh Vai%y- Voi, pte the umber of edger on the peth whith & equot ke Ns 4 ‘the path contains no. edges ©7, @, path from vertex 5 itself then the path tength 45 o, Loop*- TA the graph tontains an edje cy) WBelp, then tne. path yyy, sometimes meperred ley. simple path i- + Dees a path «uch thot alt vertices . ame oluistinck , ~m Vertex & exccept, FE Oe Birae and fast Coulel he the same’. simples YRS net st ‘ +2 ample cle Ba aimple ‘path of angen atieasE one hab 8 begins andl “ends ab »the \tame yerbx . RUA!” Aue cute Pipes s * Ip the direct guaph, if he dos ne oyslee ‘ Bee . hud dewectecl acyetie repr a, cateol os Dab, a AN undirected greph 3 connected % there & a! path. other verlex . Such Grapes 4 then re yr even verlix +o every —are crated as Aorongly conne cleol. prope Weakly vonnechek graph:- wn undl’nectack graph LB corneclad , but every vertex wb nok wnrectol Ie every other Verlax ancl suck grep are cotled a wate conne clk rr" comple graph'- 40 comple graph & 2 graph in which there | ae 3] ery 4 a1_}+46T Fes feats s pL ed i al ATE LG the ordering of verbiew fin a Olerecked acy etic F72ph (DAG), so that 2 path from V; te y » then Vt appears after vz fn, Ovdeang. wy 47] the graph conteins 4 cle, Shen fe “ nob possible ts) perform bopetogecat sort. ‘ 1 Algorithm +5 find Topotogtcat orderi ; . ej) © Finck any verter uth no intoming eoyes . & j @ Find cut the fnolegree por att the clas: {4 ® Remowe the particulan vertex With mefnirnton ae tong with 1B eles from graph Yeer printing . @© Continue the same for att Nooles of graph - ‘ © Indegree of vertex v the number of edges Cu,y) 1 en Rowarols the vertices . a ee dail ¢ ‘ y Si ® 4 Ae wl Spy ¢ + ( mente aut 2s euclo jor Topato, 5 . Void. tepaort C int aah e ¢ | £ i ae ae | : Queue, es 3 feat ea ine tatrder So3L PL Us ef Vertex v, wy)! t ba makeerpay CG) jer each vertex V 1} Cindegree (v)'= 4+ nquene Cv) 7 nee x whele (1 Ls Emp by (49) f P . V sclequene C4) ; ae ead ++ Counter 5 prgn vertex adjatent &v- ip! iG sutoelijree cw) =20) wat = a enqueue (0) 5" 2 % Lemunber | » 0) Err (" yele fort fo te graph’ 4 - “My . Va, & Topological Sort V: ordering « ‘3 L g pe yah 3 Yas, prholt V5 34% Vs Ve se peoeM ys Enquene Dequeue neh: 4's eee Cotaale the evchagrest vr ate vertices . \ woe eee =. Reh Tamar V4 Yai Ny; ‘ . am Esai yom & Cotekats the inoteg ree “ vgo 2 Yo 2 Va > 3 eee , Sp 3'- . ‘ Tndegrers for Vz >) Ore) Fog wy Vs 30 0 WearS a2 : \ } . \, oH * Now Temove Vis because it hag netnéonwm Value Felegrees for Ys | Mave ! 1 M33 Maou vv T4 Now remore Vi a4 te has nebnirsen pop Vatu, Trdegrees por ‘Vy 3 0) 4 % 22 \v Yo | "New Viz bes 0, take Gers is step 6 Wi | sapepnt) i Tretegrece for Vy >) | 1 O—_® Ct Me! oupae, F 4 Now V4 has mintmun vatue, So renore it. skp 1 GB Petey for WS eimai fromm a hip. ithe depetegiiae oratering af Bu orrmapomaing gray 4 Mi Ma Ye, My Ma. My, My Minimo ¥ Minimum % > Perning tne af an uncé 4 B aime formed 1 Teckek arph G she, ses from raph ectges Hae tis ee vie. cafe HG & Lowest torat east the mintmum seta poring kere exis if and only if & a 9 The number of elges in the mst & |vl =I Minimum _ Connecti ath the Vertis at Lowest total cost i y Spanning - Te Wovers every vertex in the. arp : Free! re ba te, became ‘k & ayelic. 4 Tm are 2 abgenithens preset and they are: © Prica's alg oatti> @ kruskals ottgoritten 5 Kaw iat vata oa yoda Bri “egy compali MST a te gw khe tee In Successin Perea “Bip 4 One was ae and in each sbage, one noe & pickeot as the Took, ait we’ aol van ealye rari “axssoecatere Nrertex etre’ bree agen fe nent wot Rb mand » eur vertex. has bb be adelea te the @ pt each sbage, OP as MST by choosing tne cage C cok BO i re b the amallesb among ¥ eclges rere u & ia che a u,v) such that th ' v nook with no edges, one vertex te He bree and’ ves nok @ Pate Vd in the bree A @ Fach hp ades ene edge anc a So Staating vertex (%,) Kno. 2 ever Won Song 4 Mialttet ov ret | . ay distance ‘bebbecs) he Vertes! . "Ry Record Replay fa valable or broughs Watulch the vertices are visited Ws \ m~ A s steps Ganthee)) | Shep ms, CAPO QO @ | ‘ ® ® @ ® @® (4% Yn? @ ®@ * Sip) 3 *~ b . @ ® @ 22 OV My Mas MD sp 6 pe Mig ENE MOD sey Cy th Sh Cae BOY uw tnt athe totar cose of METAR Ott, th ri+b =16 J the number of vertices =7 number of edges fa msT y= Ivins) elal- = spe : y 90 MST fo to Cover alt vertu in graph bout wt dowuk cost - loth Patnu (Tabre 1) t ‘ Vertex viw Cure & ; R= Crate Queue (umd, Mane Fpl, Ca)’ Enquene (5,8), while ( | Tafrupty (ed) 4 fi Ve Dequewe C®) 5 TLVI. Keown = 15 ‘ enn Jor cad wr ausjacent to ¥ : q CT fw). dist = = 90) “ ) fs TEwJ, Dist = min (w,Cyyo)s,, TIWJ. pathic vs Fogurue Cw, 8), + spose ucwe ( @) , y ' / Kuakal's Algortinen.- § YA scund greedy strategy yy prs seating [om wg Tome example gy ors ; wee au vertices stosting prem te OLE guy, = salt te be Cooneclact - ay oe pope nee connerlad , Bar preussing alt pades veqpinet revevsat- Calla” & prs orh each gree } oa tne- a Ths entre Client fen “hh talld os A ow vo ep Fost gree So piometo of apelevat SEUNG THe UE Bierce tee hase TI eret farm nS —_—-= as arte Sears ane aren ae 2% bop axe anbialaton 2 het 2,39 pons .Seranse Thr vewevel way eo eigen Gone i r 5 } a oes) pevides a Lintas-tinw olgenitre byt at avtiostten pent no contac tat gre o extex, perfer™ * Des and narba of nodes whey are viata ruwées Nomte) 6 rr abwnte y cote. Peet © Comput Be docest—nurebeved Vertex machebie ancl Codi coy mere pow Cv) thet & wachable prom ¥ "y taxing e dre ee ona possibly ome back colge Loot) BU nunimure ef @ ner) © towat ure) army att bate ee enw) ¢ + @ owes t low (w), wrerz ak bre etze (+ ay cAtid ae wan ® Rect 6 an articulation if Sy hae mere HE A pry vertex ether then wel & an artiutanton print it, Vi bas some cniit w mth that hee (w) > Nerl cathe Hime taken b compute & ocul ett) 254 Nure( wy > euro ty) , been the ee BM back ee CF) - mir ( url F) yur (02) 19 sein (bya) = y (2) = mtn (nure(F) 5 low (FI) Me is,4) -5 deo (D) = min (Num(D) 5 num (A) > low LEI) = mln (hs 1,42) pow Ce) = rain (Num te) » 16aibf 4 low (D)) =nin ( 3a,1) =) neg r ‘ Yow) men (rain 93ST o fdn (uentB) pbw0ed) = ren C2) > 1 sow A>, bow (A). = min ( nam ta) 1 low (BY) = mint ht, ‘ a esses Rewtine :- . : j Void num (Ver bix vw Void dows (vertex, vy) 4 £ My Vertex wy vertex, " Pv] stounter +4; dowfvg= rb], * A Rate 4 ¥y visited [vy] =! 3 i cach) W actiacent t by “i ‘Unews Sncva) /> forcast tage * | for each w adjacent b&b Vv ' Ulviated Co) er . t - dows 0; - eee UP CeO Eby > eB) oe yy num (Ww) 5 " eh - ‘ 46 iy y ay oaks aneiealation print “Loo bag rein tows), low GoD 5 Po domes Abate 39 / else if (pédintr BD) =) “palnas cape) Jow LiJz rain (owl 9 L0T); o * Rute 2 *] 3 Ne, fo) : @ Euler Civeutb | oe * Consider, these 3 tye d . ys othe, poputor puzzle present ie Teconsbutk ising per, arawing. each tine exactly once ATH pen Shovtd nob be Ligeect from paper while arowing & performed, Also make the pen finish OF the “tame poh at which ce startd |. Potnb t be tomidered '- 4 the staking pone Othe pint diag vor” Can be drawer or Tight ~hand Corner and 1&8, not possible bs tower alee dbo iffnte ake Bre Abaating point « acwond diagram . can be easily Araon sotte the finishing th oi * the sare as the- starting point © The think cuiagram Cannot be drawn at all within the Parimeters’ Of: the puzele - : : yroblera by 4 Now ConverE the probe & rcpt theory Pe assigning a verbx bt each intersection - Re ew 2 penformest we rout pok a 4 Ptter this conversion wii every extge “exactly once - path in the groph Ghat 4 This pwblern was solvet mpernd bp as Creat Problem fuler ano te & in 1136 by Rider, “puler Tour ov Fuler poth or | | \ \ AerWaby ens ' ot Qe jivst observation that can be maste in fuler rust a Ahat, which must enot 5, Ph Atortrng vertex 2 possible 2 the graph 2 connecteot anct each vertex hay even, degre or even number of ectges @ hey Vom v hae cack ctegree, chen we ul WACK the point where only ‘one dot ge bs © Y exactly wo verter have coe Fuler Tour, with meat visite every B unniieg olegree , ae edge bub need nit Atart® at one: oak degre Vertites and finush at other. Team bo it aborting vertéx Cie the 6 FT] more than two vertices have eotet oegree ) i is 4 our A not posstble - £7 main problem i thot we Teuiphe visio epee, Ff he graph and mekurn “to the aterting point Prematunly. + on Are eclpes coming’ out of the start Vertex hare, beer set up, then part Y% the Tp 4 untraversect x The caslat way to fie thes 4 te find the pirat vertex | on! ths path that bas an” untrorersect, echge, and. ne Peforra anctter DFS. This oo continued unt) ate ecbpes have bun troversed. > Suppose we Akart at 5 ant braverse the Ciruut 54,105 Then we are atuck and most of the Graph still untraversect . tHe ther continue from Vertex 4h, which at has unexplored . edges. A Des might come op oe the path 4, 9,4, 49M, 10,4, 9%, 3, + TH WE splice this path into the previois’ path of sin,tor 6, then tae gee & Dew path 4 Bry WB Ted Mp 10,7, Fy BH yO % In this alt, vertices must have even egree, 40 we are guarantees te fink a cycle & acl. Te rezk vertex on the path that hos csntraversect edge 43 vertex 3, Pp possible ruwt 4 3,2, 8,9,6,.3 . Wher Splceot In, this give the path ,4,1,3,2,8,9,6.3,0) © 1110,7,9, 3,7, 7O,S- ose o © -. ® @ : °@ @ @ © & 4 This the remaining graph om thes path , bre ext Vertex with an untroversect eolge BF ,ank He al goritire finds “the Wrath F,12,10,9 . Wher thus 43 actolect ss Pn wernt path, a etree of 574,13, 28, 9,12, 10,9,6,3,1, 441)10,1,9,3,4,10,5 2 obtained . . ; mAs all edges are Lraverseol, the algertthnd terménale, with On fuler crustt 4 ‘ 4Te make thts algorithire epicient, Mpprepriale cata structure dike NLnged Ls me wed . tthe manny time of Oe atgoritter 4° O18) wily) ) ® Dimeti graph: - . ' a Directed graph can be kraversed in Noe ar Lime, using DFS. Ty He graph 2 not. sire: connect | a Drs starting at tome node might nob Viale ate nodes Consicler the Atanting vertex Bee Secend the Vertex to be visiled 2H Ore use t pes & bb we usherne r be directed Grapes auettc: er not 7 ry the divreckek grr 2 ey hee " edges . Bur here there ane back, ey ebowret, Ao, ie a gytic >) Finding 5 + by performing ureter: chetter the dimectet g7aph a +X te ab met wetengly connected, er we con produce pe Subse of ver Efces | tho are strongly connec ad - Ofeyorre DFS in the gear gre In postorder traversal 4 ie tos no back omenG *- pest earths, we can fae aerengy connected 07 706 @ Vertis of Gr are nuroberet depts - fiat apanning foret @ean edges in Or ave. vreversek goroming Gy ® Popes aes om Gv, starting & reo DFS at higtat rumbernd vertex ser . © cach of the. trees th tals depth - pine apanniag forat form a abrongly wonectat component ub in + ulke tree Hews, Ee braversech in She \Foth: ? ; Bac 7A PD PEE H2I2T Gq. tee Te gosusaee” 7S . 4 G | 2 eae % bd OT io! 7849 Now the Gy with Sivonen Aranrsel number & gHere the atongly Connected carp overls are kay Luetizp den cry spied . Why tate Works - * ory, a vertiees a are In same. ahongty tannecleck. caepeent, Bhen tere ave poaths on Vv to wo art prom wt vj, the eriginae graph & and ato in Sry hI Vand w are rot in te 40/0 : je aame depts,-zint 4 2 > panning Zi seg Ge taen they cannot be in same o0ngty = “91 i wenneed corm parent [Brosth Fist Seoach : 3 bh thal operate 4 x The strategy for Bearhing, A 974 by preeastng vertices In dyer : bye erties closet b most ox bank we ore evatuatet fivet, ant tne a breadth— | the tai a Knowe Vertis ore evatuated dest fit sear ‘evel orcey Aravernak for trees - athe & appt ter finoking shortest path in Linvetighted « dined groph Sa gre A same o the © dmue ong code in Be pope ‘anct designate, there ase gp rode rt mork ik os visi beck ae ! / esjauny matrix ¥ Graph. fir ate tered nee thot ore nok Vistlek Zeon @ veing Wpor ons bia use te Bee peorch Mon chee viziled ge Mou at ale dor She Pee earch nooles one by one. Ovepeot ae Or np odes ablady 2, tw Ae premou. 0aKch hode ant Udine + O Papert Ba ups ural: yee ple : ou Ita radar gut Visilid - napa peedne SuoeTEST PATH ALGERITHIOS y F The atgerithens that arc tachab fer ffoding be ghar paths In the graph Le thortut path abgoritors - ¢ 4 atoput ! Netghted graph’ whi & assodotet soi cack edge ) Ba wee ony to traverse the ‘edlge | th Single source aborts’ peth problem .\\ Ui Vreelghtict’ alorlintes pass, city Dij katrals Algorithm + a Graphs wlth Negative edge tas W) All pata Ahorbest patas . whine go S/o, aeuree ahozleal poth pings 20s bis » The dps fo” thn groph tin & wilgbded grophe GalyF) ort o htebingeiahed vertex & Uthsts, ts 2 ‘i shorter weighted. slorbing Vertex ook tie out the ge othe, vers in G. Path from 6 bo every be coltule Kal as Vv 2% om *The shortest poth pare Ns Y2% 2% DI V, 2%, 2% OY DE MP2 Y 2% PB IN yy PII Ble yt 2% P% PB Y2¥n 2% 2 %5 2 OH, Dh Ly ee eee UP BIT f Y 50 the " shorlat wei ghteot perth pn bv 4 6- suppose "ee a an unweightecl gp then fe Ahortat Ut8-lo¢) a-s # the seen. path Bes. cast -Sy but 16 A nob the shorlest becouse ib has doop - os 3 Thus the short jou betiveen ‘two print & undefineg - an te top. ss known as Degatie cost _tycle. Unwelgned Shorkest paths = o vsing ome Vertex 5 ,we would Like bi pind the crate Queue (rams Make Empl (2); Enguueme C5, a5 whele ( {La Emp ca) f v= Dequece (@);, for each W adjacent ev i, ( TEwy . Dist == 0) ov wv. a Mg ioe) * . a TCow] -Diat =TLvJ- Dist +1; TLw) - path = Vv psn <8 aes Cedar cuand SV Se omeek vt vb renal 3 , , Dispose Lume (8); bs Negative Fege carbo Vola welghtet (Table T) . a * : 5 1 ‘ Quere @; Verkx VWiWy Qs Crate Queue (VU); Mane emp (a), al 4 yw Engueue ($,Q); wile’) satnply (3 ,. i‘ a f Ve Dequeue CR), . fo ah W ayant to Y 4 (TM, Dib + TLwJ--Drist) o£ Tow. Dist = TLV). De Dist +c, TLw] - pabh =¥) Crquene CW, 2; . ra 3, Bova pose Sueue le?» - a 3 pijkstrals Pigerith + The grout method te solve the 4h ero mainly for We pee seas get shortest pases prob. wb known os Dy isles geri). pe Vv while. has the’ dmattert ‘déstanc eee select a ve Oly arnerg ate the unknown vertites and declares that the shorlat pote. epee the distance x ; ros whe remainder can be peeiee as cho . < stv & kqwe = Arial Untniein betince verter 5 Apr ee odjaurt eV * St CL TEI Krewe % be ig (Teds ame + Cy, STEMI. ie) 7 eae < ye seas, (teQ-22- & Th. aby fn tae prea) a “ Mesnened Co tageansd TAesend 4, eyes g 0 tome gy omar Rn ae ecahe ie eo.° «& o ° so 2 2 = Bg o CLO beh ® wf, . 5 ’ 5D io O16 O C2 we sa 26 oa 6 2 ’ ’ * - t Oo - of6 = 2 26 2% ow Ste Cia ‘a fapmie ie j*% eo 3% 3 #@,» o .f oo 2 ao * = ere * # % Ge Gps Sre.4 ey, w “ 7 bemeterres "to impsitant te fink the sherkat pat bebmer a pacre Yo tte “ne graph \ Freya. wacanane Aigetien / a1 rte oe gph analysis algorithm fr fiocleng Ahortest path In o ighted > walt positive oF negative 2olge conigh (but utth * vegone yd Ny For firding bransthie closure 4 e elattor> = 2 Ree cunt 6 j) be the Leng of Ahortat path from roy ves only bitte Hye & Intearmectiale verbies < pomiag >k-o, ink (0,4 j3 a oe eg AO bor eolse, scest (Or hjre é yt exis! > isk ky MJ) = re) teeak (R-1y Kaj) 5 mat (oldst (KI sis sot Ck ef), For a ang veuices Taj, Bre _ eg % hart ie pat yt inj with alt Intec oldate. vette 6k simp Your k ab alt or she horlr path 9°? involve through b umbination of pom tem ae ae jemmawtona, Cetin, By Best Je ge A A Inter mediott verttees , 0 Ase (Wyis Vertex ko, so the shorts Paty between Pay J ‘pK anol from way any mre gree bhortat olistance beboeen i >y- Pseudo code *- 7 {th sca cea for gaph wlth N vows yo3 a ter grt on ws : sod Nh for jr! bo N B ip tare don eae from 12) : dist Lo3Li3 tj) > Lens on fh te diet LeJLIL)3 re] yer pail) eo sen Bad aun > Diy tN . ae Ire el * vere aust LILI LI = min( i oleate Lr LILI» _ : Ase LK-BLiT DG + eent Le-IEIEjJ) pane gh hort olistance betneen 2 nodes ond So short parr 1 be cersbuclec - . w This tokes otat), Wee amt epee comp lexity a This algertihm th 2? oppor Of dparte PRINS dest Lot cae j3 1 Now freeze the pirat row + pirat Colyme Now find the shorteat ostonce between bwo rodes cust £19 Ba 6j2 atest [SILI ci 34 The finat’ table’ give the chortal distance the nooles ay The Shortast pees OO & = 1, [Pam se a } - Beuce to clestinatrm 43 3 fob wt xe Bell Ferd algaultmn:- | ae wi ths algouithen A caat ko fork shore & patn from asourte Vater all verter fn Be given 9 Algesthon - ve dapat © Graph and tre acute vertix. te Cubpat > To fink tre cherfat par 4 all vertices from. Source. Y nepote cycle found, there bhertst chistance cant be calcula ct (b thes step initializes Ue etéstance from -fouser ge alt vertios as co, art source itself as 0 Cxtale an axar cles EF with ale values 24 0 except cist L Source Gv cotetating Shert&t okstance. , Do the fetowing |vi-l times where vt a the | Rurmber 4 vertices iy pepe eo the four ig for cach edge u-¥ f % olds Ev] > List LU] tweigae qf eae uv then upetate catst Ly 7 quisk[v] chat Lu] + wage & She ur UH when tp wepent negarie wupae Cycle. So ole er cote uv - Se 4, cual CYT > dest Lud + Wweagae Seb ae ten goph contains mepanre weignt cycle eT ue fteuate Ltrough ate eoloes Cz, Gusteraes ant germ short potn fr! any verti, CF thee ao negative wephe yee Ma Ve | 13 Ys 13 |V% 13 |v, 13 |e 13 M% laclva [| asf] ac(u | oe be ae Biiett | ¢ lve @ |% e |v lve = Preulocods — ance) SoS aise LS yer each VE Mice Gomes eB Gab Lvs, <2 for pet to Ivi-! a ee each edge cu)’ © E do vy) Shen if otstfS pdistrul + OC ok Evy < uae EA ee (er? node [VIO 4 for carr eee ww) dest Lvy > west Ca + at Shae Oe negoo ween = oCsance, VD ef ecey) do . opt exist ac me wok aE [J Time o (Iv! 121) Finally the, veutices ottn Shortat pistance jen seruce ave Vo 2° Ve 29 v¥2F Ys 13 t,o e ve Pas v3 217 Va oe Taportance of Beteman Fert alge. — én vartous @ Negative weg hG can te fount appticacions ot geaph @ this works beter ar Adsht beet. tyetems fon Dijesrra’s abpantthen

You might also like