26.1.7. Algorithm Execution

Try these first

1. 1.

   What defines a weighted graph?

   Hint

   Think about graphs with costs.

2. 2.

   What is the purpose of a weight function?

   Hint

   Consider what each edge's cost might represent.

3. 3.

   What is a weighted graph?

   • A graph with equal weights
   • A graph with edges having varying costs
   • A graph without edges

   Hint

   Consider graph definitions.

4. 4.

   Dijkstra's algorithm is used for which type of problems?

   • True
   • False

   Hint

   Recall the function of Dijkstra's algorithm.

5. 5.

   In a weighted graph representing a city's transport network, calculate the shortest path from vertex A to vertex D, detailing all steps of Dijkstra's algorithm.

   Hint

   Keep track of distances and vertices processed.

6. 6.

   Design a weighted graph to simulate a delivery context and articulate how Dijkstra's algorithm would find the optimal delivery route.

   Hint

   Model real delivery costs.