Explore BrainMass

dynamic programming

Consider the graph in the attachment.

Use dynamic programming to find the longest path from node 1 to node 7.
What are the states and stages?
What is the recursive function?

© BrainMass Inc. brainmass.com June 24, 2018, 6:24 pm ad1c9bdddf


Solution Summary

This solution reiterates dynamic programming.