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?