color and intensity are2 different things ... do you mean to find pixels with same intensity ...!!
and wat is meant by "can be reached" ...!! On Sun, Jul 31, 2011 at 2:40 PM, sivaviknesh s <sivavikne...@gmail.com>wrote: > *Given an nxn screen, Each pixel is represented by intensity values. > Given a specific pixel as an input, find the no. of pixels of the same > colour which can reached from this pixel. Assume any suitable data structure > for a screen. > > ..can this be implemented through BFS ...similar to BITMAP prob in spoj ?? > * > -- > Regards, > $iva > > -- > 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. > -- 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.
