In Microsoft campus recuitment contest, there is a problem which could use Dijkstra shortest path algorithm to solve. And I write a version whose time complexity is O(n2) in the contest, however, that makes me feel not very good. So I decide to have a good review of some ...
read moreThere are comments.