Any approach to solve this problem. As expected making dfs calls from every vertex results in TLE

Thanks in advance!

Hello Codeforces,

When will the problems for Tech Scouts Online Test Group 2018 held today will be available to practice. The questions were indeed very interesting.

Hello Codeforces!,

We already have a algorithm to find all pairs shortest path in a weighted graph.This solution depends on dynamic programming ideas and hence utilizes one/two 2-D matrices.But I wonder what would be the approach if the number of vertices increased to say 10^4 or maybe as large as 10^6. Thanks in Advance!!

Hello Codeforces community,

I have been trying to improve myself in competitive programming for last 3-4 months,but the progress haven't been so impressive. As I came to know that practice can only help me out,I'm trying constantly to improve.But at a certain point I feel that require some resources which might prove handy and guidinig as well.It will be very helpful if you suggest me some materials to prepare.:-)

Thanks in advance!