Prim's algorithm is a greedy algorithm that finds an MST problem for a connected weighted undirected graph. It finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized.
Prim's algorithm is given as follows:
const INF = Number.MAX_SAFE_INTEGER;const prim = graph => { const parent = []; const key = []; const visited = []; const { length } = graph; for (let i = 0; i < length; i++) { // {1} key[i] = INF; visited[i] = false; } key[0] = 0; // {2} parent[0] = -1; for (let i = 0; i < length - 1; i++) { // {3} const u = minKey(graph, key, visited); // {4} visited[u] = true; // {5} for (let v = 0; v < length; v++) { if (graph[u][v] && !visited[v] && ...
