You are given a weighted directed graph of n nodes and e edges, source vertex and destination vertex
For each edge , output the shortest path between source and destination (-1 if not possible) if that edge is made bi-directional and it's weight is set to 0
n is probably 1e5

Any help would be highly appreciated