I just thought about something.
If I want to find shortest path between A and B with negative edges, but no negative cycle.
How about we start Dijkstra with source A and then with source B and return the minimum of the two results.
I was thinking and I cannot find a counter-example.
Any ideas?