Re: [algogeeks] Second shortest

2012-12-05 Thread linux . shivashis
K-shortest path algorithm. Thanks --Original Message-- From: Don Sender: algogeeks@googlegroups.com To: Algorithm Geeks ReplyTo: algogeeks@googlegroups.com Subject: [algogeeks] Second shortest Sent: Dec 5, 2012 4:36 PM Describe the algorithm to find the second shortest path from one

[algogeeks] Second shortest

2012-12-05 Thread Don
Describe the algorithm to find the second shortest path from one point to another in a weighted graph. --

Re: [algogeeks] Second shortest path

2011-12-08 Thread MeHdi KaZemI
Finding the second best MST is one of the CLRS exercises, each time remove an edge from the MST and try to find another MST, minimum among these trees is the second best MST. On Thu, Dec 8, 2011 at 2:18 AM, Ashish Goel wrote: > remove 1 link from shortest path one by one to find the second short

Re: [algogeeks] Second shortest path

2011-12-07 Thread Ashish Goel
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 wrote: > 1. How to find second shortest path from a source to a target? > (Modification

[algogeeks] Second shortest path

2011-12-07 Thread Aniket
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 subs

Re: [algogeeks] second shortest path

2010-07-02 Thread Amir hossein Shahriari
we can do this in a much better time than divya's algorithm since he does the shortest path algorithm E+1 times here's my approach: find the shortest path using dijkstra since in dijkstra we have the shortest path to each vertex now look at the edges that end at the destination if the shortest pat

Re: [algogeeks] second shortest path

2010-06-30 Thread sharad kumar
@divya thnx for d detailed explaination...now its clear 2 me...nice approach -- 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 algog

Re: [algogeeks] second shortest path

2010-06-30 Thread divya jain
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 t

Re: [algogeeks] second shortest path

2010-06-28 Thread sharad kumar
@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..

Re: [algogeeks] second shortest path

2010-06-28 Thread divya jain
keep on removing one edge at a time n find the shortest path.. the shortest path of all these paths is the ans.. On 27 June 2010 23:40, sharad kumar wrote: > How to find the second shortest path in a graph? > > -- > You received this message because you are subscribed to the Google Groups > "Al

[algogeeks] second shortest path

2010-06-27 Thread sharad kumar
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...@googlegrou