A research of calculating the shortest distance in euclidean network

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 algorithm's ti...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Jun Yang, Yingxun Fu, Liu Jiang, Junde Song
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Algorithm design and analysis
Computer networks
Costs
Data structures
DOTP
Encoding
Euclidean network
Intelligent networks
Laboratories
Rail transportation
shortest distance
Tree graphs
XML
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 algorithm's 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 t 2 .
ISSN:2374-0272
DOI:10.1109/ICNIDC.2009.5360837