Added notes for tomorrow.

Longest path in DAGs: Negating the edge weights results in a
graph with no negative cycles. The shortest path in G' from
u to v corresponds to the longest path (also called the critical
path) from u to v in G.