python code that updates the Euclidean distance matrix using single linkage and using labels as index in the distance matrix until one cluster is formed # Sample data

data$\_$points $=\{$

$\text{'}$P$1\text{'}$: $[5\mathrm{.}1,3\mathrm{.}5],$

$\text{'}$P$2\text{'}$: $[4\mathrm{.}9,3\mathrm{.}0],$

$\text{'}$P$3\text{'}$: $[4\mathrm{.}7,3\mathrm{.}2],$

$\text{'}$P$4\text{'}$: $[4\mathrm{.}6,3\mathrm{.}1],$

$\text{'}$P$5\text{'}$: $[5\mathrm{.}0,3\mathrm{.}6],$

$\text{'}$P$6\text{'}$: $[5\mathrm{.}4,3\mathrm{.}9]\}$