Feb. 21, 2014, 4:24 p.m. by Rosalind Team
Topics: Graphs
The task is to use Dijkstra's algorithm to compute single-source shortest distances in a directed graph with positive edge weights.
Given: A simple directed graph with positive edge weights from
Return: An array
See Figure 1 for visual example from the sample dataset.
6 10 3 4 4 1 2 4 1 3 2 2 3 3 6 3 2 3 5 5 5 4 1 3 2 1 2 4 2 2 5 3
0 3 2 5 6 -1