|
Telekommunikatsiya texnologiyalari “ fakulteti “Kompyuter injenering” kafedrasi
|
| bet | 5/5 | | Sana | 23.12.2023 | | Hajmi | 0,51 Mb. | | #127179 |
cout<<"1-Graf qushnilik matritsasini kiriting\n";
for(i=0;i
for(j=0;j
{cin>>cost[i][j];}
cout<<"2-Graf qushnilik matritsasini kiriting\n";
for(i=0;i
for(j=0;j
{cin>>mass[i][j];}
for(i=0;i
for(j=0;j
if(cost[i][j]==1&&mass[i][j]==1){a=i;
for(u=j;u
if(mass[i][u]!=0)
cost[i][u]=mass[i][u];} goto L1;
}
}
L1: for(i=a+1;i
for(j=0;j
if(mass[i][j]!=0)
cost[i][j]=mass[i][j];}
cout<
for(i=0;i
for(j=0;j
cout<
cout<
return 0;
}
Xulosa
Men bugungi mustaqil laboratoriya ishidan Graf , Graflar haqida tushuncha, Graflar turlarini sanab bering, Graflarning berilish usullari dastur tuzishni o’rganib oldim.
Foydalanilgan adabiyotlar
https://t.me/algoritmlarni_loyihalash
www.hozir.org
www.google.com
www.fayllar.org
|
| |
