Quiz: Dijkstra’s algorithm

../_images/q1-q8.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 5 be the start node and 7 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q1-q8.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 4 be the start node and 5 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q1-q8.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 2 be the start node and 6 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q1-q8.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 8 be the start node and 2 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q1-q8.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 3 be the start node and 7 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q1-q8.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 2 be the start node and 5 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q1-q8.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 6 be the start node and 2 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q1-q8.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 7 be the start node and 6 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q9-q13.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 6 be the start node and 4 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q9-q13.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 7 be the start node and 5 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q9-q13.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 6 be the start node and 1 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q9-q13.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 6 be the start node and 2 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q9-q13.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 7 be the start node and 0 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q14-q20.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 2 be the start node and 8 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q14-q20.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 7 be the start node and 5 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q14-q20.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 6 be the start node and 7 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q14-q20.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 5 be the start node and 7 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q14-q20.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 0 be the start node and 7 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q14-q20.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 2 be the start node and 5 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q14-q20.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 6 be the start node and 8 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q21-q30.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 7 be the start node and 3 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q21-q30.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 5 be the start node and 7 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q21-q30.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 4 be the start node and 3 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q21-q30.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 2 be the start node and 3 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q21-q30.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 3 be the start node and 6 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q21-q30.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 6 be the start node and 3 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q21-q30.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 3 be the start node and 7 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q21-q30.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 8 be the start node and 7 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q21-q30.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 7 be the start node and 1 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q21-q30.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 2 be the start node and 8 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q31-q37.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 5 be the start node and 7 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q31-q37.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 8 be the start node and 4 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q31-q37.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 2 be the start node and 7 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q31-q37.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 8 be the start node and 6 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q31-q37.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 6 be the start node and 8 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q31-q37.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 7 be the start node and 8 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q31-q37.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 2 be the start node and 8 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q38-q40.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 7 be the start node and 8 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q38-q40.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 4 be the start node and 8 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q38-q40.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 5 be the start node and 7 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q41-q49.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 7 be the start node and 0 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q41-q49.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 1 be the start node and 6 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q41-q49.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 6 be the start node and 7 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q41-q49.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 1 be the start node and 4 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q41-q49.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 8 be the start node and 6 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q41-q49.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 6 be the start node and 8 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q41-q49.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 7 be the start node and 6 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q41-q49.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 4 be the start node and 1 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q41-q49.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 6 be the start node and 1 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q50-q55.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 4 be the start node and 8 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q50-q55.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 5 be the start node and 7 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q50-q55.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 4 be the start node and 7 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q50-q55.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 8 be the start node and 4 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q50-q55.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 6 be the start node and 1 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q50-q55.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 6 be the start node and 5 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q56-q57.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 5 be the start node and 4 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q56-q57.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 4 be the start node and 1 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q58-q60.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 8 be the start node and 6 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q58-q60.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 7 be the start node and 6 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

../_images/q58-q60.png

Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes. Each edge is labeled with its cost. Let 6 be the start node and 8 be the goal node. Run Dijkstra’s algorithm on G. What is the total cost of the path from start to goal?

Posting submission...