Clustering

For the given distance matrix:

$\backslash$table$[[,$P$1,$P$2,$P$3,$P$4,$P$5,$P$6],[$P$1,0,,,,,],[$P$2,0\mathrm{.}23,0,,,,],[$P$3,0\mathrm{.}22,0\mathrm{.}15,0,,,],[$P$4,0\mathrm{.}37,0\mathrm{.}20,0\mathrm{.}15,0,,],[$P$5,0\mathrm{.}34,0\mathrm{.}14,0\mathrm{.}28,0\mathrm{.}29,0,],[$P$6,0\mathrm{.}23,0\mathrm{.}25,0\mathrm{.}11,0\mathrm{.}22,0\mathrm{.}39,0]]$

Now we merge P$3$ and P$6$ as a cluster and will get the new distance matrix.

Based on the single link $($min distance$)$ to update the new distance matrix.

Based on the complete link $($max distance$)$ to update the new distance matrix.