Shortest paths from a source in weighted graph with only one negative weighted edge Of course assuming there aren't any negative cycles.
I saw this question somewhere. And i saw a complicated solution which says to build three such graphs and connect between them in a very  complicated manner.
My question is why isn't my simple solution good for it?
My simple solution is to first find the negative edge . And then start traversing from that edge with dijkstra.
 I think once you start with that edge, dijextra should work.
So that way i mange it in O(e + vlogV) . So why isn't my easy solution mentioned there. Is my solution correct?
No. The negative edge will not always be part of the shortest path. For example, in the digraph

A &lt;==[+1]== B ==[+4]==> C ==[-1]==> D ==[+4]==> E

the shortest path departing from B is the path from B to A, and does not include the negative edge (C,D). 

Even when the negative edge is part of the shortest path, it won't necessarily be the first edge of the path.