Page 2 of 2
Posted: Sun Oct 24, 2004 6:41 pm
by david
What reference do you need? Isn't slightly modified Dijkstra (with counting the k-th shortest path to all the verticles) good enough?
No, it isn't. It is not inmediately clear how to deal with zero-length cycles.
Posted: Mon Oct 25, 2004 1:30 am
by Krzysztof Duleba
I don't really get what's wrong with zero-length circuits. You should visit a verticle only if it's k-th shortest path from the source isn't already known. So if you have zero-length circuit, you should take it at most k times.
Posted: Tue Feb 22, 2005 2:37 am
by Monsoon
Hi,
could anyone give more test cases to check my program...,
is there exist any special test case?
TIA.
Posted: Tue Feb 22, 2005 3:08 pm
by Monsoon
thx, i found my mistake...
10740 "Not The Best" ...Please Inputs!!!
Posted: Fri Apr 15, 2005 11:57 pm
by chuzpa
I removed my code :$, It has been long enogh here haha, enjoy the problem ..
hi there...
Posted: Sat Apr 23, 2005 7:40 pm
by chuzpa
Hi nobody answered me ... :s hahaha but it is accepted now ....
Posted: Mon Nov 19, 2007 5:08 pm
by ImLazy
I use the
MPS algorithm introduced in the article
The K shortest paths problem from
this page. It's fast.
Re: 10740 - Not the Best
Posted: Thu May 29, 2014 1:40 pm
by prashantharshi
using algo similar to bellman ford and heap
http://ideone.com/WuY91C
getting WA
need help
Re: 10740 - Not the Best
Posted: Wed Jun 11, 2014 11:28 pm
by brianfry713
Try using a modified Dijkstra's algorithm.