A Tale of BFS: Going Parallel

Great talk from Egon Elbre at https://twitter.com/gopherconeu 2020.

Breadth First Search is one of those fundamental graphs algorithms and also is foundation to many other problems. The basic idea is to move through a graph starting from a source node and visit everything one layer at a time.