(graph, key, visited)
| 1 | const INF = Number.MAX_SAFE_INTEGER; |
| 2 | |
| 3 | const minKey = (graph, key, visited) => { |
| 4 | let min = INF; |
| 5 | let minIndex = 0; |
| 6 | for (let v = 0; v < graph.length; v++) { |
| 7 | if (visited[v] === false && key[v] < min) { |
| 8 | min = key[v]; |
| 9 | minIndex = v; |
| 10 | } |
| 11 | } |
| 12 | return minIndex; |
| 13 | }; |
| 14 | |
| 15 | const prim = (graph) => { |
| 16 | const parent = []; // Stores the MST |