SIT221: Data Structures and Algorithms - Practical Task 9.1 & 9.2

This document provides solutions to the SIT221 Data Structures and Algorithms assignment, addressing two practical tasks. Task 9.1 focuses on the single-source shortest path problem, demonstrating Dijkstra's algorithm and analyzing the impact of edge weight changes. It includes the application of Dijkstra's algorithm to a given graph and a discussion on the Bellman-Ford algorithm. Task 9.2 delves into the minimum spanning tree (MST) problem, exploring Kruskal's and Prim's algorithms. The solution includes a detailed explanation of both algorithms, their time complexities, and their application to a provided undirected graph using both algorithms. The document also includes a worked example using Prim-Jarnik's algorithm and Kruskal's algorithm to find the MST for specific graphs, showing the step-by-step process and the final MST structure.