Analysis & Design of Algorithms

#include<stdio.h>
#define MAX 10

int a[MAX][MAX], n, cost = 0;

void kruskal() {
  int root[MAX], i, v1, v2;
  for(i=1; i<=n; i++)
    root[i] = i;
  // Greedily pick min edges...
  i = 0;
  while(i != n-1) {
    findmin(&v1, &v2);
    if(root[v1] != root[v2])
      update(root, v1, v2);
  }
}

#include<stdio.h>
int a[10][10], n, cost = 0;

void kruskal() {
  // Greedily pick min weight edges
  while(edges < n-1) {
    findmin(&v1, &v2);
    if(root[v1] != root[v2])
      update(root, v1, v2);
  }
}