Notes

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define max 20
int g[max][max],n,visited[10],visited1[10];

void creation()
{
int i,j;
printf ("Enter the number of citiesn");
scanf ("%d",&n);
printf ("Enter the edgesn");
for (i=0;i<n;i++)
{
for (j=0;j<n;j++)
{
scanf ("%d",&g[i][j]);
}
}
printf ("It has been createdn");
}

void reachable(int source)
{
int q[10],f,r;
int u,v;
int i;
f=0;r=-1;

q[++r]=source;
visited[source]=1;

while (f<=r)
{
u=q[f++];
for (v=0;v<n;v++)
{
if (visited[v]==0 && g[u][v]==1)
{
visited[v]=1;
r++;
q[r]=v;
}
}
}
for (i=0;i<n;i++)
{
if (visited[i]==1)
printf ("%d reachablen",i);
else
printf ("%d not reachablen",i);
}
}

void connection(int source)
{
connectivity(source);
int i=0;
int flag=1;
for (i=0;i<n;i++)
{
if (visited1[i]==0)
{
flag=0;
}
}
if (flag==0)
printf ("no connectivityn");
else
printf ("yesss cn");
}

void connectivity(int source)
{
int v;
visited1[source]=1;
for (v=0;v<n;v++)
{
if (visited1[v]==0 && g[source][v]==1)
connectivity(v);
}
}

void main()
{
int choice, source;
while (1)
{
printf ("1.Creation 2.Reachability 3.Connectivity 4.Exitn");
scanf ("%d",&choice);
switch (choice)
{
case 1:creation();break;
case 2: printf ("Enter the sourcen");
scanf ("%d",&source);
reachable(source);break;
case 3: printf ("Enter the sourcen");
scanf ("%d",&source);
connection(source);break;
case 4:exit (0);
default: printf ("Invalidn");
}
}
}