โ† Microsoft questions

All pairs shortest distance

Filed under Microsoft

Given a weighted graph represented as an adjacency matrix of distances between stations, find the shortest paths between all pairs of vertices using the Floyd-Warshall algorithm.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Microsoft questions

Collected from public candidate posts and coding forums. Updated Nov 2026.