very very nice blog! very well explained algorithms and codes are just as they should be, near, compact, and unbloated! please , pleaase keep on writing! =)

This is a fantastic blog, a shame you do not keep it updated anymore. I’m working on some parallel shortest-path problems, and your blog has been extremely helpful.

Gotta say, this blog has gotta be the best place to go to for graph algorithm implementations and explanations!

Just got into graph theory and trying to understand how some algorithms work and how they can be implemented is hard when you’ve got little resources, no money and a weak math background :P Introduction to Algorithms confused me with all it’s proofs and other places don’t explain stuff.

So thanks for all the great posts, going to read up on the Knapsack problem next :) And Langton’s Ant was interesting :P

A shame to see that you’ve long since stopped posting. Anyways, thanks for all the useful stuff and hope you start posting stuff again, I’ll be watching out in hope ;)

I look for an efficient all pairs Kth shortest path algorithm for a static positive-only weighted graph. Floyd-warshall calculates the shortes path, but do you know a solution to calculate the 2nd, 3rd …kth shortest path?

2008-01-15 at 15:11

Was wondering if you could help me with a knapsack problem for my online class. Thanks.

2008-01-17 at 17:13

I can try. What do you need?

2008-03-05 at 13:56

:)

2009-01-27 at 3:57

very very nice blog! very well explained algorithms and codes are just as they should be, near, compact, and unbloated! please , pleaase keep on writing! =)

2009-04-10 at 12:13

you’re doing a holy job

thanks man

2009-09-09 at 4:51

This is a fantastic blog, a shame you do not keep it updated anymore. I’m working on some parallel shortest-path problems, and your blog has been extremely helpful.

2009-11-10 at 12:09

Hello to you, can i have your email contact ?

I have read your website about the Lexicographic permutation generation algorithm.

1. Why it is largest index in the first step ?

If you loop from backward at last second element until to 0 and it is sorted, then the index will be zero.

Can you explain ?

Thanks.

2010-03-04 at 9:42

is this web still active?

2010-11-28 at 23:16

wow ! fantastic blog. i hope you’ll keep writing…

2011-02-18 at 23:32

Gotta say, this blog has gotta be the best place to go to for graph algorithm implementations and explanations!

Just got into graph theory and trying to understand how some algorithms work and how they can be implemented is hard when you’ve got little resources, no money and a weak math background :P Introduction to Algorithms confused me with all it’s proofs and other places don’t explain stuff.

So thanks for all the great posts, going to read up on the Knapsack problem next :) And Langton’s Ant was interesting :P

A shame to see that you’ve long since stopped posting. Anyways, thanks for all the useful stuff and hope you start posting stuff again, I’ll be watching out in hope ;)

2011-09-15 at 5:26

Does anyone know the name of scvalex? I used some of his code in my graduate project and would like to give him credit.

2011-10-29 at 19:25

You can find him here: http://www.abstractbinary.org/

2011-10-29 at 19:24

Really nice coding blog. It really helped me out to understand some algorithms. It’s really a pity that this blog is abandoned!

2011-11-25 at 8:11

Thanks!!! This blog rocks!

2012-05-13 at 2:58

I love ur blog….Please keep posting solutions to interesting problems…:)

2012-10-09 at 0:22

I look for an efficient all pairs Kth shortest path algorithm for a static positive-only weighted graph. Floyd-warshall calculates the shortes path, but do you know a solution to calculate the 2nd, 3rd …kth shortest path?