Question

Negative weight edges are allowed in which algorithm

Answer 1

Answers. Dijkstra relies on one "simple" fact: if all weights are non-negative, adding an edge can never make a path shorter. ... For a simple case, consider the graph with vertices { a , b , c } and edges { a b , b c , a c } , where and have length and has length .Aug