26.1.4. Total Cost Calculation

Try these first

1. 1.

   Define a weighted graph.

   Hint

   Refer to the document where the term 'weighted graphs' is defined.

2. 2.

   What does the term 'cost' refer to in the context of graphs?

   Hint

   Think about real-life scenarios like travel costs.

3. 3.

   What defines a weighted graph?

   • Edges have costs
   • All edges are equal
   • Vertices are connected

   Hint

   Think of real-world applications like transportation.

4. 4.

   Dijkstra's algorithm is used for what purpose?

   • True
   • False

   Hint

   Remember its application in real-world scenarios.

5. 5.

   Given a weighted graph with specific edges and weights, apply Dijkstra's algorithm to determine the shortest path from vertex A to vertex D. Show each step of your calculations.

   Hint

   Be meticulous with edge weights during updates.

6. 6.

   Create a scenario in which a decision must be made between a path with many edges and a path with higher costs but fewer edges. Justify your conclusion.

   Hint

   Consider tolls vs. free roads in transportation.