> > 123 > 456 > 789 > > the minimal path sum is 1 + 2 +3 + 6 + 9 = 21
Looks like a shortest path problem in a weighted graph. Represent the numbers as the weights of edges in the graph. Each node will have two child nodes - one going right and one going down. Once you construct a graph, apply Dijkstra's algorithm from the starting node. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups-beta.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
