← Infosys questions

Graph Coloring / Shortest Path Variation

Filed under Infosys

Given $N$ cities and a list of existing bidirectional roads. Travel between two cities connected by a road takes 1 year. Travel by air between any two non-connected cities also takes 1 year. Find the…

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 Infosys questions

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