Solving interesting graph problems

In this section, we will be examining three very popular graph-based problems that are good fits for the graph processing system we have just finished building.

After describing each problem in detail and listing some of its potential real-world applications, we will continue our discussion by presenting a sequential algorithm that can be used to solve it. Following that, we will come up with an equivalent parallel version of the same algorithm and encode it as a compute function that can be used with the bspgraph package.

Searching graphs for the shortest path

If we look around, we are bound to encounter a plethora of quite challenging problems that essentially boil down to finding a path...