remove 1 link from shortest path one by one to find the second shortest Best Regards Ashish Goel "Think positive and find fuel in failure" +919985813081 +919966006652
On Thu, Dec 8, 2011 at 1:56 AM, Aniket <aniket...@gmail.com> wrote: > 1. How to find second shortest path from a source to a target? > (Modification of dijkstras algo to store second best in the node when > the node is the target would suffice I think, But any other way?) > > 2. How to find the second best MST for a graph? > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@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. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@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.
