Algoritmlarni loyihalash

Deykstra algoritmini namunaviy misol yordamida tushuntirib bering

2. 
   Quyidagi graf ko’rinishlari uchun matritsa quring va dastur kodini yozib natija oling.
   

1-masala:

Quyidagi grafdan foydalanib, 1-uchdan 6-uchgacha eng yaqin masofa va yo’nalishni aniqlash dasturini Prim va Kraskal algoritmlaridan foydalanib dastur tuzing va natijalarni taqqoslab tahlil qiling

Dastur:

#include

using namespace std;

int main()

{int a,b,u,v,n,i,j,ne=1;

int mas[10]={0}, min, mincost=0,cost[10][10];

int path[100]={0};

int path_index=0;

cout<<"Tugunlar sonini kiriting "; cin>>n;

cout<<"Qushnilik matritsasini kiriting\n";

for(i=0;i

for(j=0;j

{cin>>cost[i][j];

if(cost[i][j]==0)

cost[i][j]=999;

}mas[0]=1;

cout<<"\n";

while(ne < n)

{for(i=0, min=999; i

for(j=0;j

if(cost[i][j]< min)

if(mas[i]!=0)

{min=cost[i][j];

a=u=i;

b=v=j;}

if(mas[u]==0 || mas[v]==0)

{path[path_index]=b;

path_index++;

ne++;

mincost+=min;

mas[b]=1;}

cost[a][b]=cost[b][a]=999; }

cout<<"\n";

cout<<1<<" --> ";

for (int i=0;i

{ cout<

cout<<" --> "; }

cout<<"\n Eng yaqin masofasi: "<

return 0;

}

Grafni kraskal metodi yordamida qurish dasturi: