Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Save more on your purchases! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
Arrow left icon
All Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Newsletter Hub
Free Learning
Arrow right icon
timer SALE ENDS IN
0 Days
:
00 Hours
:
00 Minutes
:
00 Seconds
Arrow up icon
GO TO TOP
PySpark Cookbook

You're reading from   PySpark Cookbook Over 60 recipes for implementing big data processing and analytics using Apache Spark and Python

Arrow left icon
Product type Paperback
Published in Jun 2018
Publisher Packt
ISBN-13 9781788835367
Length 330 pages
Edition 1st Edition
Languages
Concepts
Arrow right icon
Authors (2):
Arrow left icon
 Lee Lee
Author Profile Icon Lee
Lee
 Drabas Drabas
Author Profile Icon Drabas
Drabas
Arrow right icon
View More author details
Toc

Table of Contents (13) Chapters Close

Title Page
Packt Upsell
Contributors
Preface
1. Installing and Configuring Spark FREE CHAPTER 2. Abstracting Data with RDDs 3. Abstracting Data with DataFrames 4. Preparing Data for Modeling 5. Machine Learning with MLlib 6. Machine Learning with the ML Module 7. Structured Streaming with PySpark 8. GraphFrames – Graph Theory with PySpark Index

Finding the fewest number of connections


When you're flying to many cities, one of the recurring problems is to determine either the shortest path between two cities or the shortest time of travel. From the viewpoint of the airline traveler, the aim is to find the shortest set of flights between two cities. From the viewpoint of the airline, determining how to route their passengers between cities as efficiently as possible increases customer satisfaction and lowers prices (less fuel, wear and tear on equipment, ease for the flight crew, and so on). Within the context of GraphFrames and graph algorithms, one approach would be to use the breadth first search (BFS) algorithm to help us find the shortest path between these airports.

Getting ready

Ensure that you have created the graph GraphFrame from the preceding subsections.

How to do it...

Let's start using our BFS algorithm to determine whether there are any direct flights between SFO and SEA:

subsetOfPaths = graph.bfs(
   fromExpr = "id = ...
lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at £13.99/month. Cancel anytime
Visually different images