finding negative cycle in a graph after adding set of edges

Vote count:

0

I have a shortest path tree problem, i.e I have a graph G(V,E), v is the set of vertices and E is the set of edges. the edges weights could be negative. In the graph G, there is no negative cycles at all even if it is not reachable from the source node. But after constructing graph G, I add another set of edges, unfortunately I got negative cycles. I am interested in knowing which edge or edges out of the new edges caused the existence of the negative cycles.

asked 58 secs ago

user1514730

6