19.2.1. Dijkstra’s Algorithm

Try these first

1. 1.

   What is Dijkstra's Algorithm used for?

   Hint

   Consider what Dijkstra's focuses on when traversing graphs.

2. 2.

   Explain the meaning of a 'greedy algorithm.'

   Hint

   Think about how it approaches problems.

3. 3.

   What is the main objective of Dijkstra's Algorithm?

   • To find the shortest path in a graph
   • To find the minimum spanning tree
   • To traverse all vertices

   Hint

   Think about the name and its purpose.

4. 4.

   True or False: Dijkstra's Algorithm can handle graphs with negative weight edges.

   • True
   • False

   Hint

   Reflect on properties of algorithms regarding edge weights.

5. 5.

   Given a weighted graph structure, construct a complete Dijkstra’s Algorithm execution to find all shortest paths from a designated starting vertex.

   Hint

   Track the path selection visually.

6. 6.

   Work on modifying Dijkstra’s Algorithm to handle specific scenarios, like graphs with varying degrees of node connectivity.

   Hint

   Consider the implications of not all nodes being reachable.