# What is the Bellman-Ford equation?

## What is the Bellman-Ford equation?

1. Bellman-Ford detects negative cycles, i.e. if there is a negative cycle reachable from the source s, then for some edge (u, v), dn-1(v) > dn-1(u) + w(u, v). 2. If the graph has no negative cycles, then the distance estimates on the last iteration are equal to the true shortest distances.

**What is the difference between Kruskal and Bellman-Ford algorithm?**

Dijkstra’s algorithm is very similar to Prim’s algorithm for minimum spanning tree….What are the differences between Bellman Ford’s and Dijkstra’s algorithms?

Bellman Ford’s Algorithm | Dijkstra’s Algorithm |
---|---|

It can easily be implemented in a distributed way. | It can not be implemented easily in a distributed way. |

**Is Dijkstra’s greedy?**

Dijkstra Algorithm is a graph algorithm for finding the shortest path from a source node to all other nodes in a graph(single source shortest path). It is a type of greedy algorithm.

### When did Bellman-Ford fail?

If there are negative cycles (reachable from the source), Bellman-Ford can be considered to fail.

**What is Bellman-Ford algorithm used for?**

Bellman Ford algorithm helps us find the shortest path from a vertex to all other vertices of a weighted graph. It is similar to Dijkstra’s algorithm but it can work with graphs in which edges can have negative weights.

**Is Kruskal and Dijkstra the same?**

The basic difference, I would say, is that given a set of nodes, Dijkstra’s algorithm finds the shortest path between 2 nodes. Which does not necessarily cover all the nodes in the graph. However on Kruskal’s case, the algorithm tries to cover all the nodes while keeping the edge cost minimum.

#### Why do we use Kruskal algorithm?

Kruskal’s Algorithm is used to find the minimum spanning tree for a connected weighted graph. The main target of the algorithm is to find the subset of edges by using which we can traverse every vertex of the graph.

**Is Dijkstra A DFS?**

DFS keeps jumping along nodes until it finds a path, While Dijkstra is more similar to a BFS except it keeps track of weights (not all paths have equal cost) and will keep checking the shortest path not already checked until it gets to the target.