@anshu mithra:
Hi,
Thanks for clarifying! :)
On May 30, 11:06 am, anshu mishra <anshumishra6...@gmail.com> wrote:
> main()
> {
> for (i = 0; i < n; i++)
> {
> for (j = 0; j < n; j++)
> {
> if (flag[i][[j])
> {
> bfs(mat, flag, i, j);
> count++;
> }
> }}
> }
>
> bfs(mat[][], flag[][], i, j)
> while (!q.empty())
> {
> x = q.top();
> q.pop();
> if(node notvisited already && adjacent to x && value = x)
> add to queue
>
> }
> }
>
> this is thw whole code!!!!
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
