enter image description here
we were given:-
-A graph(weighted & directed)
-integer k
-source & destination nodes
and we were told to find find the shortest path from the source to the target node if you are allowed to make up to k edge weight as 0.
an example graph is given like this.