Algorithm Prim (double G[][], int n) {

Algorithm Prim (double G[][], int n) { //local data structures double dist[n]; int parent[n]; boolean V[n]; //visited double S = 0; //length of MST – only needed in Prim’s algorithm

www.academic.marist.edu