Single Linkage Clustering Calculator
Generate the agglomerative single-linkage merge sequence for entered two-dimensional points.
YOUR CALCULATION
Result
—
Calculation steps
Work through one step at a time or reveal the complete calculation. The steps use your current inputs.
How to calculate
Merge the closest current clusters, breaking exact ties by current cluster order.
Distance between clusters=min Euclidean distance between any member pair
Worked example
Points at0,1,5,6 on one axis merge at distances1,1,4.
Assumptions and input details
Two-dimensional Euclidean distances in matching coordinate units, at most50 points. Ties may give a different but equivalent merge order. Labels in the result use one-based entered point indices.
Using this calculator
Can I enter my own problem?
Yes. Replace the example values with your own inputs. The result, calculation steps, tables and applicable diagrams update from those inputs. Blank or invalid values clear the result; example values are never silently substituted for missing inputs.
Are the results exact?
Results use floating-point arithmetic and displayed rounding. Read the formula, assumptions and any stated data precision before interpreting the result.
Is my input uploaded?
The calculation runs in your browser. No account, file upload or external AI service is required. Inputs are not saved between page reloads.
Enter two Cartesian points to find their distance, midpoint, coordinate changes and direction. Choose a shared input unit and compare output lengths.
Partition scalar observations into contiguous sorted clusters with the globally minimum squared error.
Find a least-total-weight undirected connection spanning every entered node and list its selected edges.
Reserved advertising space.