JOIN
Get Time
forums   
Search | Watch Thread  |  My Post History  |  My Watches  |  User Settings
View: Flat  | Threaded  | Tree
Previous Thread  |  Next Thread
Dynamic Programming: From novice to advanced | Reply
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=dynProg

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...
Subject Author Date
Dynamic Programming: From novice to advanced Blackwizard Aug 7, 2012 at 11:18 AM EDT
Re: Dynamic Programming: From novice to advanced buda Aug 27, 2012 at 7:27 AM EDT
Re: Dynamic Programming: From novice to advanced Blackwizard Aug 27, 2012 at 1:41 PM EDT
Re: Dynamic Programming: From novice to advanced Auston Mar 8, 2014 at 1:57 PM EST
Re: Dynamic Programming: From novice to advanced MauricioC Mar 8, 2014 at 7:06 PM EST
RSS