hi everyone.
i need to find all possible paths for directed graph with dynamic programming.
let me clarify. i have a path from 1 to n and this is a straight line. every line has a value. i need a way where the cost is smallest. i take inputs as 2 dimensional array (a[j]) and i <= j.

....A..B..C..D
A..0..2..5..9
B......0..6..7
C..........0..5
D..............0

this is an example of inputs. i want to go D from A. its same for different n numbers.

A---B---C---D

Can you help me to find the dynamic programming algorithm.

whenever you want you can send me a e-mail or write under this topic
my email address is: lordofdarkness1903@yahoo.com.tr

i have a path from 1 to n and this is a straight line. every line has a value. i need a way where the cost is smallest.

That's the shortest path problem; for any single source and/or destination, you'll probably want to use Dijkstra's algorithm.