#include<stdio.h>
void dfs(int source)
{
int curr,i = 1;
vis[source] = 1;
push(source);
printf("%d ",source);
while(!empty())
{
curr = top();
while(i<=g.n)
{
if(vis[i]==0 && g.adj_mat[curr][i]==1)
{
curr = i;
vis[curr] = 1;
push(curr);
printf("%d ",curr);
i=1;
continue;
}
i++;
}
i = pop();
i++;
}
}
No comments:
Post a Comment