Here is the given solution from class:

With this answer do the following:

YOUR HELP IS GREATLY APPRECIATED

Longest-Path-Value-Memoized (G, u, t, dist) if ut distlu-0 return 0 caller may expect all entries defined if dist[u] return dist[u] // this is the reuse of prior result else // dist[u] -- is not necessary as caller did it for each v in G . Adj[u] alt w(u,v) Longest-Path-Value-Memoized (G, = + v, t, dist) if dist[u]