10740 - Not the Best

david · Post by **david** » Sun Oct 24, 2004 6:41 pm

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.

Krzysztof Duleba · Post by **Krzysztof Duleba** » Mon Oct 25, 2004 1:30 am

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.

Monsoon · Post by **Monsoon** » Tue Feb 22, 2005 2:37 am

Hi,
could anyone give more test cases to check my program...,
is there exist any special test case?

TIA.

Monsoon · Post by **Monsoon** » Tue Feb 22, 2005 3:08 pm

thx, i found my mistake...

chuzpa · Post by **chuzpa** » Fri Apr 15, 2005 11:57 pm

I removed my code :$, It has been long enogh here haha, enjoy the problem ..

chuzpa · Post by **chuzpa** » Sat Apr 23, 2005 7:40 pm

Hi nobody answered me ... :s hahaha but it is accepted now ....

ImLazy · Post by **ImLazy** » Mon Nov 19, 2007 5:08 pm

I use the MPS algorithm introduced in the article The K shortest paths problem from this page. It's fast.

prashantharshi · Post by **prashantharshi** » Thu May 29, 2014 1:40 pm

using algo similar to bellman ford and heap
http://ideone.com/WuY91C
getting WA

need help

brianfry713 · Post by **brianfry713** » Wed Jun 11, 2014 11:28 pm

Try using a modified Dijkstra's algorithm.

OJ Board

10740 - Not the Best

10740 "Not The Best" ...Please Inputs!!!

hi there...

Re: 10740 - Not the Best

Re: 10740 - Not the Best