2022
DOI: 10.31660/2782-232x-2022-1-80-87
|View full text |Cite
|
Sign up to set email alerts
|

Comparative Analysis of Methods for Finding the Shortest Distance in a Graph

Abstract: Currently, there is a high need to determine the shortest distances to form freight and passenger transportation routes. One of the most effective ways to determine routes of minimum length are methods of finding the shortest distances in a graph. The article discusses algorithms for finding shortest distances, as well as other methods based on the principles of their operation. It was conducted a comparative analysis to identify the advantages and disadvantages of using these methods in routing tasks.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
references
References 0 publications
0
0
0
Order By: Relevance