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 came across problems on codeforces and uva online judge, with the implementation of the algorithm.

links -

Greg and Graph, codeforces.

Geonosis, UVA online judge.

Can anyone please help me with the solution? Why do we add all the vertices backwards and not remove them in the order given to us . Is it because of the time complexity will reach O(n^4)?

please forgive me if I said something wrong, I'm just trying to learn my way through.

thanks in advance ^-^