'Bfs naturally defines' diaporamas de présentation

Lecture 12

333 views • 12 slides

Lecture 13

209 views • 9 slides

Breadth First Search (BFS)

Breadth First Search (BFS). Is s connected to t ?. Build layers of vertices connected to s. L j : all nodes at distance j from s. L 0 = {s}. Assume L 0 ,..,L j have been constructed. L j+1 set of vertices not chosen yet but are connected to L j. Stop when new layer is empty.

67 views • 2 slides