we can do bfs..... from the point A do bfs until distance <= R On Fri, Jan 6, 2012 at 12:47 AM, shady <[email protected]> wrote:
> problem link ? > > > On Thu, Jan 5, 2012 at 5:47 PM, dabbcomputers <[email protected]>wrote: > >> you are given with N points on graph. and a point A on graph and range >> R you have to find the points that lies within the radius of R from >> point A. with complexity less than O(N). >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> 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 [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- *UTKARSH SRIVASTAV CSE-3 B-Tech 3rd Year @MNNIT ALLAHABAD* -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
