Problem: shortest path between every pair of vertices — IITM BS previous year questions

Problem: shortest path between every pair of vertices is part of All-Pairs Shortest Paths - Floyd-Warshall Algorithm, Week 11 in Mathematics 1. Prasnya files every IIT Madras BS previous year question from this subtopic here, each one with a worked explanation. Take the whole set as a timed mock and you get accuracy, pacing and per-question analysis back.