title: confusion about dijkstra algorithm?
body: <p>According to the Algorithms book <em>Corman</em>, Dijkstra is applicable for only those graphs whose all edges have non negative weights.
  Does that mean, if there is any edge with negative weight it will not work for whole of the graph?
  or
  Will it not count that negative weight edge?
  Please indicate which one is right?</p>