Posts
Showing posts from April, 2020
MultiStage Graph:Dynamic Programming approach
- Get link
- Other Apps
calculate step: Bcost(3,j) Bcost (3, 6) = min {Bcost (2, 2) + c (2, 6), Bcost (2, 3) + c (3, 6)} = min {Bcost (2, 2) + 4, Bcost (2, 3) + 2} =min{ 9+4,7+2}= 9 l min(3, 6) = 3 Bcost (3, 7) = min {Bcost (2, 2) + c (2, 7), Bcost (2, 3) + c (3, 7)} = min {9 + 2, 7 + 7, 2 + 11} = min {11, 14, 13} = 11 l min(3, 7) = 2 Bcost (3, 8) = min {Bcost (2, 2) + c (2, 8), Bcost (2, 4) + c (4, 8), Bcost (2, 5) + c (5, 8)} = min {9 + 1, 3 + 11, 2 + 8} = min {10, 14, 10} = 10 l min(3, 8) = 2 calculate step: Bcost(4,j) Bcost (4, 9) = min {Bcost (3, 6) + c (6, 9), Bcost (3, 7) + c (7, 9)} = min {Bcost (3, 6) + 6, Bcost (3, 7) + 4} = 15 l min(4, 9) = 6 Bcost(4,10)= min { Bcost (3, 6) + c (6, 10),,Bcost (3, 7) + c (7, 10), Bcost (3, 8) + c (8, 10)} = min {9 + 5, 11 + 3, 10 + 5} = min {14, 14, 15) = 14 l min(4, 10) = 7 Bcost (4, 11) = min {Bcost (3, 8) + c (8, 11)} = min {Bcost (3, 8) + 6
PRIM'S ALGORITHM EXAMPLE SOLUTION:REFER VIDEO FOR EXPLANATION
- Get link
- Other Apps
KRUSKAL'S ALGO EXAMPLE SOLUTION: REFER VIDEO FOR EXPLANATION
- Get link
- Other Apps
CLICK HERE: GREEDY METHOD AND COIN CHANGE PROBLEM
- Get link
- Other Apps
CLICK HERE :Divide And Conquer Substitution method
- Get link
- Other Apps
TOPOLOGICAL SORTING PART2 SOURCE REMOVAL METHOD
- Get link
- Other Apps