Description: By Euclidean distance on three-dimensional space, clustering of data points: from the file read into the three coordinates of the data indicated that cluster. According to the average number of total number of projects and group division. First, calculate the distance between 22 to elect the nearest two points, and then from small to large order to identify these two points away from a number of recent points. After removing these points the rest of the point of repeating to carry out such operations.
To Search:
- [RFC3261_CN] - Chinese version of the RFC3261 document,
- [md5] - md5 algorithm with pure C version. Easy
File list (Check if you may need any files):
mainprog.c
Download