Hello everyone,I hope you all are in good health. So, i was recently studying graphs and started with the Floyd-Warshall algorithm. I am pretty new to this, and this would be my first implementation of the respective algorithm. I can across a problem on codeforces and uva online judge. links - Greg and Graph Geonosis Can anyone please help me with the explanation if the fact, why we add the vertices backwards and why doesn't removing the vertices in the order give us the right answer? thanks in advance ^-^