Suppose given an un-directed graph $G$, such that bridge edge of $G$ has negative weight.
In graph theory, a bridge, isthmus, cut-edge, or cut arc is an edge of a graph whose deletion increases the graph's number of connected components.
Now there is a claim:
The Dijkstra find correct shortest simple-path if the bridge edge has negative weight.
I think this claim is correct, but i can't show it. Already i know that, if edges of source $s$ have negative weight, then Dijkstra can find correct shortest path.