In our previous post we looked at the concept of a Random Walk on a graph and how they can be put to use. In this post we continue our exploration of different ways to move around a Graph by looking at Graph Search Algorithms that allow us to find a specific node and even determine the path to reach it.
We will introduce and compare Depth First Search, …
