January 2020
Intermediate to advanced
640 pages
16h 56m
English
So far, we intentionally designed the various Link 'R' Us components so that they are more or less decoupled from their input sources. For example, the crawler component from Chapter 7, Data-Processing Pipelines, expects an iterator that yields the set of links to be crawled, while the PageRank calculator component from Chapter 8, Graph-Based Data Processing, only provides convenience methods for creating the nodes and edges of the graph that are used by the PageRank algorithm.
To integrate these components into a larger application, we need to provide a thin layer that implements two key functions: