Implement Depth-First Search in a graph

---

#include<iostream.h>

#include<conio.h>

#include<stdlib.h>

          INT cost [10] [10],i,j,k,n,stk[10],top,v,visit[10],visited[SWSSSSSSSSWWW];

            void main ()

{

int m;

cout <<"enterno of vertices";

cin >> n;

cout <<"ente no of edges";

cin >> m;

cout <<"\nEDGES \n";

for(k=1;k<=m;k++)

{

cin >>i>>j;

cost[i][j]=1;

getch();

}

cout <<"enter initial vertex";

cin >>v;

cout <<"ORDER OF VISITED VERTICES";

cout << v <<" ";

visited[v]=1;

k=1;

while(k<n)

{

for(j=n;j>=1;j--)

if(cost[v][j]!=0 && visited[j]!=1 && visit[j]!=1)

{

visit[j]=1;

stk[top]=j;

top++;

}

v=stk[--top];

cout<<v << " ";

k++;

visit[v]=0; visited[v]=1;

}

---

Output:-