my approach is like this remove any 1 edge from the graph and now find shortest path b/w reqd pts without this edge. store the shortest path in some variable now restore the removed edge and remove some other edge and again find shortest path. if this is shorter than prev stored value then update that else ignore do this for all edges ie remove all edge one by one at a time n compare the shortest path with the value stored in the variable at end that variable wil giv u shortest path i think there must b more efficient soln hope m clear this time
On 28 June 2010 23:11, sharad kumar <sharad20073...@gmail.com> wrote: > @divya > plzzz elaborate ur approach a bit more...i didnt get u > > -- > 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.
