Module 2: Closest Pair & Clustering Tree Formation

We use distance computations to find the closest pair of points and build a simple hierarchical clustering tree.

Dataset Status

Edit Data in Module 1

Closest Pair Detection

Clustering Tree (Agglomerative)

We repeatedly merge the two closest clusters until one cluster remains. This produces a clustering tree (bottom = individual points, top = one cluster). 


    


    

      
Proceed to Module 3 to compute optimal bus stop locations from clusters.

      Go to Module 3