How to read algorithms 1 – Floyd-Warshall

I had talk with one of my friends the other day because he wanted to get some pathfinding going for his algorithm. I often find, that a lot of people feel, that in this scenario the best choice for an algorithm is obviously A*, because that’s the fastest and best, right? Well, I showed him the Floyd-Warshall algorithm, but I quickly realized, that people writing the algorithms down and people implementing them speak a very different language. Continue reading “How to read algorithms 1 – Floyd-Warshall”