Breadth first search

Материал из WikiGrapp
Перейти к:навигация, поиск

Breadth first searchпоиск в ширину.

Given the adjacency lists A(v) for each vertex v of a connected graph (directed or undirected), the following algorithm conducts a breadth first search. On completion of the search, each vertex has acquired a breadth first index (BFI) indicating the order in which the vertex was visited. The vertex u is visited first and BFI(u)
= 0.


  • Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.