...rayi1..100s of muchiematricearrayi1..50,1..50s of longintvar n, i, j, k, v, costintegers, tvectorxvector1amatriceftextprocedure citirevar i, j, mintegerbeginassign f, depozit.txtreset freadln f, n m0hile not eoff dobeginincmread f,xims.vf1read f,xims.vf2read f,xims.costendfor i1 to m dobeginaixiis.vf1, xiis.vf2xiis.costsaixiis.vf2, xiis.vf1xiis.costsendriteln matricea costurilor estefor i1 to n dobeginfor j1 to n dorite aii,js, ritelnendendprocedure primvar i, j, minintegerbeginfor i to n dosiisvsivs0for i1 to n dotiis0cost0for k1 to n-1 dobeginminmaxintfor i1 to n doif siis0 thenif aisiis, ismin and aisiis, is0 thenbeginminaisiis, isj1endtijssijscostcostaij, sijsssijs0for i1 to n doif siis0 thenif aii,siiss0 or aii,siissaii,js thenif a ii,js0 theensiisjendendfunction fiixintegerintegervar kintegerbegink0for i1 to n doif tiisx theninckfiikendprocedure tatavintegervar iintegerbeginfor I1 to n doif tivsi thenbegintiisvtivs0endendprocedure orasvar max,i,jintegerbeginmax0for i1 to n doif fiiimax thenmaxfiiiriteln orasele optime sunt for i1 to n doif fiiimax thenbeginritei, tatairite vectorul tata este for j1 to n do ritetijs, ritelnendendbegin clrscrcitireriteln dati vf de pornire readlnvprimriteln costul arborelui este , costorasreadkeyend.Problema 2 Se da un graf neorientat. Sa se creeze un arbore partial de cost minim care sa poata fi memorat apoi sub forma unei liste.RezolvareProgram arboreslistauses crttype muchierecordvf1, vf2, costintegerendtype vectorarrayi1..50s of longintvector1arrayi1..100sof muchiematricearrayi1..20,1..50sof longintvar n,i,j,k,v,cost,y,z,mintegers,t,s1,t1vectorxvector1
a,a1matriceftextprocedure citirevar i,j,mintegerbeginassign f, depozit.txtreset freadln f,n m0hile not eof f dobeginincmread f,xims.vf1read f,xims.vf2read f,xims.costreadln fendfor i1 to m dobeginaixiis.vf1, xiis.vf2xiis.costsaixiis.vf2, xiis.vf1xiis.costsendriteln matricea costurilor estefor i1 to n dobeginfor j1 to n dorite aii,js, ritelnendendfunction fii yintegerintegervar k,jintegerbegink0for j1 to n doif tijsy theninckfiikendprocedure prim amatricevar i,j,minintegerbeginminmaxintfor i1 to n doif siis0 thenif aisiis, ismin and aisiis,is0thenbeginminaisiis, isjiendif sijsv and fiisijs0 or sijsv and fiisijs1 thenbegintijssijscostcostaij,sijsssijs0for i1 to n doif siis0 thenif aii,siiss0 or aii,siissaii,js thenif aii,js0 thensiisjincmendelsebegina1aa1isijs,js0prim a1endendbegin clrscrcitireritelndati vf de pornire readlnvm0for i1 to n dosiisvsivs0for i1 to n dotiis0cost0repeat primauntil mn-1rite vectorul tata estefor i1 to n dorite tiis, ritelnriteln costul arborelui este , costreadkeyend.Problema 3Se da un graf orientat si se cere sa se afle daca exista un arbore partial de cost minim. Dar o arborescenta de cost minim Daca exista sa se afle care este este varful acesteia. Rezolvare program arborescenta uses crttype muchierecord vf1,vf2,costinteger endtype vectorarrayi1..100s of longint vector1arrayi1..100s of muchie matricearrayi1..50,1..50s of longintvar n,i,j,k,v,costinteger s,tvector xvector1 amatrice ftextprocedure citirevar i,j,mintegerbegin assignf,orient.txt resetf readlnf,nm0 hile not eoff do begin incm readf,xims.vf1 readf,xims.vf2 readf,xims.cost readlnf end for i1 to m do aixiis.vf1,xiis.vf2sxiis.cost ritelnMatricea costurilor este for i1 to n do begin for j1 to n do riteaii,js, riteln endendprocedure primvar i,j,minintegerbegin for i1 to n do siisv sivs0 for i1 to n do tiis0 cost0 for k1 to n-1 do begin minmaxint for i1 to n do if siis0 then if aisiis,ismin and aisiis,is0 then begin minaisiis,is ji end tijssijs costcostaisijs,js sijs0 for i1 to n do if siis0 then if aisiis,is0 or aisiis,isaij,is then if aij,is0 then siisj endendbegin ImainSclrscr citire ritelnDati vf de pornire!readlnv prim ritelnVectorul tata este for i1 to n do ritetiis, ritelnCostul arborelui este,costreadkeyend. Problema 4Se da un graf conex. Se cere impartirea acestuia in m arbori partiali de cost minim fiecare cu p varfuri. Sa se afiseze acesti arbori.Rezolvare program arboriuses crttype vectorarrayi1..100s of longintprogram msarboriuses crttype vectorarrayi1..100s of longintmatricearrayi1..50,1..50s of longintvar n,i,j,k,v,cost,p,minteger s,tvector amatrice ftextprocedure citirevar i,jintegerbegin assignf,prim.txt resetf readlnf,n for i1 to n do begin for j1 to n do readf,aii,js readlnf end ritelnMatricea costurilor este for i1 to n do begin for j1 to n do riteaii,js, riteln endendprocedure primvar i,j,min,hintegerbegincost0 for h1 to p-1 do begin minmaxint for i1 to n do if siis0 then if aisiis,ismin and aisiis,is0 then begin minaisiis,is...
Download