Chapter 11. Graph Processing Using GraphX
This chapter will cover how we can do graph processing using GraphX, Spark's graph processing library.
The chapter is divided into the following recipes:
- Fundamental operations on graphs
- Using PageRank
- Finding connected components
- Performing neighborhood aggregation
Introduction
Graph analysis is much more commonplace in our life than we think. To take the most common example, when we ask a GPS to find the shortest route to a destination, it uses a graph-processing algorithm.
Let's start by understanding graphs. A graph is a representation of a set of vertices where some pairs of vertices are connected by edges. When these edges move from one direction to another, it's called a directed graph or digraph.
GraphX ...
Get Spark Cookbook 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.
