In general, Dijkstra's Algorithm fails on graphs with negative edges. However, consider running Dijkstra's Algorithm beginning at the only node with negative outgoing edges in the directed graph (all edges not leaving the start node are guaranteed to be positive). Assuming there are no negative cycles, either prove that Dijkstra's Algorithm functions correctly on all such graphs or provide an example graph where it fails.