In pseudocode please

Problem 4: The single destination shortest path problem is as follows: Sup- pose that we are given a directed graph with positive edge weights. Given a target node t, we want to find the length of the shortest path to t from every other node in the graph. The output should be an array A, where Ali] tells us the length of the shortest path from node i to node t. Create an efficient algorithm to calculate this