thanks buddy!!!!!! im actually new in coding arena ..........well i understood the problem and sawmany implementations the thing is i have read quite a few graph algorithms but im unable to implement them in any problem since i donot have any other mentor or tutor ..........forums are the only source of learning I went through the top coder tutuorial of graph but i could not understand the problems discussed can anyone give me links to some straightforward problems so that gradually i reach a level where i can comprehend and code any graph problem
thanks and regards!!! On Sep 5, 10:24 am, Hawston LLH <haws...@gmail.com> wrote: > 1. start from top to bottom, left to right, check each cell one by one. If > current location is already labelled, then label the locations stored > previously in the path with that label. Then clear the path vector and > continue step 1. > 2. otherwise, check north, west, east, south neighbour and get the minimum > location (x_min, y_min) > 3a. if min location is different from current location, then push/store > current location into the path vector and proceed to step 1 with the min > location. > 3b. otherwise, meaning current location is a sink, label it with next > char C' and also label all locations stored previously in the path vector > with C'. > > On Fri, Sep 4, 2009 at 7:37 PM, CodeJunky <pure.vintage....@gmail.com>wrote: > > > > > Can anyone please explain me the water shed problem and the graph > > approach --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to this group, send email to google-code@googlegroups.com To unsubscribe from this group, send email to google-code+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/google-code?hl=en -~----------~----~----~----~------~----~------~--~---
