To generate explanations, a Python package was written to implement the calculation of Myerson values according to Section 2.1. A subroutine to find the connected components in a graph was implemented in C++ for performance reasons. For ease of distribution the package does not make use of this code but the source code is available on GitHub. For larger graphs, the Myerson values were approximated using Monte Carlo sampling of coalitions. The package is available at .