Data Structure minimum spanning tree

/*pgm to find minimum spanning tree using kruskal's algorithm*/
#include<stdio.h>
#define INF 1000
char vertex[10];
int wght[10][10];

Data Structure Knapsack Problem

/* Knapsack Problem Using Backtracking*/
#include<stdio.h>
int x[12],w[12],pr[12],m,n,z,val;
void main()
{

Data Structure factorial & generate fibonacci series

/* pgm to compute factorial & generate fibonacci of a number*/
#include<stdio.h>
long int fact(int);
int fibo(int);
void main()