title: Why doesn't Dijkstra's algorithm work for negative weight edges?
body: <p>Can somebody tell me why Dijkstra's algorithm for single source shortest path assumes that the edges must be non-negative. </p>
  
  <p>I am talking about only edges not the negative weight cycles.</p>