hi... i tried implementing depth first search...
a part of my code is thishere color 1 is black........Code:for(i=0;i<numnodes;i++)
dfs(vertex[i]);
}
..........
void dfsvisit(long long int u)
{
cout<<"\nRECURSIVE CALL FOR"<<u;
color[u]=5;
d[u]=time1=time1+1;
for each adjacent list
{
adjacent_node = it1->first;
cost = it1->second;
cout<<"\nADjacentfor"<<u<<" is"<<adjacent_node;
if(color[adjacent_node]==0)
{
dfsvisit(adjacent_node);
}
}
}
cout<<"\ncolor of"<<u<<"is changeed to black";
color[u]=1;
d[u]=time1=time1+1;
}
0 is white .........and
5 is grey....