Minimum cost spanning tree in C language | with simple code

Minimum Spanning Tree:
Minimum Spanning Tree is a Spanning Tree which has minimum total cost. If we have a linked undirected graph with a weight (or cost) combine with each edge. Then the cost of spanning tree would be the sum of the cost of its edges.

  // write a program in c for minimum cost spanning tree
  #include<stdio.h>
  #include <conio.h>
  int a, b, u, v, n, i, j, ne = 1;
  int visited[10] = {0}, min, minarr = 0, arr[10][10];
  void main()
  {
    printf("\n Enter the number of nodes:\n");
    scanf("%d", &n);
    printf("\n Enter the adjacency matrix:\n");
    for (i = 1; i <= n; i++)
        for (j = 1; j <= n; j++)
        {
            scanf("%d", &arr[i][j]);
            if (arr[i][j] == 0)
                arr[i][j] = 999;
        }
    visited[1] = 1;
    printf("\n");
    while (ne < n)
    {
        for (i = 1, min = 999; i <= n; i++)
            for (j = 1; j <= n; j++)
                if (arr[i][j] < min)
                    if (visited[i] != 0)
                    {
                        min = arr[i][j];
                        a = u = i;
                        b = v = j;
                    }
        if (visited[u] == 0 || visited[v] == 0)
        {
            printf("\n Edge %d:(%d %d) arr:%d", ne++, a, b, min);
            minarr += min;
            visited[b] = 1;
        }
        arr[a][b] = arr[b][a] = 999;
    }
    printf("\n Minimun arr=%d", minarr);
    getch();
  }

When the above program is executed, it produces following results --<\b>

   Enter the number of nodes:
  6
  
   Enter the adjacency matrix:
  0 5 2 0 0 0
  5 0 8 0 0 0
  2 8 0 3 4 7
  0 0 3 0 0 4
  0 0 4 0 0 4
  0 0 7 4 4 0
  
  
   Edge 1:(1 3) cost:2
   Edge 2:(3 4) cost:3
   Edge 3:(3 5) cost:4
   Edge 4:(4 6) cost:4
   Edge 5:(1 2) cost:5
   Minimun cost=18