Mustaqil ish topshiriqlari Quyidagi graf ko’rinishlari uchun matritsa quring va dastur kodini yozib natija oling

Mustaqil ish topshiriqlari
Quyidagi graf ko’rinishlari uchun matritsa quring va dastur kodini yozib natija oling.
1-masala: Grafning chekkalari ro’yxatini shakllantirish uchun dastur tuzing.



Dastur kodi:
#include
using namespace std;
int main(){
int n;
cout<<"Grafning tugunlari sonini kiriting: ";
cin>>n;
int k=0;
int a[n][n];
for(int i=0;i for(int j=0;j a[i][j]=rand()%2;
if(a[i][j]==1){
k++;
}
}
}

cout<<"Graf tugunlarining bog'liqlik matritsasi:\n"
<<"(Random 0 va1 lar bilan to'ldirildi.)\n";
for(int i=0;i for(int j=0;j cout< cout<<" ";
}
cout<<"\n";
}
int l=k/2;
cout<<"\nBu grafning qirralari soni "<
return 0;
}


Natijasi:



2-masala: Grafga moslik yaratish uchun dastur tuzing.





Dastur kodi:
#include
#define infinity 999
void dij(int n, int v,int cost[20][20], int dist[]){
int i,u,count,w,flag[20],min;
for(i=1;i<=n;i++)
flag[i]=0, dist[i]=cost[v][i];
count=2;
while(count<=n){
min=99;
for(w=1;w<=n;w++)
if(dist[w] min=dist[w];
u=w;
}
flag[u]=1;
count++;
for(w=1;w<=n;w++)
if((dist[u]+cost[u][w] dist[w]=dist[u]+cost[u][w];
}
}
int main(){
int n,v,i,j,cost[20][20],dist[20];
printf("Grafning tugunlari sonini kiriting :");
scanf("%d",&n);
printf("\nGrafning matritsalari qiymatini kiriting :\n");
for(i=1;i<=n;i++)
for(j=1;j<=n;j++){
scanf("%d",&cost[i][j]);
if(cost[i][j] == 0)
cost[i][j]=infinity;
}
printf("\nBiror tugunni kiriting:");
scanf("%d",&v);
dij(n,v,cost,dist);
printf("\nBu tugundan qolgan tugunlargacha bolgan eng qisqa masofalar:\n");
for(i=1;i<=n;i++)
if(i!=v)
printf("%d->%d,cost=%d\n",v,i,dist[i]);
}
Natijasi:



3-masala: Grafga mos matritsa yarating va dasturini tuzing.
.

Bu grafning matritsa jadvali:

T/r	1	2	3	4	5
1	0	1	1	0	0
2	1	0	0	1	1
3	1	0	0	0	1
4	0	1	0	0	0
5	0	1	1	0	0

Dastur kodi:
#include
using namespace std;
int main(){
int n;
cout<<"Grafning tugunlari sonini kiriting: ";
cin>>n;
int k=0;
int a[n][n];
cout<<"Matritsa elemenlarini kiriting (1 va 0):\n";
for(int i=0;i for(int j=0;j cin>>a[i][j];
if(a[i][j]==1){
k++;
}
}
}
cout<<"Grafning qirralari soni: "<
return 0;
}


Natijasi: