Menentukan Minimum Spanning Tree Pada Pemasangan Kabel Fiber Optik Jaringan 4g Di Universitas Sumatera Utara Menggunakan Algoritma Sollin Dan Algoritma Prim’s

LAMPIRAN

LISTING PROGRAM

ALGORITMA SOLLIN
private int MaxKey(double[] key, Boolean[] sett, int JumlahData)
{
double min = 0;
int minIndex = 0;
for (int i = 0; i = min)
{
min = key[i];
minIndex = i;
}
}
return minIndex;
}
private void CetakSolin(int[] Parent, double[,] Graph, int JumlahData)
{
String Log = "";
double Bobot, TBobot = 0;

txtLog.Clear();
for (int i = 1; i < JumlahData; i++)
{
Bobot = Graph[i, Parent[i]];
Log += "[" + i + "]\tKoordinat [" + (Parent[i]+1) + "]\tke\tKoordinat [" + (i+1) +
"]\tBobot : " + Bobot + " m\n";
TBobot += Bobot;
}
Log += "\nTotal Bobot adalah " + TBobot + " m\n";
txtLog.Text = Log;
txtBobot.Text = TBobot.ToString();
}
public int[] Solin(double[,] Graph, int JumlahData)
{
int[] parent = new int[JumlahData];
double[] key = new double[JumlahData];
Boolean[] mstSet = new Boolean[JumlahData];
for (int i = 0; i