2K interview question

Given several cities and their mutual distance, find an algorithm to find the minimum time to spread a message throughout all cities.

Interview Answers

Anonymous

8 Aug 2017

Dijkstra's algorithm will make more sense

1

Anonymous

8 Aug 2017

Dijkstra's algorithm will make more sense

Anonymous

18 Feb 2012

use Prim's algorithm

2