Dynamic Connectivity

[haikov]

Description

Given a set of N items. Some of them are connected between each other. The problem here is to answer the questions, are two items (let's call them p and q) connected or not?

Algorithm's Requirements

1. JS class that takes integer N as an initializer.
2. Implements union(p: number, q: number): void method that creates a connection between 2 nodes.
3. Implements find(p: number, q: number): boolean method that answers the question is p connected to q.

Implement the following algorithm's versions:

1. Quick Find.
2. Quick Union.
3. Weighted Quick Union with Path Compressions.

UI Requirements

The UI should provide the ability to:

1. Select an algorithm.
2. Load seed data.
3. Visualize the work of the algorithm.