Num #1

In class, we saw that Dijkstra's Algorithm correctly finds a shortest s-t path in weighted graphs so long as all edge costs are non-negative, ce 0 for all e. Draw an example graph with one or more negative edge weights on which Dijkstra's Algorithm will fail to find a shortest s-t path. (Hint: there are some pretty easy examples.) Explain what the actual shortest path would be, and which path Dijkstra's Algorithm finds