Given an array that holds the minimum cost to get from a starting point to each vertex in the directed graph. Now, there obviously can be many "shortest paths" in
