Determinating shortest paths from one vertex using an algorithm of breadth-first search
S.D. Vynnychuk · Collection Information technology and security · 2012
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.