Hands-On Software Engineering with Golang

Partitioning links and edges for processing the graph in parallel

As you have probably noticed by their signatures, the Links and Edges methods are designed to return an iterator so that they can access a filtered subset of the graph's vertices and edges. More specifically, they do the following:

• The Links method returns a set of links whose ID belongs to the [fromID, toID) range and their last retrieval time before the provided timestamp.
• The Edges method returns the set of edges whose origin vertex IDs belong to the [fromID, toID) range and their last update time is before the provided timestamp.

At this point, we need to spend some time and elaborate on the reasoning behind the design of these methods. We could argue that, at some point, ...