You will have to add logic to your program to detect CCCs (circular sub-paths), bridge nodes (if any) and the number of CCCs a bridge node connects. After this, keep on subtracting the visits to bridge node from the number of CCCs it connects; when this becomes zero, it means that now the node can not be re-visited.
On Mon, Nov 22, 2010 at 4:07 PM, <[email protected]<google-code%[email protected]> > wrote: > Today's Topic Summary > > Group: http://groups.google.com/group/google-code/topics > > - Weighted Cyclic Directed Graph <#12c73293407120e6_group_thread_0> [3 > Updates] > > Topic: Weighted Cyclic Directed > Graph<http://groups.google.com/group/google-code/t/6b2aa62e9e9549fb> > > > > > Sakthi Priyan <[email protected]> Nov 22 02:07PM +0530 > ^<#12c73293407120e6_digest_top> > > I am sorry. I didn't explain my problem clearly at first shot. > > It goes like this > > Assume there are five nodes in a graph. I am giving the Adjacency > Matrix > here. > > 1 2 3 4 5 > 1 0 1 1 1 1 > 2 1 0 1 0 0 > 3 1 1 0 0 0 > 4 1 0 0 0 1 > 5 1 0 0 1 0 > > Now I need to visit all the nodes with minimum weights crossed. This is > the > problem :( > > Here we have two closely connected components (CCC), 123 and 145. And > node 1 > acts like a bridge between those CCC. If I enter any of those CCC, I > need to > touch node 1 again to reach the other. So, if I mark node 1 as visited > at > first, the program will start from 1 and lets say it touches 2 and then > it > ll touch 3. From 3, it has to go to 1 and by that time node 1 is marked > as > visited. So program 'll halt there and 'll give wrong result. > > Please suggest... > > > On Mon, Nov 22, 2010 at 9:52 AM, vineel yalamarth < > > -- > - Thanks and Regards, > > *Sakthipriyan* > > > > -- > You received this message because you are subscribed to the Google Groups > "google-codejam" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<google-code%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/google-code?hl=en. > -- You received this message because you are subscribed to the Google Groups "google-codejam" 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/google-code?hl=en.
