By madcannibal, history, 6 years ago,

Can be a rule there to transform the Top-Down to Bottom-Up ?

• -5

 » 6 years ago, # |   +8 ?????
 » 6 years ago, # |   +9 You need to be more specific to get a definitive answer.Generally though, dynamic programming is essentially traversing a directed graph of states (vertices) and dependencies between them (arcs). It depends on the problem whether it is feasible to, looking at a certain state, list all incoming edges, or all outgoing edges, or both.
•  » » 6 years ago, # ^ | ← Rev. 2 →   0 I think I understand him, I think he needs some tips to transform Top-Down recursive with memoization dynamic programming to Bottom-Up with loops!