Use Dijkstra's Algorithm to find the

shortest path from vertex $G$ to all

other vertices in the given graph.

List the order of the vertices here:

What is the sum of the weights of the

shortest path?

Use Dijkstra's Algorithm to find the shortest path from vertex $D$ to all other vertices in the same graph

above.

List the order of the vertices here:

What is the sum of the weights of the shortest path?

Apply Prim's algorithm to the construct a minimal spanning tree for the given weighted graph at the

bottom of the page. Start at vertex A and list the vertices in the order they are chosen. What is the weight of

the spanning tree?

I've seen different results and ways to do itfrom this problem. I want to know $($besides the answer and help$)$ if the way I$\text{'}$m thinking is correct. Dijkstra Algoritghm is based on the Smallest "PATH" or also know as find the smallest label form the pointet adjencent in this case G$.$ I would say$($the most logical at first$)$ G$-$ H $=25,$ but that not the smallest label from the adjancents of G$,$the correct path and smallest label and "Path" would G$-$I$-$H$.$ Maybe I$\text{'}$m just very confused from all the answers that they are. Thanks.