27.1.4. Week- 04

Try these first

1. 1.

   What does Dijkstra's algorithm aim to find?

   Hint

   Think about the routes in a graph.

2. 2.

   Is Dijkstra's algorithm applicable for graphs with negative weight edges?

   Hint

   Recall what happens with negative cycles.

3. 3.

   What type of algorithm is Dijkstra’s?

   • Greedy
   • Dynamic Programming
   • Brute-force

   Hint

   Recall the characteristics of Dijkstra's strategy.

4. 4.

   Is it true that Dijkstra's algorithm can handle negative weights?

   • True
   • False

   Hint

   Think about the implications of negative paths.

5. 5.

   Create a graph with vertices and edges, some with negative weights and demonstrate Dijkstra's failure.

   Hint

   Be sure to showcase a path where earlier choices seem optimal.

6. 6.

   Explain how the use of a heap impacts the efficiency of Dijkstra's algorithm.

   Hint

   Think about the performance impact on large datasets.