TY - JOUR AU - Vynnychuk, Stepan PY - 2012/06/30 Y2 - 2024/03/28 TI - Determinating shortest paths from one vertex using an algorithm of breadth-first search JF - Collection "Information Technology and Security" JA - ITS VL - 1 IS - 1 SE - DO - 10.20535/2411-1031.2012.1.1.52706 UR - https://its.iszzi.kpi.ua/article/view/52706 SP - 16-20 AB - <p align="justify">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.</p> ER -