Data Structures and Algorithms in Java

var vertices = 8;
var C = [];

function falseSet(number) {
var array = [];
for (count = 0; count < number; count++) {
array[count] = false;
}
return array;
}

for (n = 1; n <= vertices; n++) {
C[n] = falseSet(vertices);
C[n][n-1] = true;
}

var Q = [ Set of several bridge lengths between 8 vertices in format [length of bridge,[id number of vertex A,id number of vertex B]] ];
Q.sort();

var T = [];

for (m = 0; m < Q.length; m++) {
var v = Q[m][1][0];
var u = Q[m][1][1];
if (C[v] !== C[u]) {
T.push(Q[m]);
var thisCluster = falseSet(vertices);
for (i = 0; i < vertices; i++) {
if (C[v][i] || C[u][i]) {
thisCluster[i] = true;
}
}
for (i = 0; i < vertices; i++) {
if (thisCluster[i]) {
C[i+1] = thisCluster;
}
}
}
}