Новая страница: «'''Breadth first search''' --- поиск в ширину. Given the adjacency lists <math>A(v)</math> for each vertex <math>v</math> of a connected graph (directe…»
(Новая страница: «'''Breadth first search''' --- поиск в ширину. Given the adjacency lists <math>A(v)</math> for each vertex <math>v</math> of a connected graph (directe…»)