Резюме:

This article is dedicated to one of the most pressing issues of finding the shortest path. Only the routing analysis algorithms may provide an answer to these problems, how to transmit data with a lossless fastest speed or finding the shortest path in the graph between the vertices. The article describes and clearly shows the most accurate for finding the shortest path algorithm Dijkstra´s algorithm for finding and lengths of the shortest paths between all pairs of vertices in a weighted directed graph Floyd. And summed up in selecting the most effective algorithm for transmitting various types of information.

Keywords: router, network, graph algorithm, vertices protocol metric

Planidin R.I. ¹ PROGRAMMING ALORITHM ROUTING // Вестник студенческой науки кафедры информационных систем и программирования. – 2017. – № 01;
URL: vsn.esrae.ru/1-5 (Date Access: 21.07.2025).

Today: 2081 | Week: 2082 | Total: 3028

Comments (0)