Question 3

Let G= (V,E,w) weighted, directed graph, A V and:

x,y V-A.

Build an efficient algorithm to find the minimum weight of a track oriented from x to y which:

(A) Passes through nodes of A.

(B)Does not pass through the nodes of A.