Dijkstra's Algorithm to solve the Shortest Path Problems - 2
optimized-with-heap version:
algorithm description:
Suppose set S is a set of all vertices whose shortest path (SP) have already been determined.
initialize 0th vertex's distance to 0, others' to positive infinite(same as naïve version);
insert 0t...
jinianluo.hashnode.dev3 min read