Determinating shortest paths from one vertex using an algorithm of breadth-first search

Authors

  • Stepan Vynnychuk National Academy of Sciences of Ukraine Pukhov Institute for Modelling in Energy Engineering,

DOI:

https://doi.org/10.20535/2411-1031.2012.1.1.52706

Abstract

A method for determining the shortest path from one vertex of a weighted graph using the search algorithm in width. Gives estimates of the computational complexity of the algorithm and the cost of memory.

Author Biography

Stepan Vynnychuk, National Academy of Sciences of Ukraine Pukhov Institute for Modelling in Energy Engineering,

Doctor of Technical Sciences, Senior Researcher, Deputy Director for Scientific work

References

Кормен Т. Алгоритмы: построение и анализ / [Кормен Т., Лейзерсон Ч., Риверст Р., Штайн К.]. – [2-е изд.]. – М. : Издательский дом “Вильямс”, 2011. – 1296 с.

Published

2012-06-30

How to Cite

Vynnychuk, S. (2012). Determinating shortest paths from one vertex using an algorithm of breadth-first search. Information Technology and Security, 1(1), 16–20. https://doi.org/10.20535/2411-1031.2012.1.1.52706

Issue

Section

ARTICLES