Hands-On Software Engineering with Golang

Creating custom executor factories for wrapping existing graph instances

In Chapter 8, Graph-Based Data Processing, we explored the use of the bspgraph package to implement a few popular graph-based algorithms such as Dijkstra's shortest path, graph coloring, and PageRank. To orchestrate the end-to-end execution of the aforementioned algorithms, we relied on the API provided by the package's Executor type. However, instead of having our algorithm implementations directly invoke the Executor types constructor, we allowed the end users to optionally specify a custom executor factory for obtaining an Executor instance.

Any Go function that satisfies the following signature can be effectively used in place of the default constructor for a new ...