Chapter 6. Other useful graph algorithms
This chapter covers
- Standard graph algorithms that GraphX doesn’t provide out of the box
- Shortest Paths on graphs with weighted edges
- The Traveling Salesman problem
- Minimum Spanning Trees
In chapter 5 you learned the foundational GraphX APIs that will enable you to write your own custom algorithms. But there’s no need for you to reinvent the wheel in those cases where the GraphX API already provides an implemented standard algorithm. There are some algorithms that have been historically associated with graphs for decades but are not in the GraphX API. This chapter describes some of those classic graph algorithms and discusses which situations they can be used in.
These classic graph algorithms ...
Get Spark GraphX in Action now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
