/* Write C++ programs to implement the Prim’s algorithm to generate a minimum cost spanning tree */

#include<iostream> #include<conio.h> #include<stdlib.h> using namespace std; int cost[10][10],i,j,k,n,stk[10],top,v,visit[10],visited[10],u; main() { int m,c; cout <<"enterno of vertices"; cin >> n; cout <<"ente no of edges"; cin >> m; cout <<"\nEDGES Cost\n"; for(k=1;k<=m;k++) { cin >>i>>j>>c; cost[i][j]=c; } for(i=1;i<=n;i++) for(j=1;j<=n;j++) if(cost[i][j]==0) cost[i][j]=31999; cout <<"ORDER OF VISITED VERTICES"; k=1; while(k<n) { m=31999; if(k==1) { for(i=1;i<=n;i++) for(j=1;j<=m;j++) if(cost[i][j]<m) { m=cost[i][j]; u=i; } } else { for(j=n;j>=1;j--) if(cost[v][j]<m && visited[j]!=1 && visit[j]!=1) { visit[j]=1; stk[top]=j; top++; m=cost[v][j]; u=j; } } cost[v][u]=31999; v=u; cout<<v << " "; k++; visit[v]=0; visited[v]=1; } } |

**OUTPUT**

enterno of vertices7

ente no of edges9

EDGES Cost

1 6 10

6 5 25

5 4 22

4 3 12

3 2 16

2 7 14

5 7 24

4 7 18

1 2 28

ORDER OF VISITED VERTICES1 6 5 4 3 2

can we use m=another number ?

Above code is really bad. see this for better explanation :- MST using Prim’s algorithm

what pgm is this………………………bosssssssssssssss

Come on guys… give it a break. After reading this long discuss I decided to give you guys perfect code for Prim’s Algorithm. Its in C++ and its very easy to understand plus it works as well

http://in.docsity.com/en-docs/Prim_Algorithm_-_C_plus_plus_Code

missing of vertex 7

output shows 1 6 5 4 3 2

what can i do for this?

there is cout not in scop as well as getch not declare scop these error are occured what i should do. in cpp lanugage

can we used graphic.h to show the line of the minimum edge.

This code is leaving me with infinite loop. What should I do now ?