Graphs - AdjacencyMatrix

#include <stdio.h>

#define MAX 10

void Display_Graph(int Adjacency_Matrix[MAX][MAX], int vertices)

{

int i,j;

printf("Printing - Adjacency Matrix:\n");

for( i= 0 ; i < vertices ; i++)

{

for(j = 0 ; j < vertices ; j++)

{

printf("%d ", Adjacency_Matrix[i][j]);

}

printf("\n");

}

}

void main()

{

int Adj_Mtr[MAX][MAX] = {0};

int vertices, edges;

int i, source, destination;

printf("Enter no. of vertices: ");

scanf("%d", &vertices);

printf("Enter no. of edges: ");

scanf("%d", &edges);

printf("Enter edges-(source - destination):\n");

for(i = 0 ; i < edges ; i++)

{

printf("Enter source and destination: ");

scanf("%d %d", &source, &destination);

if(source >= vertices || destination >= vertices || source < 0 || destination < 0)

{

printf("Invalid vertices!");

i--;

continue;

}

Adj_Mtr[source][destination] = 1;

Adj_Mtr[destination][source] = 1;

}

Display_Graph(Adj_Mtr, vertices);

}