Frank Kane's Taming Big Data with Apache Spark and Python

How the breadth-first search algorithm works?

So here's how breadth-first search works. Look at the following diagram. Let's imagine that every one of these circles represents one of the superheroes in our social graph. The lines represent the connections between them:

The line means that two superheroes appeared together in the same comic book at some point. You can see, you can have these kind of complicated relationships that go on. It's not really a straightforward problem; we need an algorithm to solve it. The idea is that we have associated each superhero with one of these circles in the diagram. Not only is there a superhero ID associated ...