QuickFind

by Shridhar Baddur

JavaScript

let id = [];

function quickFindUF(n) {
  for (let i = 0; i < n; i++) {
    id[i] = i;
  }
}

function connected(p, q) {
  return (id[p] == id[q]);
}

function union(p, q) {
  let pid = id[p];
  let qid = id[q];
  for (let i = 0; i < id.length; i++) {
    if (id[i] == pid) {
      id[i] = qid;
    }
  }
  document.write(id + '<br/>');
}
quickFindUF(10);
union(4, 3);
union(3, 8);
union(6, 5);
union(9, 4);
union(2, 1);
union(8, 9);
union(5, 0);
union(7, 2);
union(6, 1);
union(1, 0);
union(6, 7);