Depth first search and breadth first search for graphs using recursion

#include<iostream.h>
#include<conio.h>
#define max 10
int adj[max] [max];
class graph
{
char vertex[max],visited[max];
public:
void creategraph(int);
void breadthfirst(int);
void depthfirst(int);
void dfs(int,int);
};
void graph::creategraph(int v)
{
int i,j;for(i=0;i<v;i++)
{
cout<<"\n\tEnter the node value:";
cin>>vertex[i];
visited[i]=0;
}
cout<<endl;
cout<<"\n\tEnter the adjacement vertex list for each vertex of the graph";
int n,k;
for(i=0;i<v;i++)
{
cout<<"\n\tEnter the no of adjecent nodes for the vertex:";
cout<<vertex[i]<<":";
cin>>n;
for(j=0;j<n;j++)
{
cout<<"\n\tEnter the adjecent nodes:";
cin>>k;
adj[i][k-1]=1;
}
}
cout<<"\n\tGraph with no of nodes="<<v;
cout<<"\n\tThe adjecent matrix"<<"\n\n";
for(i=0;i<v;i++)
{
for(j=0;j<v;j++)
cout<<adj[i][j]<<"\t";
cout<<endl;
}
}
void graph::breathfirst(int v)
{
int i,j;
for(i=0;i<v;i++)
visited[i]=0;
cout<<"\n\tBreadfirst Traversal:";
cout<<vertex[0]<<"==>";
visited[0]=1;
for(i=0;i<v;i++)
for(j=0;j<v;j++)
if(adj[i][j]==1)
if(visited[j]==0)
{
cout<<vertex[j]<<"==>";
visited[j]=1;
}
}
void graph::depthfirst(int v)
{
int i;
for(i=0;i<v;i++)
visited[i]=0;
cout<<"\n\tDepthfirst Traversal:";
cout<<"vertex[0]<<"==>>";
visited[0]=1;
dfs(0,v);
}
void graph::dfs(int ad,int v)
{
int i,j;
for(i=ad;i<v;i++)
for(j=0;j<v;j++)
if(adj[i][j]==1)
if(visited[j]==0)
{
visited[j]=1;
cout<<vertex[j]<<"==>>";
dfs[j,v];
}
}
void main()
{
graph g;
int ch,v;
clrscr();
cout<<"\n\tGraph Traversal"<<endl;
cout<<"\n\t*************************"<<endl;
cout<<"\n\t1.Create Graph";
cout<<"\n\t2.Breathfirst Traversal";
cout<<"\n\t3.Depthfirst Traversal";
cout<<"\n\t4.Exit";
do
{
cout<<"\n\tEnter your choice:";
cin>>ch;
switch(ch)
{
case 1:
cout<<"\n\tGraph creation";
cout<<"\n\t*************";
cout<<"\n\tEnter the no of vertices to be created:";
cin>>v;
g.creategraph(v);
getch();
break;
case 2:
g.breadthfirst(v);
getch();
break;
case 3:
g.depthfirst(v);
getch();
break;
case 4:
break;
}
}while(ch!=4);
}

Output:

Graph traversal
1.Create graph
2.Breathfirst traversal
3.Depthfirst traversal
4.Quit
Enter your choice:1

Graph Creation
**************

Enter the no of vertices to be created:4
Enter the node value:1
Enter the node value:2
Enter the node value:3
Enter the node value:4

Enter the adjacent vertex list for each vertex of the graph

Enter the no of adjacent nodes for the vertex:1:2
Enter the adjacent node:2
Enter the adjacent node:3
Enter the no of adjacent nodes for the vertex:1:2
Enter the adjacent node:4
Enter the no of adjacent nodes for the vertex:3:3
Enter the adjacent node:2
Enter the adjacent node:4
Enter the adjacent node:3
Enter the no of adjacent node for the vertex:4:2
Enter the adjacent node:1
Enter the adjacent node:3
Graph with no of nodes:4

The adjacent matrix
0 1 1 0
0 0 0 1
0 1 1 1
1 0 1 0


Enter your choice:2
Breathfirst traversal:1=>>2=>>3=>>4=>>
Enter your choice:3
Depthfirst traversal:1=>>2=>>4=>>3=>>
Enter your choice:4