Scribd
Upload
19 views31 pages

Data Structure and Algorith

Na

Uploaded by

iswarpatild
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
19 views31 pages

Data Structure and Algorith

Na

Uploaded by

iswarpatild
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
DaTA STRUCTURE Fnyiting to give information is called dara. Ext Student nlamz , Student Roll ato. Represintarteni of dare ts Catled Structure. bx Caoph , Arrays, Uist. Dera Stwuuture + + Dara Strutrure = Dara + Structure . + Dofa shuuure ts a Way fo Core and Organize dara so met Tt tan be used eFficdeariy (barter woy ) + Dare strumure isa day of organizing at dota itemy and relationship to eath omer - pre seemed Lunieoins) Types of pata structure : Tiere ave malniy two types of eta structure, Non Pasrarmive Data_sreucture Pramcrive Data sTavervee] Lineag bata srauervee! Nest Lnean Prtmittve data structure] These are backe Shure and are Atreany opeoted by machine Instruction . Exe fnteqer, Fieat, character - Non- Primitive data structure? These are derived From the Primitive dara Strutures ts a coututton of same type or differenr type primitive data structure. Ext Arvoys, stouc, trees: Dara Struaure Operation The dora MHch is Stored in Quy data ~ Struuure are Processed by some set of operation) + fin Arvoy can be defined as an tnfinite conteation of hornogeneous ( sImhiay type) )fEnserting Ass a neta dota in pee dora elements- Shrutrure. + Array are adoys steved fa tonsecutive Remove a dara from pu data (specific) memory tocation. struuure- Axroy can be stored Munpie values Which 2) [soning | Frrange dara increasing or tan be YeFerenaed by a single name. derreating order. wn ffawraing] Fins tne toution oF date tn [Reesor naan J dara ftrutture *) [riergteg |] tomptning ‘the data of #0 different stored Flies Into Single stortd file> cffereaag) cacy exh cae ery ont in th dora struuure so that each dara Items is fraversed ov visited. romaa Cumcepiny) + [Singie Dimentionat Arrays : Multi. Dimentonal Arrays ¢ Tr is ago Known as One Dimer Honat (1D) | Mutt Dmentlonel Arrays use More than one Subscript to deserbe the Arrays elements. CLI CI--- Too Dimentionad firrays t It's use tuo [vow] Ceotwmn) supsuipr, one Subscript tO yepresent youd yalut and second cubstripe fo vepresent Column value « rt malaty use for matrix Representation « Declaration two Dimentlonal Arrays? Dara- type var-name Crows) Ctolumn) &: fat nom C3) 02) THiHalization 2-D Arrays: dara. type var-niame (vows) Cecluma)={ vetuesp 5 exS tM num ts} mad 4425.4, 5,635 of int num (11> {423.4503 33] numb =) ay eo Arroay + Ths use only one subscript to define the elaminrs of Ayrays [vow] [to1umn] Deelararion ¢ ata - type var_name Cexpressonl Ex lat num [10}5 oe char ¢ U5]5 AIntttattzteg one - Dimentlonat Array + Dara- type varname [expression] *{ values} ; exis int num Lel+ {1,2,3,45,6,7,8,9, 10}; onor a6) = 'A", '8','0";0','€9 5 um fe) = Aumpa er aurioy] = aumpa 5 nurmiag < & prac Kemae CUNKEDIAL) \irite_a Progiam 40 yeas ff vorite one Stacks (Date Structure) Dimentlonal Arvosy- 7 . Tncude Pm ee gmt Le Stack 15 q Alon - Primitive Ungar data Teclude t0Ni0> Gon sore bapa out Struture- Give GO, 34th) ft TEMS an Ordered Hist ta Which addition of void main ( 9 ned dota item and deletion of already existing { tora fol, i: data them is dong from onty ons End crs (10)5 Known as Tép of staus (ToS) Prine & (“enter thi Array Elements”) 5 pop <— Posy for (iso; , 1<-9; ) S+t) s t > Print ¢ (“the entered Array 13"): for (f=05 Le=4) f44) aes Sean€ ("7-3", €alt]); — -d\n", ai); 3 + The last qaded element wit be the First 40 gerch 095, be Removed From pht staux. “Tris Is the veason crack is Catled Last-lo-pirst-out (LIFO) type Of Nist- Oferatfons on Srauc Stack Operation £ Algorithm There are two operation oF stack. Statk has 4190 Oferation. 4). Push operation. A}-[Push operations]. Th process of adaing —[a1- Por operatton. g ned element to tht fop of stack fx canted Pus operat 3.[PosH Oferarion The precess of adding 4 + Every nao clement is qading fo stack top | new element of tre top of stauc Tf called is incremented by one, |fusy Operation = Tn case th array Ys Fa and no newelement [+ Every Psy operation Top is incremented can be added it's called Stack full ox by one. Stack overfiow® condition. 2): + The Process of dtiatiog an ejoment From ou top oF stack failed Tn ease tht Arroy tr fan no new elemant PoP _oPeratt . te added - this condition jz cailed + After every POP operation th stack (Top) fs. | Stack Fun of Stack Overfio® Condition. decremented by One. + Te there ts no element on pat staucand fr [AF Algorithm for lnserting an item Into PoP Fs performed tran Ps Win result tro PA Staus (Pus operatton) . Stack _underPlod Condition. Ter = Top +4 punto), re sabe Posy ( Stack Umax size, Hem) Steet: initanize su teps=t Step Repeat Steps ie S unl) Tepemaxsize-| Steps: Read [tem Stepus Set gop= topes Step Si Set srauc Lop} =item Step 6: Print " Sra overfiow” 2. s The paccess oF deleting an element From Th fop of stax is cated POP Operation. «© Afrer every FOF Operation an Stack TOP is deevementtd by one. Ter = Top -! «TF share ts no element on tN SINK and the ec? operarion ts performed gun pris Win result] Ino STACK UNDERFLOW. condivfon. 0] “por cpenamien_-* POP ToP a2, 4b Algorithm for deletlag on item from tre Sracx ( por) PoP ( stack [eax Size], Mem) Step i: Repear steps 2+04 unt! Top 2.0 Step 2: Set trem = sraeg CTF 1 Steps Ser jop = top -1 Step ds Print, Mo. delered is, Them Steps: Print srack under Flows "Stacks (Prefix gf Post Ptx) U.[InFiz Notation J bunere tne operator ts written Tn bandeen tha Operands. Ex ATB + OperatOl A,B Operands. a) [Prefix notarlons] In ths operator ts Written beer’ PRE Operands. Tr Is also Known as Polich nletatton. xr +A 3) [Fostex atoratlen] Th ants operator 6 uasttien AFter the ofetands. Tt ts also Knoton as Surelx Notation, cyt ABE ‘Foddlered Postetx? (A+B) « o/0 + 6°F/G ABD # clo + 6°F/4q Let AB + Reco + ef iq Ri # CID HERD Lat CFM oe Re C/0 t GG BQ» Convert the Following Inte to Prefix and fostte Por (AB) # C/O +E F/G Prefix 9 (A468) ¥ CID +E FIG + ABR CID + EM F/G Let_+ Ag =@ Rw CD FIG QR * Cpt AEF/G > NER = Ra bs * CoN + halg Rix YD + Raq tet ep) = Rs RK 1D + RIG R€ Rt RIG ofa [cD Rx Rix Rs + Rye Re + haylq Ler RaGs =Ry Ri & Ro + 1RG Ri ¥ Re t Ru Lita ats Ba Gils Dre Rm Rg Re — fo ¥ = Rs 5 +R #K RRs + Ry Ree Now enter tre value of Re, Ru Rs, Rr, QR; Re Rut Bi Ra Bu + AGE COP ® he GPE R+ Cd ErD ARCO EEE A, presen, enter tne value of Rs, Pu, Rea, Nowe cnr Rea] ong. oe Rees EE AAS ICO/ aceG Ext convert CAtB *C) Inio prefly and postely using tobtar form ae 40. tonvert tn Preble Patowlag operation Program Reverse the Taper string Perform tabulay mathod and Find portétx expression Reverse tals postlx Expression string to find the PreFlx + AT BRC rit fe add branches tar exe) Reuerce stelng Cex eta) Prioring no Kighest 1 2 nlghest Ho + OE rope. cB cB BHA beat So tu postfix Exprecsion cB x At- Now reverse tne Expression to ger the prefix 40 prefix pretix 1s +R BS pe, ae Convert postéle 3 Diver perform pabulay fom CAFR HC) _ : [Symbol Sanned] Bras Postély Expresston| 4 express A Insert 10 * Queue tt a Alon. Aimitive Unar aor stucrure. + Th As an hemegengous corettion of elements Tn wONth ned erements are gaded at one Gnd Caued thy Keay Ends and tht extsHng, elemene are dand from Omer Ens Canes tha Eront end. + The first added element wht be tht Alrst 40 be remove from +e queue. thar Hs tre Insert 50 yeason queue Ys couted (Fre0) First = in — fie) Airst our type ate 2 + Th queue every Insert opteatton gear ts e Totsemennna by “one, dealer element. First delete 10 ReRel Ror £ Fe) ng every deleted operation Front 1s o[ se] Incremenrtd by one Fett Ex > petfiee-t delet? Second element J C Tnart 20 Tes 30 emety Queue =0 Step it sur Rear =~) Step 2.2 Sur trem = Queue Cfront) Step2t Repeat steps 505 unt) Sp3: If front= = Rear Kear 4 mazsi2e = Set Front = 1 Step 3: Read Item Set Rear =-) Seep ut if Pron else front = Front +) Petar, alo Derered $x, trem, Polat "Queue ts Empry or a: Srp: Sur Gveve CReqy] = tem Srepe: Fint, Queue ts OverFroid CIRCOLAR Queve 3): Each time a netd element ts Inserted Into the queue the Rear Ts Incremenred by one am A Clrewar queue is one tn nich pet Regt = Lear +1 Insertion oF @ new element ts dont at tne very First location of the queue IF the last Jocatfon lu): Each Hme an element ts delared from the of queue is Full. and queue gat value of Front }s Ineremented by one Front = Front tt @ 60) abs tro Feae-t [fnsertan element in chrustay pieue «] Sy Age > GINSERT (Gueuelmaxsize], Item) Fay “Step 1.9.16 ( Front = = (Reavei) r maxsize ) Otte queue Ws ever Flow ¥ Exit. 4b A Grewar queue overcome Hu Problem oF Else: pare the value Unulltized space In Unay queues Impremenred te ( Front = =-1) ag arrays, Ser Front =0 - Rear =0 Chrewlar queue nas Poilowing Condition Else ry Rear = (Ceear 1): maxsize) 1). Front whl gucays be pointing jo ra first (assign vauel Queue CReav) = vatue - element feng te]. 2): Tf Front = Rear thi queue why be empry- 2 Queue (Dara Structure) OPeratton on Queue 0, om ; 0, 26,30, Wo maxsee 23 Front =k empry queue Rear =-1 BOS Step Repeat KR < moaxsize -1 cd “1624 < re & uN 3. uO Read trem ted VOD Vee] Val V0) UE) R20 Reare marsize-1 f, sep gray = 50 o (Cerone t1) 7 maxsize) €rses Cena 1 crerement) > ttem datuted- 2). Extr- Queve ( Data strutture ) Dearere oferation On Gueue ext — [ie [20] 30 moxstze =3 fe) 907 902) Feo | Re2 bk CLINKEDI 3. case 1). FR FO ©>+0 true set Iter = q (0) Trem =10 al fF =7R Os: 2 Fotre ene eer fe Or =) 4). Mem ls duued tO fs dared 20 | 30] Yoo) Yr) $02) Fel so Cer Fel Qs2 © true vu] ne =k 2 False e+ tee Trem is daues 20 Ss delered- [ 30 Feo Ree Case 3) y F>=0 2D lore 2) rem = 4.02) Them = Fo gif ee 2 2 2 pre Su FeH Re-} pre waren fasnvceors), WY item Ys deiured- Srp Yueue 12 empty Ts Maderfiow ee a Aen (ee eS eee Linkes Lisps. A Unkerd Ast sg Mneay dara styauure, fn Onlth pat elements are not stored at Contiquous memory Lovatfon . A Malad Aiur 156 dynamic dara struceere « Trt no. of nodes fn a Aiet fe nor Fixed and qn gyewd and shrink on demand Each Clement {5 canted a node Wen has 4100 parts. Ange part wrth stores ane Infermarion and folany wxith point to rrr next tlement foro [peinter | ex: [to i254] Noe tleo ™Polarer aaa fnes[oomst} [irre pear }frvro] ART ~ i —e[} Be} ee] OCprzarion On Alaked LPst? Tat Rade operation ro be performed on tht Linktd Aste are t- 0: [exeatton ] This operation are used fo reart a United Afst In thts node Fs Crtared and LUnied fo the another nede oy [Tasertion] 14s opevarton ts used fo lncert a ned ned In ph kinked Mats A new node Moy be Inserted. At the beginning of @ Mord Lier. > Ab the Cnd of q Linked [fete a At ane cpeufled postion Ing ntnued Act 3)[Dererton ] Tiss Operation jc used Joddere Jan tem [a node) From py Unies Nist. @ node u): Many tomprex Apputations can de eastty | MAJ be dstired from. carried Ouf cafrh Hated Ists: 7 Beginning of g tinted what. End of 4 Hines Aur. + Spettfled position in pu eter. Advartiges of Makes Usts » Thar is, they tan grow and shrink during the exewHon of a Program. 29 [EFercheat_mimorg watTony Here, memory Is not fre- oilocated. memory 1S quccared Whenever HS vepulveds And Ie deanocared (Removed) Win Its no Langer needed. 3) [Insertion and deretions are easter Feideal Tt proulde Flextbittty tn Inserting @ dara Trem ar q cpeueted Poston “and duerion of @ date rem From txt gtuin posittn. pyuemwman Cunnceoms). 4) [Traversing t] Tr fs a process oF gelng through AI TE nodes oF @ Mnted Tuk from ong end Ye RL Omir end. 5)-[Concarenation =] It’s te process of tne jelning me sttond ist fo rr end OF PAL First Vist ey [Dirieg =] Tes operation 1 used fo print each and evry nodes Information « Tyres OF Malad Aish. + Basteaty , reve are four tyce of Halas Mut. a TES one In wth ajinodes @rt Inked Rguner In come Sequential manner. if 1s also Called tinea Minted Uist [staRr. Prev Da fuce [snc 2).[Doubly - Cinked Clete] It’s one In wwrith al nodes are Uniked rogether by muubigie links whith nalp In accessing borh par successor node (next node) and predecessor node ( Previous nede) wana rhe Vist- Ths nap fo traverse phe Usk In pre fortoatd alretion and bowward dlyurton- Free pam suse fren oe Je = oe 3) [elreoiae Hane ATA ys one wanna ne beginning and no ends & slngty tinted Not Can be mace Crewar Inked thd by Stonply serting she address OF tre very Fivst noge fa TH tink. Aleld OF tht Last node+ vast Liz [stars] Ls 11) } 9/36 i Hel 14 “yf Cireuas doudly aad List tls one pointer in a Gradar manner. START] _ fae of to tare] ® | £ Fast oF 10 Taserting of Nodes In Unked List Ye Tnstrng ar pa beginning of tM Nut 2). Inserting ar tne Gnd oF th fst. 2. Inserting ar pat cpedfitd Position Lota sr LINKED LST LINKED LIST nserting a node ob prt Geplantng In Mnjed Liste | Easert gq alode at th End in singly inked. Algetinm > Inseet_ First (taet, rem) Algorithm > Stepar [ Cheuk Foy overfiows} TP Ptr = NULL then Print OverFiow Step i: Cn for overfiew exit If fry = NULL pon To seer_tast ( stAer, Tem) erse PTR = (node #)manioc (stze oF (nioge?) Print overfiow N create new’ node From memory and ett Pree (Node x) maroc ( size of asian Irs addres! to PTR SU PTR THFO = Shem SHPZL SU PIRG Waxt = START Step ys Ser START = PTR (noaer) 5 Stepar Ser Pre + Info = Item 5 ‘Steps: Su PTR > Next= Nuit ) [SAAT] nosey _node2 —_ nodes Srepus Te start = Aleut ana shin Se] +-—{2e]_ }- {sof Str STAT = Pts (a5) ice, new node. Steps! Sut Lot = start Arter inserHon wo] BO EC eR art Komen Cumrcepis). (staat LInken ust Stepé: Repeat step 3 unr) Loc 7 nvext! Tnsert Location (staet, trem, Loc) tt Steptt Cheuc for averfiow Laer 122 If r= =atutt pun Print Overflow exit After Insevtan. else. Fer =(sloae-x) manioc (stze of (node) Set PH > Info = Trem Jf ctart = NOLL than eel se] Set Sart = Pry Set Phy — nlext = uu Inftiotize +r Counrey T and pointers Set T=0 Set temp = start STAGT pgecmsone CUMKEDIN) Step st Repeat chops Gand 7 nth Le bo, Step bt Set tame = temp — nveet Step 3 Set P= Teh Step tt: La Ptr Nats temp 7 alet SHP AZ Set temp 7 Next = Fty Delering nlode tn Linked List Dereting a node from th Unked Uist has three Instance Sthet Fame) Ls og ] Par fee] J 12 Dereting pu first node of tht Aniad List. 2.2 Dering tre Lact node oF mr Aintad Aare eter Insertion Ea Darering rrr node from spedfied Position of pu dntud Nesp. Unked st Dereeing Nodes] Algordinms > Deured First ( staat) Stepi: Chew for under Frew Jf stavt = NULL, pan Prine Gourd Ist Empty colt Stepar Sur PIR = START Sept Sek START = START 4 Next Step ut Print Clement dated if Pty + tafe Deering sie Eteet Node In SMngly Unwed ist Linked Uist Oeietlng Alodes Derertng the rast node In singly Worked Use AigertO > eng ( armen) Step tt cheus For Underfiow Tf Srark = Null twin Print Liniaa ie 1s Empey exit Stepat Te gravt—t alee © NOLL Pain Sut Phy = Start (SU Start = NULL Print element duared ts = FR info Free CrTR) Enait |) Arter deterton [srart] CL —9[} ls] com Ae CUNKED IN): Step3: Sok PTR = START SHU Reprat step S and 6 until PT. 4 ket | = AOL Steps: Set voc = PTR Step Ge Sue PIR = PIR lex, _ | [CRO Tsr Decening Nopes Step 72 Su loc 4 nleet = alow Srp sr Free Core), Derertng tne nodes from spect te fesitien in Singiy uniad sr srner ] ws He Aigodinm > L, Deere - Lecarion ( next = Pe wax Seepat Free Core) SteeT TRees in Data sTRucruec ATree iL@ non-linear dara ctrucrave Tn WHith frems ave arranged In a sorted sequence + Tk ts Ged to vepresenr Werarenteal vejatton skip existing Qmongsr several dota Vrms. Tal Reet Levet © I [o Lever t ly Teme ro ty belt After deletton. £2] Art cumng Ceinnegin). Y Je] ] Bl Pr tever 2 (] fy [ey cevers (Ue has dteFerenr tomlactogy suth ast sp 1} Tt is spetiany dekigned dora trem fn atree. His the Fest fo che hitwaventcad Ayrangement of date trem, 2) [ROE] Ean dora trem tn atree Is catied O nodes 9 Bu glven Tree tert are 13 nodes sun ast A,B,6, 0, ELF GH, TTL K, LM. 3) [Degree oF a node tr 1s ane no. oF subtrees OF a node 9 a given twee The sogrte oF AB The d0gree of C= 4 The degvee oF Leg 4 Degree ofa treed te fe ta maxtmum aegeee oF nodes in a given trae. In me glean tree 8) ‘The enrlye tree stuuure Is Leveled Tn guth a Wor that tu yeot node is adays ar jue rh ts connecting line of tite nodes. thal Te PN Ing d¥QUN From OnE node HO Gnomer node fy Caled an Gage. ro) {PAE ITI ts 4 Sequenc of tonsecurtve edges the Node A and node T has maximum dogreets)} From TAH Unt all nodes are qyaversed — Shep i: Wilk root node Sheps: Recursively praverce LEPh subrree, hep s! Recurslvely tyaverse Ligne Subree prUL eUmAR LINKEDIN) Pre - Order travertal Is + A.8,6,0,¢, 6 7G 2)+|Tnorder Traversal :] In ths traversal mumod, pr LefrGlsmarvee is vistrta fir, chin pee oobi!) Qnd tater te aignelR) suntree, Aigertim @ Unt! ott nodes ase traversed - Step 1 Kecavstuety tyaverse Lert superer » Shep 2: Victe yoot node. iteps: Reeurstoety trawrse Kignr subtree. Binary Search tree (8ST) * Binary teasth tre Ts @ node- hased Bloary A¥te data strumuse WN, Kas the founding Reece 1). TR voted 0F tre ey In the eee Olid or TEE subtree Ts lees man tht volt oF yor 2). The Voter of tne Key In gat plone chia Or Tight cobtrer ic more than oF equod 19 Tha Oot 3). The vignt and left subtree each must se bea tlnary Searth tree (BST) ATUL cum AR, tnoyder Traversal ts — D,B,€,A, 6,4 3)APost- Order Trowersol i] Th ands mermed ant yoor node Vs viditéd Last, Kents the name First We traverse MeFRt I cubtrte | phan tht | vionr(2) subtree and Finally Ya_yaor celine de Algorithm > Step 1? Rerwyshvely traverse LAU subtree Step: Reumrsively traverse vignk jubtee SHS. Vislt yoor node. fxr e— voor post ordeY Traversal 1s — D.€.6,6,4,C,A DIFFERENCE Between Sra STACK, ‘D): Th vepresents phe collection of elements In Lact ty F1d out Cute) order. 2). Objiurs ace Inserted and vemoued at ANE Same tnd Called Top of staus (Tos ). 3). Insevr opevatton ts cates push operation. Deere operation fs couled Por operation. Th Stauc there Ip no Wasrage oF memory spate. Piore counrey ab marriage Reception 1s an Exampie oF Spo Araceumeg CuNKeDin). Gnd Queue Quveve a): Tt yepresente tht Collewion oF elements tn fist In Fiat owt (ELEO) order ; Obje art Insevid and vimovid from iPfevent ends called frontand veay ends. Thsert Operation fs coued Enqsreue Opeatton. Derare operation is cared Depiene Opevarion « Tn Queue there ls a wastage of memory spac. Students Standing tn a ine or Fees counrey Ts an example oF Queue. Diteerence BETWEEN LINGAR § NON-LINEAR DATA STRUCTURE LINEAR DatA STRUCTURE Th tis dara structure Th elemence art organtzed In @ cejuenu such ass Extn Ayray , Stork queue ete. Th near dota structure single tevel is lnvowed. 2). 3). Tt is easy fo tmptement® u)- Dera etements Can be tyauerced 1n a Singie Run only. 5). Memery is not uttiged Inq effictenr way. 6). Appllearicn oF Uncar D-s- are malaly In Application softuere eveopments Ron AINEAR DATA STRUCTURE Ds Th ants ctora strutture data Te Organized without any Sequene+ ext Tree, Cyvaph art. + Tn nlon- Linear Dara shucure multiple lawels are Involved- ~ TVS Alfficaut to Tmpement- Dal elements Can't be traversed In @ singte Run oniys + mfemony ufittgarion tn an efficient Way 6): Appiteatton of non- near D+ 4: are To ArHeleiar Creeuigena and tmage Processing - ) | AReRY Size cf an Arvo is Fixed firv%y 16 a cotléctton oF somogeneous (Similar) aara type. Memory Ts anecettd From steak Friy work with sraric dora Strewure. Elements are stored tn Contiguous memery jocarion + Frevaxy elements ave Pnsepensent fo each cymes. Prey tole more time- Cinsertion vv peterfon) ArLC sere he CHNKEDIAD LINKED List 4)- Size of q Uist is not Flxed- a): Lnked ist Ts a Collettion of node (data g addyess) 3) Memory 18 qilocared from heap. Mnked Uist Work wirr aynamit dara ftructure. “) Elements can be stored qaynere In the memory, -Minked 1St elemenre ave depend to ean others Lined - ict pare less Himes CThsevtion g petetvon)) DIFFERENCE BETWEEN Tree ann GraPH TREE » Tree TF 0 Coneutfon of nodes and Edges. ext T= Code, ages} THe 1 @ unlgsr node calted yoot In tree - There toll net be any cyule/teers Represents dara in prt form of a tree Strurure, In @ Nlerarenical manner. In tree only one path bertoeen p09 niedes. In this preorder, In order and preorder Traverse. ex te Aral omng Cuicepias) GRAPH 1) Groph tea conletion OF vertices | nodes ana Edget: 2 Gat ey 2): There ts no unlyue node. Be Tere can be joops/cytie. U)s Represents dara similar te 9 networks 5)-In Gyan One or more then one path berwcen +00 nodes 6)-Tn talc Res and DFS traversat.

You might also like