0 votes 0 votes For a directed graph with positive wights on edges , bellmann ford runs faster than single source shortest path true or false? A_i_$_h asked Aug 26, 2017 A_i_$_h 268 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply joshi_nitish commented Aug 26, 2017 reply Follow Share false, Bellman ford runs in O(VE), whereas shortest path(dijkstra) runs in O(ElogV) clearly Bellman ford is slower than Dijkstra. 0 votes 0 votes Rishabh Gupta 2 commented Aug 26, 2017 reply Follow Share Bellman Ford is itself a single-source-shortest path algorithm. And can calculate shortest paths even if there are negative weights(but no negative weight cycles). But Dijkstra's algo is better when graph doesn't contain negative weights. 0 votes 0 votes Please log in or register to add a comment.