No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
 | Hello. I'm having trouble with creating a program based on Prim's algorithm. This is the program and got the following error: #include<iostream> #include<stdio.h> #include<conio.h> using namespace std; int weight[20][20],visited[20],d[20],p[20]; int v,e; void creategraph() { int i,j,a,b,w; cout<<"\nEnter number of vertices"; cin>>v; cout<<"\nEnter number of edges"; cin>>e; for(i=1;i<=v;i++) for(j=1;j<=v;j++) weight[i][j]=0; for(i=1;i<=v;i++) …  |
| | Sir, I wanted to know the implementation code for krushkal algorithm in C++. Anyone can help me to give the code. ThnQ  |
 | Hello. This code snippet is a basic calculator. The general concept is that the calculator accepts infix expressions as strings, converts them to reverse polish notation by way of the shunting-yard algorithm and then evaluates the resulting expression. I tried to encapsulate the functionality of each piece so that, in …  |