I've read this toutorial but I have a problem with the practice problem in the elementary section.
Here is the problem statement:
"Given an undirected graph G having N (1<N><=1000) vertices and positive weights. Find the shortest path from vertex 1 to vertex N, or state that such path doesn't exist. "
Please help me to understand the problem statement and then introduce me a DP solution to solve it!
Thanks a lot...