and 5 others joined a min ago.
0
2.7kviews
Find a minimum cost path from 1 to 9 in a given graph using dynamic programming.
1 Answer
0
91views
written 7.8 years ago by
teamques10
★ 65k
|
We will assume that the source vertex is 1 and it will have distance 0. Initialize all distance as infinite, except the distance to source itself.
Step 1:
| K | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 0 | 5 | 2 | ∞ | ∞ | ∞ | ∞ | ∞ | ∞ |
Step 2: …
and 3 others joined a min ago.
ADD COMMENT
EDIT
Please log in to add an answer.