@sharad.. sorry bt i dint get how to use bellman ford or topological sort here... can u plz explain...
On 8 June 2010 05:53, sharad kumar <aryansmit3...@gmail.com> wrote: > for placing police man we can use bellman ford bfs.or even make use of > topological sort. > > > On Mon, Jun 7, 2010 at 9:59 PM, divya <sweetdivya....@gmail.com> wrote: > >> consider a tree. policemen is to be placed such that for each edge of >> tree, there is a policeman on atleast one side of each edge. tell the >> min no. of policemen and their locatn in time 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 algoge...@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > > > -- > yezhu malai vaasa venkataramana Govinda Govinda > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@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 algoge...@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.
