Find a minimum cost path from 3 to 2 in the given graph using dynamic programming.

1. An edge-weighted graph is a graph where we associate weights or costs with each edge.
2. A minimum cost path of an edge-weighted graph is a spanning tree whose weight (the sum of the weights of its edges) is no larger than the weight of any other spanning tree.
3. Problem

Sr.No	Step No. executed	Edges Considered	Edges Selected	Cost	Spanning Tree
1	1	-	-	-
2	1	(3,4),(3,5)	(3,4)	3
3	2	(4,5)(4,2)	(4,5)	5
4	3	(5,2)	(5,2)	10
5	4	-	-	-	Stop

Hence, from the above table the minimum cost path from node 3 to node 2 is 3452 with minimum cost of 10.