Do a depth-first search of the graph from origin to destination and keep track of the shortest two paths that you find.
Dave On Jun 27, 1:10 pm, sharad kumar <sharad20073...@gmail.com> wrote: > How to find the second shortest path in 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 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.
