A RESEARCH OF CALCULATING THE SHORTEST DISTANCE IN EUCLIDEAN NETWORK

摘要：

In this paper, we have designed DOTP (distance of two points) algorithm and some data structure to calculate the shortest distance between the two vertices in Euclidean network. We created a function which had a linear relation with vertices n and edges e in time complexity. This algorithms time complexity majority related with non-tree edges t which defined in chapter 2 and has a small magnitude because this algorithm has a linear relation with t2.

关键词： Euclidean network shortest distance DOTP

作者: Jun Yang Yingxun Fu Liu Jiang Junde Song

作者单位: Laboratory of computer network, Beijing University of Posts and Telecommunications, Beijing

会议类型: 国际会议

会议名称: 2009 IEEE International Conference on Network Infrastructure and Digital Content(2009年IEEE网络基础设施与数字内容国际会议 IEEE IC-NIDC2009)

会议地点: 北京

会议语种:英文

页码: 973-975

在线出版日期: 2009-11-06（万方平台首次上网日期，不代表论文的发表时间）