Chapter 5. Built-in algorithms
This chapter covers
- Algorithms that come with the GraphX API
- Detecting clusters within graphs: PageRank, Shortest Paths, Connected Components, Label Propagation
- Measuring connectedness of a graph or subgraph with Triangle Count
- Measuring the connectedness of a subset of users in a social network graph and finding isolated populations
In chapter 4 you learned about the foundational GraphX APIs that enable you to write your own custom algorithms. But there’s no need for you to reinvent the wheel in cases where the GraphX API already provides an implemented standard algorithm. In this chapter, we describe some of those basic algorithms and discuss which situations they can be used in:
- Personalized ...