Implement the computation of mappings

[otaviomacedo]

Using the digest function, implement the computation of the mapping between resources before and after the refactoring.

More formally:

Let $G$ and $H$ be two resource graphs. Implement a function that generates a list of resource pairs $(g, h)$ with $g \in G$, $h \in H$, such that $x \equiv y$.