利用距离矩阵求绝对中心及绝对重心的讨论(p=1)

Study of Searching an Absolute Center and an Absolute Median by Using Distance Matrix

给出了一种用最小距离矩阵和最优路径矩阵计算网络给对中心（ｐ＝１）的方法，同Ｈａｋｉｍｉ的图解的方法相比，本方法有计算简便，直观的优点。

A method is given, in the paper, to search a network's absolute center (p=1) by using the least distance matrix and its optimum path matrix, comparing with the Hakimi's method, this one is direct perception, simple, easy using. A discussion is also given to search absolute median(p=1) by using above two matrixes.