Your participation score for this module is based on posting an answer to the practice question below to this discussion board. Review

the information on the Graded Participation Information for more details and the Discussion Board Tips for details on using Canvas

discussion boards.

Note, there is only the one question in this module's discussion. In this module's assignment, you will be implementing Dijkstra's

algorithm $--$ so this discussion is your chance to make sure you understand how the algorithm works before trying to implement it$.$

Question $1$

Trace Dijkstra's algorithm for the graph below, starting at node SFO. Provide the following:

The graph's adjacency matrix

Trace the algorithm. In other words, for each iteration of the algorithm, provide v$,$ vertexSet, and weight$[0],$ weight$[1],$ weight$[2],$

weight$[3],$ weight$[4],$ weight$[5].$ Make sure to watch video $13\mathrm{.}6$ for an example trace $($for a different graph$).$