Part 2. Connecting vertices
GraphX has a large API with a number of built-in algorithms. But not all of the API is well-documented. Chapter 4 walks you through how to do basic operations in GraphX, including the cornerstone operations like pregel(), which is modeled after Google’s Pregel graph system.
Chapter 5 covers the core algorithms that GraphX provides, such as Page-Rank, and discusses how each can be used to solve a real-world problem.
After all that groundwork covered in the first five chapters, chapters 6 and 7 are where we finally really start putting GraphX into action. Chapter 6 shows how to implement some of the classical graph algorithms, such as Minimum Spanning Tree, in GraphX. You’ll also see an example of what Minimum Spanning ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access