Assignment 3 — Minimum Spanning Tree (Software Fundamentals)

Compile all files together: g++ -std=c++17 -O2 -Wall *.cpp -o mst

Run: ./mst

Input format: n×n cost matrix (-1 for no edge, 0 on diagonal) Output: MST edges for Prim and Kruskal algorithms with total cost and runtime in output.txt file.