Is this your company?
Given several cities and their mutual distance, find an algorithm to find the minimum time to spread a message throughout all cities.
Anonymous
Dijkstra's algorithm will make more sense
Check out your Company Bowl for anonymous work chats.