running time is longer longer than expected time claimed by the reference paper.... about k-shortest-paths HOT 3 OPEN

Did you try the old version without the updated header file? 
On the other hand, did you some other examples? Like using smaller size of data 
set,
or trying the queries starting from the different nodes? 

I have tried these alternatives...

1. I ran the program (Ver. 1.0.3) using different pair (70 to 420) ... same 
problem.
2. I ran the program (Ver. 1.0.3) with the older version of header file 
(QYDirectedPath.h)  from node 0 to 420...same problem.
3. I ran the older version (1.0.2) from node 70 to 420...same problem.....

for all attempts above the value of K used was 300...I stoped all programs 
after 1.5 
hours of running time...

I wonder if Authors of the paper were very optimistic!!!

I have recently tried the same experiment (v 2.0) 
*using provided test file test_500
*from node 1 to node 729

yenAlg.has_next() now returns false and I get no shortest paths, this runs very 
quickly.

The same is true from node 1 to node 7, where it is easy to trace paths by 
looking at the file.

I would like this to work for 10k nodes, I get the same results, when I try it 
with my own adjacency file.  I suspect it has something to do with scale since 
test_50 works fine.

Any ideas?