2 Answer this question on the insert provided.
- Use Dijkstra's algorithm to find the least weight route from \(A\) to \(G\) in the network shown in Fig. 2.1. Show the order in which you label vertices, give the route and its weight.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{b9ee9306-18ca-42b3-9f2e-b23849374b5e-3_458_584_525_760}
\captionsetup{labelformat=empty}
\caption{Fig. 2.1}
\end{figure} - Fig. 2.2 shows a partially completed application of Kruskal's algorithm to find a minimum spanning tree for the network.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{b9ee9306-18ca-42b3-9f2e-b23849374b5e-3_421_533_1307_779}
\captionsetup{labelformat=empty}
\caption{Fig. 2.2}
\end{figure}
Complete the algorithm and give the total weight of your minimum spanning tree.