algorithm

Question

For a directed graph with positive wights on edges , bellmann ford runs faster than single source shortest path

true or false?

Comments

false,

Bellman ford runs in O(VE), whereas shortest path(dijkstra) runs in O(ElogV)

clearly Bellman ford is slower than Dijkstra.

---

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.