Aim

The aim of Prim's Algorithm is to find the Minimum Spanning Tree (MST) of a connected, weighted graph, ensuring all vertices are included with the minimum possible total edge weight.