The Floyd-Warshell algorithm is an algorithm for finding the shortest paths in a weighted graph with positive or negative edge weights.

In this post, the author will consider the implementation of the algorithm in C#.