#include
#include
#include
using namespace std;
int cost[10][10],i,j,k,n,m,c,visit,visited[10],l,v,count,count1,vst,p;

main()
{
int dup1,dup2;
cout<<"enter no of vertices";
cin >> n;
cout <<"enter no of edges";
cin >>m;
cout <<"EDGE Cost";
for(k=1;k<=m;k++)
{
cin >>i >>j >>c;
cost[i][j]=c;
cost[j][i]=c;
}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(cost[i][j]==0)
cost[i][j]=31999;
visit=1;
while(visit= 2)
{
for(p=1;p<=n;p++)
if(cost[i][p]!=31999 && p!=j)
dup1=p;
for(p=1;p<=n;p++)
if(cost[j][p]!=31999 && p!=i)
dup2=p;

if(cost[dup1][dup2]==-1)
continue;
}
l=i;
k=j;
v=cost[i][j];
}
cout <<"edge from " <"<
OUTPUT
enter no of vertices4

enter no of edges4

EDGE Cost

1 2 1

2 3 2

3 4 3

1 3 3
edge from 1-->2edge from 2-->3edge from 1-->3
The post C++ programs to implement the Kruskal’s algorithm to generate a minimum cost spanning tree first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-programs-to-implement-the-kruskal%e2%80%99s-algorithm-to-generate-a-minimum-cost-spanning-tree/feed/
			5
		
		
			
		
		
		https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-programs-to-implement-the-prim%e2%80%99s-algorithm-to-generate-a-minimum-cost-spanning-tree/
					https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-programs-to-implement-the-prim%e2%80%99s-algorithm-to-generate-a-minimum-cost-spanning-tree/#comments
		
		
		Thu, 11 Mar 2010 16:53:26 +0000
				
		
		
		
		
		
		
		http://studentprojects.in/?p=1021

					/* Write C++ programs to implement the Prim’s algorithm to generate a minimum cost spanning tree */ #include #include #include 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 n; cout m; cout >j>>c; cost[i][j]=c; } for(i=1;i

The post C++ programs to implement the Prim’s algorithm to generate a minimum cost spanning tree first appeared on Student Projects.
]]>
										/* Write C++ programs to implement the Prim’s algorithm to generate a minimum cost spanning tree */

#include
#include
#include
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=1;j--)
			if(cost[v][j]
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
The post C++ programs to implement the Prim’s algorithm to generate a minimum cost spanning tree first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-programs-to-implement-the-prim%e2%80%99s-algorithm-to-generate-a-minimum-cost-spanning-tree/feed/
			26