title: Dijkstra's algorithm on directed acyclic graph with negative edges
body: <p>Will Dijkstra's algorithm work on a graph with negative edges if it is acyclic (DAG)? I think it would because since there are no cycles there cannot be a negative loop. Is there any other reason why this algorithm would fail?</p>
  
  <p>Thanks [midterm tomorrow]</p>