Share
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?

Attachments

Solution Summary

This solution reiterates dynamic programming.

$2.19