Write C program that accepts the vertices and edges for a graph and stores it as an adjacency matrix.

#include <stdio.h>
#include <conio.h>
#define MAX_SIZE 10
void main() {
		int graph[MAX_SIZE][MAX_SIZE], n, edg;
		int i, j, z;
		clrscr();
		printf("ENTER THE NUMBER OF VERTICES\n");
		scanf("%d", &n);
		printf("ENTER THE NUMBER OF EDGES\n");
		scanf("%d", &edg);
		for (i = 1; i <= n; i++)
				for (j = 1; j <= n; j++)
						graph[i][j] = 0;
		printf("ENTER THE ADJACENCY LIST :(U,V)\n");
		for (z = 1; z <= edg; z++) {
        scanf("%d%d", &i, &j);
        graph[i][j] = graph[j][i] = 1;
    }
    printf("THE ADJACENCY MATRIX OF THE GIVEN LIST ARE:\n");
    for (i = 1; i <= n; i++){
        for (j = 1; j <= n; j++){
            printf("%2d",graph[i][j]);
        }
        printf("\n");
    }
    getch();
}