ขั้นตอนวิธีของฟลอยด์-วอร์แชล

Also known as Warshall–Floyd Algorithm

algorithm for finding all-pairs shortest paths in graphs, allowing some edge weights to be negative