Dijkstra’s algorithm

Question 1

What is Dijkstra’s algorithm?

Answer 1

It’s a graph algorithm that find the fastest solution

Question 2

How does Dijkstra’s algorithm works?

Answer 2

Dijkstra’s algorithm:
1. Find the “cheapest” node. This is the node you can get to in the least amount of time.
2. Update the costs of the neighbors of this node.
3. Repeat until you’ve done this for every node in the graph.
4. Calculate the final path.

Question 3

What is weight in Dijkstra’s algorithm?

Answer 3

It’s the number that associated with the edge
A graph with weights is called a weighted graph. A graph without weights is called an unweighted graph.

Question 4

How to calculate path in graphs?

Answer 4

To calculate the shortest path in an unweighted graph, use breadth-first search. To calculate the shortest path in a weighted graph, use Dijkstra’s algorithm.

Question 5

Can we use negative weight edges with Dijkstra’s algorithm?

Answer 5

No