Would you like to know what Uber, Google Maps, and your favorite airline have in common?
They all know how to solve the Connectivity Problem.
This post is the third (and last) of the introductory series in my upcoming book, The Competitive Programmer Graphs Handbook.
Take a look at the post to understand the foundations of graph traversals and connected components before we dive into more complex topics in future editions.
Enjoy.
